The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Shared generation of authenticators and signatures
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756 · cited 3×
“This is similar to the concept of threshold schemes [Bl, Sh ].”
BackgroundMethodResultInfluentialA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Safeguarding cryptographic keys
BLAKLEY, G. R. (1979) · 1979 International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817296 · Cited by 3,499
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
The art of computer programming. Vol.2: Seminumerical algorithms
Knuth, D. E. (1981) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,232
Information Theory and Reliable Communication
Gallager, R. (1972) · Springer eBooks · doi:10.1007/978-3-7091-2945-6 · Cited by 1,204
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_28 · Cited by 1,131
Self-citationMagid, A. R., & Jacobson, N. S. (1986) · American Mathematical Monthly · doi:10.2307/2322348 · Cited by 833
Secure communications over insecure channels
Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A., Vanstone, S., & Okamoto, T. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103434 · Cited by 337
Advances in Cryptology — CRYPTO ’85 Proceedings
(1986) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x · Cited by 158
Advances in Cryptology — CRYPTO’ 89 Proceedings
(1990) · Lecture notes in computer science · doi:10.1007/0-387-34805-0 · Cited by 131
Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme
Goldreich, O. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_8 · Cited by 129
Protocol failures in cryptosystems
Moore, J. H. (1988) · Proceedings of the IEEE · doi:10.1109/5.4444 · Cited by 123
Digital signatures with RSA and other public-key cryptosystems
Denning, D. E. (1984) · Communications of the ACM · doi:10.1145/358027.358052 · Cited by 100
Rivest-Shamir-Adleman public key cryptosystems do not always conceal messages
Blakley, G. R., & Borosh, I. (1979) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(79)90039-7 · Cited by 67
Attacks on Some RSA Signatures
de Jonge, W., & Chaum, D. (1986) · Lecture notes in computer science · doi:10.1007/3-540-39799-x_3 · Cited by 38
Secret Sharing Over Infinite Domains
Chor, B., & Kushilevitz, E. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_27 · Cited by 13
Infinite Structures in Information Theory
Blakley, G. R., & Swanson, L. (1983) · Springer eBooks · doi:10.1007/978-1-4757-0602-4_4 · Cited by 12
Cited by
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
Practical Threshold Signatures
Shoup, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_15 · Cited by 874
The TESLA Broadcast Authentication Protocol
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6073610 · Cited by 842
Secret-Sharing Schemes: A Survey
Beimel, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20901-7_2 · Cited by 652
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
Gennaro, R., Rabin, M. O., & Rabin, T. (1998) · Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 · doi:10.1145/277697.277716 · Cited by 464
Metadata
- Authors
- Desmedt, Y., & Frankel, Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-08-11
- Pages
- 457-469
- OpenAlex
- W1883290937
- Cited by
- 394
- References
- 25
- FWCI
- 16.70
- 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.