The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The best published academic record is the factorization of an 829 bit RSA modulus in 2020, see [11] for details regarding this computation.”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [11]
Citations
Cites
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits
Escudero, D. E., Ghosh, S., Keller, M., Rachuri, R., & Schöll, P. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_29 · Cited by 137
Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback
Blum, E., Liu-Zhang, C.-D., & Loss, J. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_25 · Cited by 41
Black-Box Transformations from Passive to Covert Security with Public Verifiability
Damgård, I., Orlandi, C., & Simkin, M. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-56880-1_23 · Cited by 14
Cited by
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
Authenticating Pervasive Devices with Human Protocols
Juels, A., & Weis, S. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_18 · Cited by 718
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys
Delerablée, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-76900-2_12 · Cited by 447
The Poly1305-AES Message-Authentication Code
Bernstein, D. J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11502760_3 · Cited by 362
Metadata
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2020
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2480498986
- Cited by
- 628
- References
- 3
- Citations by year
- 2024: 5 · 2023: 6 · 2022: 4 · 2021: 1
- FWCI
- 1.05
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- cryptography, cryptographic primitives, cryptographic protocols, secure implementation, hardware security, program optimization, applied cryptography, cryptanalysis
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II. https://app.cochat.ai/papers/10.1007/978-3-030-56880-1
- The paper
- Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II. (2020). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-56880-1
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.