The DOI matches its Crossref record.
Advances in Cryptology — CRYPTO’ 99: 19th Annual International Cryptology Conference Santa Barbara, California, USA, August 15–19, 1999 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
Cited by
The security of practical quantum key distribution
Scarani, V., Bechmann-Pasquinucci, H., Cerf, N. J., Dušek, M., Lütkenhaus, N., & Peev, M. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.1301 · Cited by 3,726
EPnP: An Accurate O(n) Solution to the PnP Problem
Lepetit, V., Moreno-Noguer, F., & Fua, P. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0152-6 · Cited by 3,298
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
How to Break MD5 and Other Hash Functions
Wang, X., & Yu, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_2 · Cited by 1,440
Electromagnetic Analysis: Concrete Results
Gandolfi, K., Mourtel, C., & Olivier, F. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44709-1_21 · Cited by 1,311
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
ElectroMagnetic Analysis (EMA): Measures and Counter-measures for Smart Cards
Quisquater, J.-J., & Samyde, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45418-7_17 · Cited by 1,077
Kamara, S., & Lauter, K. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14992-4_13 · Cited by 1,071
A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks
Standaert, F.-X., Malkin, T. G., & Yung, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_26 · Cited by 925
Curve25519: New Diffie-Hellman speed records
Bernstein, D. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_14 · Cited by 859
Improved Garbled Circuit: Free XOR Gates and Applications
Kolesnikov, V., & Schneider, T. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70583-3_40 · Cited by 743
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
BKZ 2.0: Better Lattice Security Estimates
Chen, Y., & Nguyen, P. Q. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_1 · Cited by 598
The PHOTON Family of Lightweight Hash Functions
Guo, J., Peyrin, T., & Poschmann, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_13 · Cited by 558
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
Information and computation: Classical and quantum aspects
Galindo, A., & Martín-Delgado, M. A. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.347 · Cited by 552
ID-Based Blind Signature and Ring Signature from Pairings
Zhang, F., & Kim, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_33 · Cited by 530
Information-theoretic security proof for quantum-key-distribution protocols
Renner, R., Gisin, N., & Kraus, B. (2005) · Physical Review A · doi:10.1103/physreva.72.012332 · Cited by 520
An optical ultrafast random bit generator
Kanter, I., Aviad, Y., Reidler, I., Cohen, E., & Rosenbluh, M. (2010) · Nature Photonics · doi:10.1038/nphoton.2009.235 · Cited by 504
The Montgomery Powering Ladder
Joye, M., & Yen, S.-M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5_22 · Cited by 496
Rainbow, a New Multivariable Polynomial Signature Scheme
Ding, J., & Schmidt, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496137_12 · Cited by 488
The 128-Bit Blockcipher CLEFIA (Extended Abstract)
Shirai, T., Shibutani, K., Akishita, T., Moriai, S., & Iwata, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74619-5_12 · Cited by 487
Maintaining Data Privacy in Association Rule Mining
Rizvi, S. J., & Haritsa, J. R. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50066-4 · Cited by 485
Efficient Receipt-Free Voting Based on Homomorphic Encryption
Hirt, M., & Sako, K. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_38 · Cited by 483
Ascon v1.2: Lightweight Authenticated Encryption and Hashing
Dobraunig, C., Eichlseder, M., Mendel, F., & Schläffer, M. (2021) · Journal of Cryptology · doi:10.1007/s00145-021-09398-9 · Cited by 478
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
Pushing the Limits: A Very Compact and a Threshold Implementation of AES
Moradi, A., Poschmann, A., Ling, S., Paar, C., & Wang, H. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_6 · Cited by 463
Founding Cryptography on Oblivious Transfer – Efficiently
Ishai, Y., Prabhakaran, M., & Sahai, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_32 · Cited by 460
“Squashed entanglement”: An additive entanglement measure
Christandl, M., & Winter, A. (2004) · Journal of Mathematical Physics · doi:10.1063/1.1643788 · Cited by 451
Keyword Search and Oblivious Pseudorandom Functions
Freedman, M. J., Ishai, Y., Pinkas, B., & Reingold, O. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_17 · Cited by 441
On the Indifferentiability of the Sponge Construction
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_11 · Cited by 425
Gama, N., & Nguyen, P. Q. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_3 · Cited by 413
Masking against Side-Channel Attacks: A Formal Security Proof
Prouff, E., & Rivain, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_9 · Cited by 383
Cache-Collision Timing Attacks Against AES
Bonneau, J., & Mironov, I. (2006) · Lecture Notes in Computer Science · doi:10.1007/11894063_16 · Cited by 367
The Poly1305-AES Message-Authentication Code
Bernstein, D. J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11502760_3 · Cited by 362
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
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
Stam, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_22 · Cited by 361
Squealing Euros: Privacy Protection in RFID-Enabled Banknotes
Juels, A., & Pappu, R. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45126-6_8 · Cited by 347
Accurate Non-Iterative O(n) Solution to the PnP Problem
Moreno-Noguer, F., Lepetit, V., & Fua, P. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4409116 · Cited by 295
Lattice Enumeration Using Extreme Pruning
Gama, N., Nguyen, P. Q., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_13 · Cited by 284
Leander, G., Paar, C., Poschmann, A., & Schramm, K. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74619-5_13 · Cited by 281
Breakthrough Silicon Scanning Discovers Backdoor in Military Chip
Skorobogatov, S., & Woods, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_2 · Cited by 275
On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoq Code Hopping Scheme
Eisenbarth, T., Kasper, T., Moradi, A., Paar, C., Salmasizadeh, M., & Shalmani, M. T. M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_12 · Cited by 268
SWIFFT: A Modest Proposal for FFT Hashing
Lyubashevsky, V., Micciancio, D., Peikert, C., & Rosen, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71039-4_4 · Cited by 265
The Software Performance of Authenticated-Encryption Modes
Krovetz, T., & Rogaway, P. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21702-9_18 · Cited by 262
An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem
Bellare, M., Boldyreva, A., & Palacio, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_11 · Cited by 261
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
Smaller Decoding Exponents: Ball-Collision Decoding
Bernstein, D. J., Lange, T., & Peters, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_42 · Cited by 191
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
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
Aoki, K., & Sasaki, Y. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_5 · Cited by 115
Simple and effective defense against evil twin access points
Roth, V., Polak, W., Rieffel, E., & Turner, T. (2008) · Proceedings of the first ACM conference on Wireless network security · doi:10.1145/1352533.1352569 · Cited by 73
Optimally Efficient Accountable Time-Stamping
Buldas, A., Lipmaa, H., & Schoenmakers, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-46588-1_20 · Cited by 53
Unrolling Cryptographic Circuits: A Simple Countermeasure Against Side-Channel Attacks
Bhasin, S., Guilley, S., Sauvage, L., & Danger, J.-L. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11925-5_14 · Cited by 30
Metadata
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2484860292
- Cited by
- 2,619
- References
- 0
- FWCI
- 83.20
- 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.