The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Worst-case to average-case reductions for module lattices
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
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. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
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
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947 · cited 2×
“To circumvent this inherent inefficiency, Micciancio [21,23] — inspired from the efficient NTRU encryption scheme [15] that can itself be interpreted in terms of lattices — initiated an approach that consists in changing the SIS and LWE problems to variants involving structured matrices.”
MethodGenerating hard instances of lattice problems (extended abstract)
Ajtai, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237838 · Cited by 1,405
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Micciancio, D., & Peikert, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_41 · Cited by 1,224
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214086 · Cited by 910
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
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Journal of the ACM · doi:10.1145/2535925 · Cited by 836
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
Classical hardness of learning with errors
Brakerski, Z., Langlois, A., Peikert, C., Regev, O., & Stehlé, D. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488680 · Cited by 627
Self-citationMicciancio, D., & Regev, O. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_5 · Cited by 615
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
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
Complexity of Lattice Problems
Micciancio, D., & Goldwasser, S. (2002) · Springer eBooks · doi:10.1007/978-1-4615-0897-7 · Cited by 484
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
Self-citationComplexity of lattice problems : a cryptographic perspective
Micciancio, D., & Goldwasser, S. (2002) · Cited by 439
A Toolkit for Ring-LWE Cryptography
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_3 · Cited by 416
Fully Homomorphic Encryption without Bootstrapping.Preprint
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2011) · IACR Cryptology ePrint Archive · Cited by 380
An Efficient and Parallel Gaussian Sampler for Lattices
Peikert, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_5 · Cited by 372
Efficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract)
Stehlé, D., Steinfeld, R., Tanaka, K., & Xagawa, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_36 · Cited by 369
Self-citationComplex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection
Gan, Y. H., Ling, C., & Mow, W. H. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016267 · Cited by 328
Hardness of SIS and LWE with Small Parameters
Micciancio, D., & Peikert, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_2 · Cited by 299
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Micciancio, D. (2007) · computational complexity · doi:10.1007/s00037-007-0234-9 · Cited by 242
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
Boneh, D., & Freeman, D. M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19379-8_1 · Cited by 234
A Group Signature Scheme from Lattice Assumptions
Gordon, S. D., Katz, J., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_23 · Cited by 221
Public-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
Micciancio, D. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181960 · Cited by 136
Bi-Deniable Public-Key Encryption
O’Neill, A., Peikert, C., & Waters, B. R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_30 · Cited by 125
Efficient Authentication from Hard Learning Problems
Kiltz, E., Pietrzak, K., Cash, D., Jain, A., & Venturi, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20465-4_3 · Cited by 97
Lattices that admit logarithmic worst-case to average-case connection factors
Peikert, C., & Rosen, A. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250860 · Cited by 90
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
Micciancio, D. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539703433511 · Cited by 90
Circular and KDM Security for Identity-Based Encryption
Alperin-Sheriff, J., & Peikert, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30057-8_20 · Cited by 89
Limits on the Hardness of Lattice Problems in ℓ p Norms
Peikert, C. (2008) · Computational Complexity · doi:10.1007/s00037-008-0251-3 · Cited by 86
On the complexity of computing short linearly independent vectors and short bases in a lattice
Blömer, J., & Seifert, J. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301441 · Cited by 70
Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices.Preprint
Stehlé, D., & Steinfeld, R. (2013) · IACR Cryptology ePrint Archive · Cited by 45
Self-citationPietrzak, K. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-28914-9_31 · Cited by 36
Cited by
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehle, D. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00032 · Cited by 1,192
“2 If one sets the ring Rq to some polynomial ring of dimension greater than 1 and sets k > 1, then the scheme is based on the hardness of the Module-LWE problem [22, 51].”
MethodTFHE: Fast Fully Homomorphic Encryption Over the Torus
Chillotti, I., Gama, N., Georgieva, M., & Izabachène, M. (2020) · Journal of Cryptology · doi:10.1007/s00145-019-09319-x · Cited by 990
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Journal of the ACM · doi:10.1145/2535925 · Cited by 836
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
A Decade of Lattice Cryptography
Peikert, C. (2016) · Foundations and TrendsŴ in Theoretical Computer Science · doi:10.1561/0400000074 · Cited by 504
Metadata
- Authors
- Langlois, A., & Stehlé, D.
- Venue
- Designs, Codes and Cryptography
- Published
- 2014-02-26
- Volume
- 75
- Issue
- 3
- Pages
- 565-599
- ISSN
- 0925-1022 (ISSN-L)
- 1573-7586
- OpenAlex
- W1985439922
- Cited by
- 643
- References
- 37
- FWCI
- 7.26
- Type
- journal article
- 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.