The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Hardness of SIS and LWE with Small Parameters
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
Factoring polynomials with rational coefficients
Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,018
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. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
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
Self-citationWorst‐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
Self-citationPublic-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-citationBetter Key Sizes (and Attacks) for LWE-Based Encryption
Lindner, R., & Peikert, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_21 · Cited by 688
Self-citationLossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. (2011) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 649
Self-citationClassical 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
Self-citationGenerating Hard Instances of Lattice ProblemsPreprint
Ajtai, M. (1996) · Electronic colloquium on computational complexity · Cited by 606
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
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
A Generalized Birthday Problem
Wagner, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_19 · Cited by 539
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Etessami, K., & Yannakakis, M. (2009) · Journal of the ACM · doi:10.1145/1462153.1462154 · Cited by 512
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
Pseudorandom Functions and Lattices
Banerjee, A., Peikert, C., & Rosen, A. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_42 · Cited by 459
Self-citationGama, N., & Nguyen, P. Q. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_3 · Cited by 413
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
Self-citationNew Algorithms for Learning in Presence of Errors
Arora, S., & Ge, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22006-7_34 · Cited by 243
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
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
Self-citationPseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
Micciancio, D., & Mol, P. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_26 · Cited by 186
Self-citationGiorgi, E. D., Barone, L., & Chu, W. (2010) · Cited by 129
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
Self-citationAn improved worst-case to average-case connection for lattice problems
Cai, J., & Nerurkar, A. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646135 · Cited by 85
Identity-Based (Lossy) Trapdoor Functions and Applications
Bellare, M., Kiltz, E., Peikert, C., & Waters, B. R. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29011-4_15 · Cited by 60
Self-citation
Cited by
Worst-case to average-case reductions for module lattices
Langlois, A., & Stehlé, D. (2015) · Designs, Codes and Cryptography · doi:10.1007/s10623-014-9938-4 · Cited by 643
A Decade of Lattice Cryptography
Peikert, C. (2016) · Foundations and TrendsŴ in Theoretical Computer Science · doi:10.1561/0400000074 · Cited by 504
Self-citationLattice Cryptography for the Internet
Peikert, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11659-4_12 · Cited by 356
Self-citationKey Homomorphic PRFs and Their Applications
Boneh, D., Lewi, K., Montgomery, H., & Raghunathan, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_23 · Cited by 321
Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE
Bos, J., Costello, C., Ducas, L., Mironov, I., Naehrig, M., Nikolaenko, V., Raghunathan, A., & Stebila, D. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978425 · Cited by 320
Metadata
- Authors
- Micciancio, D., & Peikert, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 21-39
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W39036742
- Cited by
- 299
- References
- 27
- FWCI
- 17.13
- 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.