The DOI matches its Crossref record; 59 of the 59 references it cites were found in a registry or an index.
Making NTRU as Secure as Worst-Case Problems over Ideal 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
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
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
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
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
A fully homomorphic encryption scheme
Boneh, D., & Gentry, C. (2009) · Cited by 2,341
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
Accuracy and stability of numerical algorithms
(1996) · Choice Reviews Online · doi:10.5860/choice.34-0981 · Cited by 2,072
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
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
(2000) · Choice Reviews Online · doi:10.5860/choice.37-5723 · Cited by 1,617
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
Generating 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
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
(2000) · Lecture Notes in Computer Science · doi:10.1007/10722028 · Cited by 1,001
Efficient Lattice (H)IBE in the Standard Model
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_28 · Cited by 976
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
Bonsai Trees, or How to Delegate a Lattice Basis
Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_27 · Cited by 711
Secure Two-Party Computation Is Practical
Pinkas, B., Schneider, T., Smart, N. P., & Williams, S. C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_15 · Cited by 711
A hierarchy of polynomial time lattice basis reduction algorithms
Schnorr, C. P. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90064-8 · Cited by 648
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
Advances in Cryptology — EUROCRYPT ’97
Fumy, W. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0 · Cited by 599
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
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
(2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5 · Cited by 500
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
Complexity of lattice problems : a cryptographic perspective
Micciancio, D., & Goldwasser, S. (2002) · Cited by 439
(2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8 · Cited by 421
Advances in Cryptology – CRYPTO 2010
(2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7 · Cited by 370
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-citationNTRUSign: Digital Signatures Using the NTRU Lattice
Hoffstein, J., Howgrave-Graham, N., Pipher, J., Silverman, J. H., & Whyte, W. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36563-x_9 · Cited by 302
Bonsai Trees, or How to Delegate a Lattice Basis
Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2012) · Journal of Cryptology · doi:10.1007/s00145-011-9105-2 · Cited by 297
Generalized Compact Knapsacks Are Collision Resistant
Lyubashevsky, V., & Micciancio, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_13 · 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 Learning with Errors Problem (Invited Survey)
Regev, O. (2010) · 2010 IEEE 25th Annual Conference on Computational Complexity · doi:10.1109/ccc.2010.26 · Cited by 255
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
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
Peikert, C., & Rosen, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_8 · Cited by 229
Micciancio, D., & Voulgaris, P. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806739 · Cited by 226
Coppersmith, D., & Shamir, A. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_5 · Cited by 216
Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
Gentry, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_7 · Cited by 175
NSS: An NTRU Lattice-Based Signature Scheme
Hoffstein, J., Pipher, J. C., & Silverman, J. H. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_14 · Cited by 147
Quantum resistant public key cryptography: a survey
Perlner, R. A., & Cooper, D. A. (2009) · Proceedings of the 8th Symposium on Identity and Trust on the Internet · doi:10.1145/1527017.1527028 · Cited by 137 · cited 1×
“, [44]).”
The Impact of Decryption Failures on the Security of NTRU Encryption
Howgrave-Graham, N., Nguyễn, P. Q., Pointcheval, D., Proos, J., Silverman, J. H., Singer, A., & Whyte, W. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_14 · Cited by 127
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
Nguyễn, P. Q., & Regev, O. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9031-0 · Cited by 115
Choosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3
Howgrave-Graham, N., Silverman, J. H., & Whyte, W. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30574-3_10 · Cited by 90
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
Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
Hoffstein, J., Howgrave-Graham, N., Pipher, J. C., & Whyte, W. (2009) · Information security and cryptography · doi:10.1007/978-3-642-02295-1_11 · Cited by 72
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 69
NTRU : A new high speed public key cryptosystem
Hoffstein, J. (1996) · International Cryptology Conference · Cited by 66
NAEP: Provable Security in the Presence of Decryption Failures.
Howgrave-Graham, N., Silverman, J. H., Singer, A., & Whyte, W. (2003) · Cited by 58
Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures
Szydlo, M. (2003) · Lecture notes in computer science · doi:10.1007/3-540-39200-9_27 · Cited by 55
Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt 2001
Gentry, C., Jönsson, J., Stern, J., & Szydlo, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45682-1_1 · Cited by 48
The probability that random algebraic integers are relatively r-prime
Sittinger, B. D. (2009) · Journal of Number Theory · doi:10.1016/j.jnt.2009.06.008 · Cited by 33
Weak Property of Malleability in NTRUSign
Min, S., Yamamoto, G., & Kim, K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27800-9_33 · Cited by 13
Distribution of inverses in polynomial rings
Banks, W. D., & Shparlinski, I. E. (2001) · Indagationes Mathematicae · doi:10.1016/s0019-3577(01)80012-4 · Cited by 5
Chapter 11 Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
Hoffstein, J., Howgrave-Graham, N., Pipher, J. C., et al. (2010) · Cited by 3
Random Oracles in a Quantum WorldPreprint
Boneh, D., Dagdelen, Ö., Fischlin, M., et al. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1008.0931 · Cited by 2
Cited by
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
Acar, A., Aksu, H., Uluagac, A. S., & Conti, M. (2019) · ACM Computing Surveys · doi:10.1145/3214303 · Cited by 1,397
(2016) · International Conference on Machine Learning · Cited by 1,270
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
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
Lattice Signatures without Trapdoors
Lyubashevsky, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_43 · Cited by 827
Metadata
- Authors
- Stehlé, D., & Steinfeld, R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 27-47
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1936753088
- Cited by
- 444
- References
- 59
- FWCI
- 17.08
- 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.