The DOI matches its Crossref record; 150 of the 150 references it cites were found in a registry or an index.
A Decade of Lattice Cryptography
Abstract
Numerous voice, still image, audio, and video compression standards have been developed over the last 25 years, and significant advances in the state of the art have been achieved. However, in the more than 50 years since Shannon’s seminal 1959 paper, no rate distortion bounds for voice and video have been forthcoming. In this volume, we present the first rate distortion bounds for voice and video that actually lower bound the operational rate distortion performance of the best-performing voice and video codecs. The bounds indicate that improvements in rate distortion performance of approximately 50% over the best-performing voice and video codecs are possible. Research directions to improve the new bounds are discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
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
Attribute-based encryption for fine-grained access control of encrypted data
Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180418 · Cited by 5,009
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Fuzzy Identity-Based Encryption
Sahai, A., & Waters, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_27 · Cited by 4,440
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
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
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-citationA 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
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
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
Introduction to Modern Cryptography
Katz, J., & Lindell, Y. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b17668 · Cited by 1,880
(1978) · Cited by 1,875
Fully Homomorphic Encryption over the Integers
van Dijk, M., Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_2 · Cited by 1,858
A Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
Gentry, C., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,492
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
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
Brakerski, Z. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_50 · Cited by 1,252
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-citationSecure Integration of Asymmetric and Symmetric Encryption Schemes
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_34 · Cited by 1,132
An Identity Based Encryption Scheme Based on Quadratic Residues
Cocks, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45325-3_32 · Cited by 1,102
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Rabin, M. O. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,020
The random oracle methodology, revisited
Canetti, R., Goldreich, O., & Halevi, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008734 · Cited by 978
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
On Lovász’ lattice reduction and the nearest lattice point problem
Babai, L. (1986) · Combinatorica · doi:10.1007/bf02579403 · Cited by 938
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
Waters, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_36 · Cited by 919
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
Implementing Gentry’s Fully-Homomorphic Encryption Scheme
Gentry, C., & Halevi, S. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_9 · Cited by 889
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
Self-citationLattice Signatures without Trapdoors
Lyubashevsky, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_43 · Cited by 827
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
Ducas, L., & Micciancio, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_24 · Cited by 745
Candidate Multilinear Maps from Ideal Lattices
Garg, S., Gentry, C., & Halevi, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38348-9_1 · Cited by 744
Better 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-citationA 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-citationBounded-width polynomial-size branching programs recognize exactly those languages in NC1
Barrington, D. A. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12131 · Cited by 669
Fully homomorphic SIMD operations
Smart, N. P., & Vercauteren, F. (2014) · Designs, Codes and Cryptography · doi:10.1007/s10623-012-9720-4 · Cited by 656
Computing arbitrary functions of encrypted data
Gentry, C. (2010) · Communications of the ACM · doi:10.1145/1666420.1666444 · Cited by 650
Lossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. (2011) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 649
Self-citationA 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
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 public-key cryptosystem with worst-case/average-case equivalence
Ajtai, M., & Dwork, C. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258604 · Cited by 642
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-citationHow to use indistinguishability obfuscation: deniable encryption, and more
Sahai, A., & Waters, B. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591825 · Cited by 624
Generating Hard Instances of Lattice ProblemsPreprint
Ajtai, M. (1996) · Electronic colloquium on computational complexity · Cited by 606
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
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
A sieve algorithm for the shortest lattice vector problem
Ajtai, M., Kumar, R., & Sivakumar, D. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380857 · Cited by 558
Lattice Signatures and Bimodal Gaussians
Ducas, L., Durmus, A., Lepoint, T., & Lyubashevsky, V. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_3 · Cited by 557
Fully Homomorphic Encryption with Polylog Overhead
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_28 · Cited by 497
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
Boneh, D., Gentry, C., Gorbunov, S., Halevi, S., Nikolaenko, V., Segev, G., Vaikuntanathan, V., & Vinayagamurthy, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-642-55220-5_30 · Cited by 492
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
Coron, J.-S., Mandal, A., Naccache, D., & Tibouchi, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_28 · Cited by 466
New bounds in some transference theorems in the geometry of numbers
Banaszczyk, W. (1993) · Mathematische Annalen · doi:10.1007/bf01445125 · Cited by 461
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-citationMaking 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
Improved algorithms for integer programming and related lattice problems
Kannan, R. (1983) · Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 · doi:10.1145/800061.808749 · Cited by 441
Generating Shorter Bases for Hard Random Lattices
Alwen, J., & Peikert, C. (2011) · Theory of Computing Systems · doi:10.1007/s00224-010-9278-3 · Cited by 427
Self-citationA 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
Self-citationGama, N., & Nguyen, P. Q. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_3 · Cited by 413
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
Ajtai, M. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276705 · Cited by 409
Attribute-based encryption for circuits
Gorbunov, S., Vaikuntanathan, V., & Wee, H. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488677 · Cited by 406
Generating Hard Instances of the Short Basis Problem
Ajtai, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48523-6_1 · Cited by 396
Functional Signatures and Pseudorandom Functions
Boyle, E., Goldwasser, S., & Ivan, I. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-54631-0_29 · Cited by 384
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-citationEfficient 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
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
Lattice 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-citationBatch Fully Homomorphic Encryption over the Integers
Cheon, J. H., Coron, J.-S., Kim, J., Lee, M. S., Lepoint, T., Tibouchi, M., & Yun, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_20 · Cited by 352
How to Enhance the Security of Public-Key Encryption at Minimum Cost
Fujisaki, E., & Okamoto, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49162-7_5 · Cited by 342
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
Key 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
NTRUSign: 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
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Güneysu, T., Lyubashevsky, V., & Pöppelmann, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_31 · Cited by 301
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
Self-citationBonsai 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
Self-citationNew lattice-based cryptographic constructions
Regev, O. (2004) · Journal of the ACM · doi:10.1145/1039488.1039490 · Cited by 292
Faster Bootstrapping with Polynomial Error
Alperin-Sheriff, J., & Peikert, C. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44371-2_17 · Cited by 290
Self-citationLattice 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
Lattice-based FHE as secure as PKE
Brakerski, Z., & Vaikuntanathan, V. (2014) · Proceedings of the 5th conference on Innovations in theoretical computer science · doi:10.1145/2554797.2554799 · Cited by 266
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
Self-citationThe 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
Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_29 · Cited by 254
The Two Faces of Lattices in Cryptology
Nguyen, P. Q., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44670-2_12 · Cited by 252
Leveled Fully Homomorphic Signatures from Standard Lattices
Gorbunov, S., Vaikuntanathan, V., & Wichs, D. (2015) · Proceedings of the forty-seventh annual ACM symposium on Theory of Computing · doi:10.1145/2746539.2746576 · Cited by 248
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
New 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
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
Functional Encryption for Inner Product Predicates from Learning with Errors
Agrawal, S., Freeman, D. M., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_2 · Cited by 239
Graph-Induced Multilinear Maps from Lattices
Gentry, C., Gorbunov, S., & Halevi, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46497-7_20 · Cited by 237
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
On the Limits of Nonapproximability of Lattice Problems
Goldreich, O., & Goldwasser, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1686 · Cited by 231
Better Bootstrapping in Fully Homomorphic Encryption
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-30057-8_1 · 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
Predicate Encryption for Circuits from LWE
Gorbunov, S., Vaikuntanathan, V., & Wee, H. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-48000-7_25 · Cited by 217
Coppersmith, D., & Shamir, A. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_5 · Cited by 216
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
Gentry, C., & Halevi, S. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.94 · Cited by 214
Hardness of approximating the shortest vector problem in lattices
Khot, S. (2005) · Journal of the ACM · doi:10.1145/1089023.1089027 · Cited by 212
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
Micciancio, D. (2001) · SIAM Journal on Computing · doi:10.1137/s0097539700373039 · Cited by 212
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
Kawachi, A., Tanaka, K., & Xagawa, K. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_23 · Cited by 211
Distributed Pseudo-random Functions and KDCs
Naor, M., Pinkas, B., & Reingold, O. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_23 · Cited by 209
Public-Key Encryption Schemes with Auxiliary Inputs
Dodis, Y., Goldwasser, S., Tauman Kalai, Y., Peikert, C., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11799-2_22 · Cited by 198
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-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
Aharonov, D., & Regev, O. (2005) · Journal of the ACM · doi:10.1145/1089023.1089025 · Cited by 179
Lattice-Based Identification Schemes Secure Under Active Attacks
Lyubashevsky, V. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78440-1_10 · Cited by 179
Asymptotically Efficient Lattice-Based Digital Signatures
Lyubashevsky, V., & Micciancio, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_3 · Cited by 178
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
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
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
Naor, M., & Reingold, O. (1999) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1618 · Cited by 168
Solving BDD by Enumeration: An Update
Liu, M., & Nguyễn, P. Q. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36095-4_19 · Cited by 160
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
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
Lyubashevsky, V., & Micciancio, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_34 · Cited by 147
Computing Blindfolded: New Developments in Fully Homomorphic Encryption
Vaikuntanathan, V. (2011) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.98 · Cited by 147
Improved Short Lattice Signatures in the Standard Model
Ducas, L., & Micciancio, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44371-2_19 · Cited by 128
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
Self-citationNew and Improved Key-Homomorphic Pseudorandom Functions
Banerjee, A., & Peikert, C. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44371-2_20 · Cited by 121
Self-citationLearning 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
On the Hardness of Learning with Rounding over Small Modulus
Bogdanov, A., Guo, S., Masny, D., Richelson, S., & Rosen, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-49096-9_9 · Cited by 114
Practical Bootstrapping in Quasilinear Time
Alperin-Sheriff, J., & Peikert, C. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40041-4_1 · Cited by 113
Self-citationLearning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
Ducas, L., & Nguyễn, P. Q. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_27 · Cited by 109
Inequalities for convex bodies and polar reciprocal lattices inR n
Banaszczyk, W. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02574039 · Cited by 109
Finding shortest lattice vectors faster using quantum search
Laarhoven, T., Mosca, M., & van de Pol, J. (2015) · Designs Codes and Cryptography · doi:10.1007/s10623-015-0067-5 · Cited by 97
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Lyubashevsky, V., Palacio, A., & Segev, G. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11799-2_23 · Cited by 93
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Haviv, I., & Regev, O. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250859 · Cited by 88
Ducas, L., & Durmus, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30057-8_3 · Cited by 87
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
Self-citationCircular 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 81
Self-citationFaster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
Ducas, L., & Nguyễn, P. Q. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34961-4_26 · Cited by 78
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
Self-citationHardness of k-LWE and Applications in Traitor Tracing
Ling, S., Phan, D. H., Stehlé, D., & Steinfeld, R. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-44371-2_18 · Cited by 66
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-citationLearning with Rounding, Revisited - New Reduction, Properties and Applications.
Alwen, J., Krenn, S., Pietrzak, K., & Wichs, D. (2013) · Cited by 58
Key-Homomorphic Constrained Pseudorandom Functions
Banerjee, A., Fuchsbauer, G., Peikert, C., Pietrzak, K., & Stevens, S. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46497-7_2 · Cited by 51
Self-citationField switching in BGV-style homomorphic encryption
Gentry, C., Halevi, S., Peikert, C., & Smart, N. P. (2013) · Journal of Computer Security · doi:10.3233/jcs-130480 · Cited by 39
Self-citationRepresenting hard lattices with O(n log n) bits
Ajtai, M. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060604 · Cited by 39
Improved (Hierarchical) Inner-Product Encryption from Lattices
Xagawa, K. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36362-7_15 · Cited by 35
The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case EquivalencePreprint
Ajtai, M., & Dwork, C. (2007) · Electronic colloquium on computational complexity · Cited by 25
Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions
Alperin-Sheriff, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46447-2_11 · Cited by 24
SPRING: Fast Pseudorandom Functions from Rounded Ring Products
Banerjee, A., Brenner, H., Leurent, G., Peikert, C., & Rosen, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46706-0_3 · Cited by 19
Self-citationLearning, cryptography, and the average case
Servedio, R. A., Malkin, T., & Wan, A. (2010) · Cited by 5
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
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 395
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
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
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413-upd1 · Cited by 301
Metadata
- Authors
- Peikert, C.
- Venue
- Foundations and TrendsŴ in Theoretical Computer Science
- Publisher
- Emerald
- Published
- 2016-03-24
- Volume
- 10
- Issue
- 4
- Pages
- 283-424
- ISSN
- 1551-305X (ISSN-L)
- 1551-3068
- OpenAlex
- W2951286680
- Cited by
- 504
- References
- 150
- FWCI
- 29.05
- 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.