The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Public-Key Cryptosystems Resilient to Key Leakage
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
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
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2005) · Proceedings of the thirty-seventh annual ACM symposium on Theory of computing · doi:10.1145/1060590.1060603 · Cited by 2,313
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
Dodis, Y., Ostrovsky, R., Reyzin, L., & Smith, A. (2008) · SIAM Journal on Computing · doi:10.1137/060651380 · Cited by 1,717
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
Lower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
A hard-core predicate for all one-way functions
Goldreich, O., & Levin, L. A. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73010 · Cited by 1,193
Public-key cryptosystems provably secure against chosen ciphertext attacks
Naor, M., & Yung, M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100273 · Cited by 1,088
Self-citationPrivate Circuits: Securing Hardware against Probing Attacks
Ishai, Y., Sahai, A., & Wagner, D. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_27 · Cited by 1,073
Dolev, D., Dwork, C., & Naor, M. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103474 · Cited by 990
Self-citationLest we remember: cold-boot attacks on encryption keys
Halderman, J. A., Schoen, S. D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J. A., Feldman, A. J., Appelbaum, J., & Felten, E. W. (2009) · Communications of the ACM · doi:10.1145/1506409.1506429 · Cited by 980
Cramer, R., & Shoup, V. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403773 · Cited by 978
Non-interactive zero-knowledge and its applications
Blum, M., Feldman, P., & Micali, S. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62222 · Cited by 904
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
Cramer, R., & Shoup, V. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_4 · Cited by 831
Dolev, D., Dwork, C., & Naor, M. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539795291562 · Cited by 746
Self-citationOne-way functions are necessary and sufficient for secure signatures
Rompel, J. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100269 · Cited by 695
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Sahai, A. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814628 · Cited by 575
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Applebaum, B., Cash, D., Peikert, C., & Sahai, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_35 · Cited by 562
Leakage-Resilient Cryptography
Dziembowski, S., & Pietrzak, K. (2008) · 2008 49th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2008.56 · Cited by 504
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
Akavia, A., Goldwasser, S., & Vaikuntanathan, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00457-5_28 · Cited by 490
Blum, M., De Santis, A., Micali, S., & Persiano, G. (1991) · SIAM Journal on Computing · doi:10.1137/0220068 · Cited by 427
A New Randomness Extraction Paradigm for Hybrid Encryption
Kiltz, E., Pietrzak, K., Stam, M., & Yung, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_34 · Cited by 384
Physically Observable Cryptography
Micali, S., & Reyzin, L. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24638-1_16 · Cited by 378
On Cryptographic Assumptions and Challenges
Naor, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_6 · Cited by 360
Self-citationCircular-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
A Leakage-Resilient Mode of Operation
Pietrzak, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_27 · Cited by 261
Conditionally-perfect secrecy and a provably-secure randomized cipher
Maurer, U. M. (1992) · Journal of Cryptology · doi:10.1007/bf00191321 · Cited by 259
Signature Schemes with Bounded Leakage Resilience
Katz, J., & Vaikuntanathan, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_41 · Cited by 257
Cryptography against Continuous Memory Attacks
Dodis, Y., Haralambiev, K., Lopez-Alt, A., & Wichs, D. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.56 · Cited by 239
Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups
Joux, A., & Nguyen, K. (2003) · Journal of Cryptology · doi:10.1007/s00145-003-0052-4 · Cited by 239
On cryptography with auxiliary input
Dodis, Y., Kalai, Y. T., & Lovett, S. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536498 · Cited by 228
Analysis of the Linux random number generator
Gutterman, Z., Pinkas, B., & Reinman, T. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.5 · Cited by 219
Public-Key Encryption in the Bounded-Retrieval Model
Alwen, J., Dodis, Y., Naor, M., Segev, G., Walfish, S., & Wichs, D. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_6 · Cited by 206
Self-citationPublic-Key Encryption Schemes with Auxiliary Inputs
Dodis, Y., Goldwasser, S., Tauman Kalai, Y., Peikert, C., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11799-2_22 · Cited by 198
Exposure-Resilient Functions and All-or-Nothing Transforms
Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., & Sahai, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_33 · Cited by 191
Private Circuits II: Keeping Secrets in Tamperable Circuits
Ishai, Y., Prabhakaran, M., Sahai, A., & Wagner, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_19 · Cited by 175
When private keys are public: results from the 2008 Debian OpenSSL vulnerability
Yilek, S., Rescorla, E., Shacham, H., Enright, B., & Savage, S. (2009) · Proceedings of the 9th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1644893.1644896 · Cited by 164
Reconstructing RSA Private Keys from Random Key Bits
Heninger, N., & Shacham, H. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_1 · Cited by 156
Faust, S., Kiltz, E., Pietrzak, K., & Rothblum, G. N. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11799-2_21 · Cited by 144
Bounded Key-Dependent Message Security
Barak, B., Haitner, I., Hofheinz, D., & Ishai, Y. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13190-5_22 · Cited by 141
On the (Im)possibility of Cryptography with Imperfect Randomness
Dodis, Y., Ong, S. J., Prabhakaran, M., & Sahai, A. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.44 · Cited by 110
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
Dodis, Y., Sahai, A., & Smith, A. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_19 · Cited by 100
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Lyubashevsky, V., Palacio, A., & Segev, G. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11799-2_23 · Cited by 93
Self-citationBrakerski, Z., & Goldwasser, S. (2010) · Cited by 78
Black-Box Circular-Secure Encryption beyond Affine Functions
Brakerski, Z., Goldwasser, S., & Kalai, Y. T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19571-6_13 · Cited by 73
A block cipher based pseudo random number generator secure against side-channel key recovery
Petit, C., Standaert, F., Pereira, O., Malkin, T., & Yung, M. M. (2008) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/1368310.1368322 · Cited by 70
Cryptanalysis of the windows random number generator
Dorrendorf, L., Gutterman, Z., & Pinkas, B. (2007) · Proceedings of the ACM Conference on Computer and Communications Security · doi:10.1145/1315245.1315304 · Cited by 63
Survey: Leakage Resilience and the Bounded Retrieval Model
Alwen, J., Dodis, Y., & Wichs, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14496-7_1 · Cited by 59
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography
Kamp, J., & Zuckerman, D. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238184 · Cited by 57
Cryptography Resilient to Continual Memory Leakage
Brakerski, Z., Kalai, Y. T., Katz, J. I., & Vaikuntanathan, V. (2010) · Cited by 32
Cited by
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
A Leakage-Resilient Mode of Operation
Pietrzak, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_27 · Cited by 261
Signature Schemes with Bounded Leakage Resilience
Katz, J., & Vaikuntanathan, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_41 · Cited by 257
Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage
Brakerski, Z., Kalai, Y. T., Katz, J., & Vaikuntanathan, V. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.55 · Cited by 242
Metadata
- Authors
- Naor, M., & Segev, G.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 18-35
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1547517307
- Cited by
- 403
- References
- 54
- FWCI
- 31.50
- 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.