The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
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
On observing nondeterminism and concurrency
Hennessy, M., & Milner, R. (1980) · Lecture Notes in Computer Science · doi:10.1007/3-540-10003-2_79 · Cited by 4,492
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
Self-citationOn 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
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
Polynomial Reconstruction Based Cryptography
Kiayias, A., & Yung, M. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45537-x_10 · Cited by 1,361
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
Camenisch, J., & Lysyanskaya, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44987-6_7 · Cited by 1,321
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Advances in Cryptology - CRYPTO 2003
(2003) · Lecture notes in computer science · doi:10.1007/b11817 · Cited by 942
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Micciancio, D., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447360 · Cited by 907
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Peikert, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536461 · Cited by 813
Self-citation(2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92062-3 · Cited by 789
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
Advances in Cryptology – CRYPTO 2005
(2005) · Lecture notes in computer science · doi:10.1007/11535218 · Cited by 725
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
A Framework for Efficient and Composable Oblivious Transfer
Peikert, C., Vaikuntanathan, V., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_31 · Cited by 678
Self-citationLossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. (2011) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 649
Self-citation(2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56880-1 · Cited by 628
Micciancio, D., & Regev, O. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_5 · Cited by 615
(2022) · Lecture notes in computer science · doi:10.1007/978-3-031-07085-3 · Cited by 613
Noise-tolerant learning, the parity problem, and the statistical query model
Blum, A., Kalai, A., & Wasserman, H. (2003) · Journal of the ACM · doi:10.1145/792538.792543 · Cited by 598
Advances in Cryptology-Eurocrypt '96
Maurer, U. M. (1996) · Cited by 582
Advances in Cryptology – EUROCRYPT 2008
Tillich, J., & Zémor, G. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78967-3 · Cited by 521
Advances in Cryptology - Eurocrypt 2006
Serge Vaudenay, B. (2008) · Cited by 514
Secure Human Identification Protocols
Hopper, N. J., & Blum, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_4 · Cited by 499
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
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
Number-theoretic constructions of efficient pseudo-random functions
Naor, M., & Reingold, O. (2004) · Journal of the ACM · doi:10.1145/972639.972643 · Cited by 368
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
(2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5 · Cited by 333
Cryptographic Primitives Based on Hard Learning Problems
Blum, A., Furst, M., Kearns, M., & Lipton, R. J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_24 · Cited by 332
Hutchison, D., Naor, M., Takeo Kanade, A., Kittler, J., Kleinberg, J. M., Mitchell, J. C., Nierstrasz, O., Pandu Rangan, C., Pieprzyk, J., Steffen, B., et al. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89255-7 · Cited by 308
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
Hazay, C., & Lindell, Y. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_10 · Cited by 267
Encryption-Scheme Security in the Presence of Key-Dependent Messages
Black, J., Rogaway, P., & Shrimpton, T. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36492-7_6 · Cited by 249
More on average case vs approximation complexity
Alekhnovich, M. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238204 · Cited by 247
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
Applebaum, B., Ishai, Y., & Kushilevitz, E. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539705446950 · Cited by 215
Self-citationPublic-Key Cryptosystems from the Worst-Case Shortest Vector Problem
Peikert, C. (2009) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/dagsemproc.08491.4 · Cited by 194
Self-citationParallel and Concurrent Security of the HB and HB + Protocols
Katz, J., & Shin, J. S. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_6 · Cited by 184
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
Micciancio, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44670-2_11 · Cited by 173
Camenisch, J., Chandran, N., & Shoup, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_20 · Cited by 173
Cryptography with constant computational overhead
Ishai, Y., Kushilevitz, E., Ostrovsky, R., & Sahai, A. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374438 · Cited by 158
Self-citationNew Results for Learning Noisy Parities and Halfspaces
Feldman, V., Gopalan, P., Khot, S., & Ponnuswami, A. K. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.51 · Cited by 155
Applebaum, B. (2013) · Information security and cryptography · doi:10.1007/978-3-642-17367-7_4 · Cited by 136
Self-citationAn Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
Fischer, J.-B., & Stern, J. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_22 · Cited by 112
On the (Im)Possibility of Key Dependent Encryption
Haitner, I., & Holenstein, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00457-5_13 · Cited by 106
How to Encrypt with the LPN Problem
Gilbert, H., Robshaw, M. J. B., & Seurin, Y. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70583-3_55 · Cited by 81
Soundness of Formal Encryption in the Presence of Key-Cycles
Adão, P., Bana, G., Herzog, J. C., & Scedrov, A. (2005) · Lecture notes in computer science · doi:10.1007/11555827_22 · Cited by 80
Cryptographic Hardness for Learning Intersections of Halfspaces
Klivans, A. R., & Sherstov, A. A. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.24 · Cited by 68
Security under key-dependent inputs
Halevi, S., & Krawczyk, H. (2007) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1315245.1315303 · Cited by 68
A Parallel Hardware Architecture for fast Gaussian Elimination over GF(2)
Rupp, A., Pelzl, J., Paar, C., Mertens, M., & Bogdanov, A. (2006) · IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM) · doi:10.1109/fccm.2006.12 · Cited by 62
On Pseudorandom Generators with Linear Stretch in NC0
Applebaum, B., Ishai, Y., & Eyal Kushilevitz, Z. (2008) · Computational Complexity · doi:10.1007/s00037-007-0237-6 · Cited by 61
Self-citationTowards Key-Dependent Message Security in the Standard Model
Hofheinz, D., & Unruh, D. (2008) · Springer eBooks · doi:10.1007/978-3-540-78967-3_7 · Cited by 61
Cryptography with Constant Input Locality
Applebaum, B., Ishai, Y., & Kushilevitz, E. (2009) · Journal of Cryptology · doi:10.1007/s00145-009-9039-0 · Cited by 47
Self-citationAlbrecht, M. R., Bard, G. V., & Hart, W. B. (2010) · ACM Transactions on Mathematical Software · doi:10.1145/1644001.1644010 · Cited by 47
OAEP Is Secure under Key-Dependent Messages
Michael Backes, A., Dürmuth, M., & Unruh, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89255-7_31 · Cited by 38
Michael Backes, A., Pfitzmann, B., & Scedrov, A. (2007) · IEEE Computer Security Foundations Workshop (CSFW) · doi:10.1109/csf.2007.23 · Cited by 37
An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem
Gennaro, R. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0215-y · Cited by 33
Cryptography with Constant Input Locality
Applebaum, B., Ishai, Y., & Eyal Kushilevitz, Z. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-74143-5_6 · Cited by 27
Self-citationOn Pseudorandom Generators with Linear Stretch in NC0
Applebaum, B., Ishai, Y., & Eyal Kushilevitz, Z. (2006) · Lecture notes in computer science · doi:10.1007/11830924_25 · Cited by 26
Self-citation
Cited by
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
Self-citation(Leveled) fully homomorphic encryption without bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090262 · Cited by 1,782
Efficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449
(Leveled) Fully Homomorphic Encryption without Bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014) · ACM Transactions on Computation Theory · doi:10.1145/2633600 · Cited by 1,430
Metadata
- Authors
- Applebaum, B., Cash, D., Peikert, C., & Sahai, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 595-618
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2113333997
- Cited by
- 562
- References
- 61
- FWCI
- 23.97
- Type
- conference paper
- 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.