| 2026 | CRYPTO | High-Precision Exact FHE Made Simple, General, and Fast. | Chris Peikert, Doron Zarchy, Guy Zyskind |
| 2025 | CCS | High-Throughput Universally Composable Threshold FHE Decryption. | Guy Zyskind, Doron Zarchy, Max Leibovich, Chris Peikert |
| 2025 | TCC | Vive Galois! Part 1: Optimal SIMD Packing and Packed Bootstrapping for FHE. | Chris Peikert, Zachary Pepin |
| 2024 | CRYPTO | Cryptanalysis of Lattice-Based Sequentiality Assumptions and Proofs of Sequential Work. | Chris Peikert, Yi Tang |
| 2023 | EuroCrypt | Functional Commitments for All Functions, with Transparent Setup and from SIS. | Leo de Castro, Chris Peikert |
| 2022 | ISCA | CraterLake: a hardware accelerator for efficient unbounded computation on encrypted data. | Nikola Samardzic, Axel Feldmann, Aleksandar Krastev, Nathan Manohar, Nicholas Genise, Srinivas Devadas, Karim Eldefrawy, Chris Peikert, Daniel Snchez |
| 2021 | TCC | Vector and Functional Commitments from Lattices. | Chris Peikert, Zachary Pepin, Chad Sharp |
| 2020 | EuroCrypt | He Gives C-Sieves on the CSIDH. | Chris Peikert |
| 2020 | PKC | Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. | Nicholas Genise, Daniele Micciancio, Chris Peikert, Michael Walter |
| 2020 | PKC | Constraining and Watermarking PRFs from Milder Assumptions. | Chris Peikert, Sina Shiehian |
| 2019 | CRYPTO | Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors. | Chris Peikert, Sina Shiehian |
| 2019 | TCC | Algebraically Structured LWE, Revisited. | Chris Peikert, Zachary Pepin |
| 2018 | CCS | ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY. | Eric Crockett, Chris Peikert, Chad Sharp |
| 2018 | PKC | New (and Old) Proof Systems for Lattice Problems. | Navid Alamati, Chris Peikert, Noah Stephens-Davidowitz |
| 2018 | PKC | Privately Constraining and Programming PRFs, the LWE Way. | Chris Peikert, Sina Shiehian |
| 2018 | SCN | More Efficient Commitments from Structured Lattice Assumptions. | Carsten Baum, Ivan Damgrd, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert |
| 2017 | STOC | Pseudorandomness of ring-LWE for any ring and modulus. | Chris Peikert, Oded Regev, Noah Stephens-Davidowitz |
| 2016 | CCS | Λολ: Functional Lattice Cryptography. | Eric Crockett, Chris Peikert |
| 2016 | CRYPTO | Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE. | Navid Alamati, Chris Peikert |
| 2016 | EuroCrypt | Recovering Short Generators of Principal Ideals in Cyclotomic Rings. | Ronald Cramer, Lo Ducas, Chris Peikert, Oded Regev |
| 2016 | SCN | On Adaptively Secure Multiparty Computation with a Short CRS. | Ran Cohen, Chris Peikert |
| 2016 | SCN | How (Not) to Instantiate Ring-LWE. | Chris Peikert |
| 2016 | TCC | Multi-key FHE from LWE, Revisited. | Chris Peikert, Sina Shiehian |
| 2015 | TCC | Key-Homomorphic Constrained Pseudorandom Functions. | Abhishek Banerjee, Georg Fuchsbauer, Chris Peikert, Krzysztof Pietrzak, Sophie Stevens |
| 2014 | CRYPTO | New and Improved Key-Homomorphic Pseudorandom Functions. | Abhishek Banerjee, Chris Peikert |
| 2014 | CRYPTO | Faster Bootstrapping with Polynomial Error. | Jacob Alperin-Sheriff, Chris Peikert |
| 2014 | FSE | SPRING: Fast Pseudorandom Functions from Rounded Ring Products. | Abhishek Banerjee, Hai Brenner, Gatan Leurent, Chris Peikert, Alon Rosen |
| 2014 | PQCrypto | Lattice Cryptography for the Internet. | Chris Peikert |
| 2013 | ACNS | How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE. | Rikke Bendlin, Sara Krehbiel, Chris Peikert |
| 2013 | CRYPTO | Practical Bootstrapping in Quasilinear Time. | Jacob Alperin-Sheriff, Chris Peikert |
| 2013 | CRYPTO | Hardness of SIS and LWE with Small Parameters. | Daniele Micciancio, Chris Peikert |
| 2013 | EuroCrypt | A Toolkit for Ring-LWE Cryptography. | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
| 2013 | STOC | Classical hardness of learning with errors. | Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehl |
| 2012 | EuroCrypt | Pseudorandom Functions and Lattices. | Abhishek Banerjee, Chris Peikert, Alon Rosen |
| 2012 | EuroCrypt | Identity-Based (Lossy) Trapdoor Functions and Applications. | Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters |
| 2012 | EuroCrypt | Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. | Daniele Micciancio, Chris Peikert |
| 2012 | PKC | Circular and KDM Security for Identity-Based Encryption. | Jacob Alperin-Sheriff, Chris Peikert |
| 2012 | SCN | Ring Switching in BGV-Style Homomorphic Encryption. | Craig Gentry, Shai Halevi, Chris Peikert, Nigel P. Smart |
| 2011 | CRYPTO | Bi-Deniable Public-Key Encryption. | Adam O'Neill, Chris Peikert, Brent Waters |
| 2011 | FOCS | Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings. | Daniel Dadush, Chris Peikert, Santosh S. Vempala |
| 2010 | CRYPTO | An Efficient and Parallel Gaussian Sampler for Lattices. | Chris Peikert |
| 2010 | EuroCrypt | Bonsai Trees, or How to Delegate a Lattice Basis. | David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert |
| 2010 | EuroCrypt | On Ideal Lattices and Learning with Errors over Rings. | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
| 2010 | SCN | Heuristics and Rigor in Lattice-Based Cryptography - (Invited Talk). | Chris Peikert |
| 2010 | TCC | Public-Key Encryption Schemes with Auxiliary Inputs. | Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan |
| 2009 | CRYPTO | Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. | Benny Applebaum, David Cash, Chris Peikert, Amit Sahai |
| 2009 | STOC | Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. | Chris Peikert |
| 2009 | STACS | Generating Shorter Bases for Hard Random Lattices. | Jol Alwen, Chris Peikert |
| 2009 | TCC | Some Recent Progress in Lattice-Based Cryptography. | Chris Peikert |
| 2008 | CRYPTO | Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems. | Chris Peikert, Vinod Vaikuntanathan |
| 2008 | CRYPTO | A Framework for Efficient and Composable Oblivious Transfer. | Chris Peikert, Vinod Vaikuntanathan, Brent Waters |
| 2008 | FSE | SWIFFT: A Modest Proposal for FFT Hashing. | Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen |
| 2008 | STOC | Trapdoors for hard lattices and new cryptographic constructions. | Craig Gentry, Chris Peikert, Vinod Vaikuntanathan |
| 2008 | STOC | Lossy trapdoor functions and their applications. | Chris Peikert, Brent Waters |
| 2007 | STOC | Lattices that admit logarithmic worst-case to average-case connection factors. | Chris Peikert, Alon Rosen |
| 2006 | TCC | On Error Correction in the Exponent. | Chris Peikert |
| 2006 | TCC | Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. | Chris Peikert, Alon Rosen |
| 2005 | TCC | Optimal Error Correction Against Computationally Bounded Noise. | Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson |
| 2004 | PODC | Completely fair SFE and coalition-safe cheap talk. | Matt Lepinski, Silvio Micali, Chris Peikert, Abhi Shelat |
| 2003 | SODA | Lower bounds for collusion-secure fingerprinting. | Chris Peikert, Abhi Shelat, Adam D. Smith |
| 2001 | ASIACRYPT | Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes. | Anna Lysyanskaya, Chris Peikert |