The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
On the Importance of Eliminating Errors in Cryptographic Computations
Open accessOverview
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Kocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_9 · Cited by 4,387
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9780429466335 · Cited by 1,770
Differential fault analysis of secret key cryptosystems
Biham, E., & Adi Shamir, Z. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052259 · Cited by 1,671
On the Importance of Checking Cryptographic Protocols for Faults
Boneh, D., DeMillo, R. A., & Lipton, R. J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_4 · Cited by 1,496
Self-citationZero-knowledge proofs of identity
Feige, U., Fiat, A., & Shamir, A. (1988) · Journal of Cryptology · doi:10.1007/bf02351717 · Cited by 1,029
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Rabin, M. O. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,020
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
Cited by
The Sorcerer's Apprentice Guide to Fault Attacks
Bar-El, H., Choukri, H., Naccache, D., Tunstall, M., & Whelan, C. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2005.862424 · Cited by 743
Fault Injection Attacks on Cryptographic Devices: Theory, Practice, and Countermeasures
Barenghi, A., Breveglieri, L., Koren, I., & Naccache, D. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2188769 · Cited by 609
BiTR: Built-in Tamper Resilience
Choi, S. G., Kiayias, A., & Malkin, T. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_40 · Cited by 590
Security in embedded systems: Design challenges
Ravi, S., Raghunathan, A., Kocher, P., & Hattangady, S. (2004) · ACM Transactions on Embedded Computing Systems · doi:10.1145/1015047.1015049 · Cited by 463
Security as a new dimension in embedded system design
Kocher, P., Lee, R., McGraw, G., Raghunathan, A., & Ravi, S. (2004) · Proceedings of the 41st annual Design Automation Conference · doi:10.1145/996566.996771 · Cited by 394
Fault Attacks on RSA with CRT: Concrete Results and Practical Countermeasures
Aumüller, C., Bier, P., Fischer, W., Hofreiter, P., & Seifert, J.-P. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5_20 · Cited by 261
Fault-based attack of RSA authentication
Pellegrini, A., Bertacco, V., & Austin, T. (2010) · 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010) · doi:10.1109/date.2010.5456933 · Cited by 56
Singh, P., Hasija, T., Ramkumar, K. R., & Kanika (2026) · Discover Computing · doi:10.1007/s10791-026-10577-0
“The first are chaos [27–31] and DNA-based schemes [12–14] which have almost ideal statistical security, and are, in recent work, real-time efficient, but are purely symmetric constructions, in which the secret keys (chaotic parameters and initial values) have to be transported through a channel…”
Metadata
- Authors
- Boneh, D., DeMillo, R. A., & Lipton, R. J.
- Venue
- Journal of Cryptology
- Published
- 2000-11-27
- Volume
- 14
- Issue
- 2
- Pages
- 101-119
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W2066425771
- Cited by
- 514
- References
- 16
- FWCI
- 7.50
- Type
- journal article
- Language
- en
- Open access
- bronze
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.