The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998
Merkle, R. C. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_21 · Cited by 1,691
Constructing Digital Signatures from a One Way Function
Lamport, L. (2016) · Cited by 649
Secrecy, authentication, and public key systems
Merkle, R. C. (1979) · Cited by 518
RIPEMD-160: A strengthened version of RIPEMD
Dobbertin, H., Bosselaers, A., & Preneel, B. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60865-6_44 · Cited by 487
On-line/off-line digital signatures
Even, S., Goldreich, O., & Micali, S. (1996) · Journal of Cryptology · doi:10.1007/bf02254791 · Cited by 318
The BiBa one-time signature and broadcast authentication protocol
Perrig, A. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.501988 · Cited by 304
A New Forward-Secure Digital Signature Scheme
Abdalla, M., & Reyzin, L. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_10 · Cited by 247
Self-citationCryptography: A new dimension in computer data security
Bookstein, A. (1985) · Information Processing & Management · doi:10.1016/0306-4573(85)90072-x · Cited by 213
A compact and fast hybrid signature scheme for multicast packet authentication
Rohatgi, P. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319722 · Cited by 178
Provably Unforgeable Signatures
Bos, J., & Chaum, D. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_1 · Cited by 62
On the efficiency of one-time digital signatures
Bleichenbacher, D., & Maurer, U. M. (1996) · Lecture notes in computer science · doi:10.1007/bfb0034843 · Cited by 55
One-Time Identification with Low Memory
Serge Vaudenay, B. (1993) · Springer eBooks · doi:10.1007/978-3-7091-2786-5_19 · Cited by 23
Cited by
Cyber security in the Smart Grid: Survey and challenges
Wang, W., & Lu, Z. (2013) · Computer Networks · doi:10.1016/j.comnet.2012.12.017 · Cited by 1,123
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00019-2 · Cited by 830
A survey on the communication architectures in smart grid
Wang, W., Xu, Y., & Khanna, M. (2011) · Computer Networks · doi:10.1016/j.comnet.2011.07.010 · Cited by 784
Rushing attacks and defense in wireless ad hoc network routing protocols
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2003) · Proceedings of the 2nd ACM workshop on Wireless security · doi:10.1145/941311.941317 · Cited by 638
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks
Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003) · Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications · doi:10.1109/mcsa.2002.1017480 · Cited by 636
Metadata
- Authors
- Reyzin, L., & Reyzin, N.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 144-153
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2127892706
- Cited by
- 295
- References
- 14
- FWCI
- 7.88
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.