The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Advances in Cryptology — CRYPTO ’91: Proceedings
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
Ji, Z., Liu, Y.-K., & Song, F. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_5 · Cited by 333
Optimizing Authenticated Garbling for Faster Secure Two-Party Computation
Katz, J. I., Ranellucci, S., Rosulek, M., & Wang, X. S. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_13 · Cited by 54
Lower Bounds on Lattice Enumeration with Extreme Pruning
Aono, Y., Nguyễn, P. Q., Seito, T., & Shikata, J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96881-0_21 · Cited by 24
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing
Dinur, I., Keller, N., & Klein, O. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-96878-0_8 · Cited by 17
Cited by
Linear Cryptanalysis Method for DES Cipher
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_33 · Cited by 2,748
Secure quantum key distribution with realistic devices
Xu, F., Ma, X., Zhang, Q., Lo, H.-K., & Pan, J.-W. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.025002 · Cited by 1,543
Multiparty Computation from Somewhat Homomorphic Encryption
Damgård, I., Pastro, V., Smart, N., & Zakarias, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_38 · Cited by 1,331
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Courtois, N. T. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_11 · Cited by 904
A practical secret voting scheme for large scale elections
Fujioka, A., Okamoto, T., & Ohta, K. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57220-1_66 · Cited by 832
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
Oblivious transfer and polynomial evaluation
Naor, M., & Pinkas, B. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301312 · Cited by 629
Constant-Size Commitments to Polynomials and Their Applications
Kate, A., Zaverucha, G. M., & Goldberg, I. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_11 · Cited by 624
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
Vaudenay, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-76900-2_5 · Cited by 390
How to Securely Outsource Cryptographic Computations
Hohenberger, S., & Lysyanskaya, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_15 · Cited by 361
Public-key cryptography and password protocols
Halevi, S., & Krawczyk, H. (1999) · ACM Transactions on Information and System Security · doi:10.1145/322510.322514 · Cited by 314
Circular-Secure Encryption from Decision Diffie-Hellman
Boneh, D., Halevi, S., Hamburg, M., & Ostrovsky, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_7 · Cited by 293
Desmedt, Y. G. (1994) · European Transactions on Telecommunications · doi:10.1002/ett.4460050407 · Cited by 292
The strict avalanche criterion randomness test
Castro, J. C. H., Sierra, J. M., Seznec, A., Izquierdo, A., & Ribagorda, A. (2005) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2004.09.001 · Cited by 122
The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives
Nguyen, M.-H. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_25 · Cited by 7
Metadata
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1992
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2475786860
- Cited by
- 687
- References
- 4
- FWCI
- 8.46
- 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.