Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes. - Anna Lysyanskaya; Chris Peikert (ASIACRYPT, 2001)

Lower bounds for collusion-secure fingerprinting. - Chris Peikert; Abhi Shelat; Adam D. Smith 001 (SODA, 2003)

Completely fair SFE and coalition-safe cheap talk. - Matt Lepinski; Silvio Micali; Chris Peikert; Abhi Shelat (PODC, 2004)

Optimal Error Correction Against Computationally Bounded Noise. - Silvio Micali; Chris Peikert; Madhu Sudan 001; David A. Wilson (TCC, 2005)

Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices - Chris Peikert; Alon Rosen (Electron. Colloquium Comput. Complex., 2005)

On Error Correction in the Exponent. - Chris Peikert (IACR Cryptol. ePrint Arch., 2005)

Limits on the Hardness of Lattice Problems in ℓp Norms. - Chris Peikert (Electron. Colloquium Comput. Complex., 2006)

Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. - Chris Peikert; Alon Rosen (Electron. Colloquium Comput. Complex., 2006)

Cryptographic error correction. - Christopher Jason Peikert (2006)

Limits on the Hardness of Lattice Problems in ell _p Norms. - Chris Peikert (CCC, 2007)

Trapdoors for Hard Lattices and New Cryptographic Constructions. - Craig Gentry; Chris Peikert; Vinod Vaikuntanathan (Electron. Colloquium Comput. Complex., 2007)

A Framework for Efficient and Composable Oblivious Transfer. - Chris Peikert; Vinod Vaikuntanathan; Brent Waters (IACR Cryptol. ePrint Arch., 2007)

Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems. - Chris Peikert; Vinod Vaikuntanathan (CRYPTO, 2008)

SWIFFT: A Modest Proposal for FFT Hashing. - Vadim Lyubashevsky; Daniele Micciancio; Chris Peikert; Alon Rosen (FSE, 2008)

Limits on the Hardness of Lattice Problems in lp Norms. - Chris Peikert (Comput. Complex., 2008)

Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. - Chris Peikert (Electron. Colloquium Comput. Complex., 2008)

Generating Shorter Bases for Hard Random Lattices. - Joël Alwen; Chris Peikert (IACR Cryptol. ePrint Arch., 2008)

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. - Benny Applebaum; David Cash; Chris Peikert; Amit Sahai (CRYPTO, 2009)

Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. - Chris Peikert (STOC, 2009)

Some Recent Progress in Lattice-Based Cryptography. - Chris Peikert (TCC, 2009)

Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography). - Chris Peikert (IACR Cryptol. ePrint Arch., 2009)

Robustness of the Learning with Errors Assumption. - Shafi Goldwasser; Yael Tauman Kalai; Chris Peikert; Vinod Vaikuntanathan (ICS, 2010)

Heuristics and Rigor in Lattice-Based Cryptography - (Invited Talk). - Chris Peikert (SCN, 2010)

Public-Key Encryption Schemes with Auxiliary Inputs. - Yevgeniy Dodis; Shafi Goldwasser; Yael Tauman Kalai; Chris Peikert; Vinod Vaikuntanathan (TCC, 2010)

Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings - Daniel Dadush; Chris Peikert; Santosh S. Vempala (CoRR, 2010)

Better Key Sizes (and Attacks) for LWE-Based Encryption. - Richard Lindner; Chris Peikert (IACR Cryptol. ePrint Arch., 2010)

An Efficient and Parallel Gaussian Sampler for Lattices. - Chris Peikert (IACR Cryptol. ePrint Arch., 2010)

Optimal Error Correction for Computationally Bounded Noise. - Silvio Micali; Chris Peikert; Madhu Sudan 001; David A. Wilson (IEEE Trans. Inf. Theory, 2010)

Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings. - Daniel Dadush; Chris Peikert; Santosh S. Vempala (FOCS, 2011)

Pseudorandom Functions and Lattices. - Abhishek Banerjee 001; Chris Peikert; Alon Rosen (IACR Cryptol. ePrint Arch., 2011)

Identity-Based (Lossy) Trapdoor Functions and Applications. - Mihir Bellare; Eike Kiltz; Chris Peikert; Brent Waters (IACR Cryptol. ePrint Arch., 2011)

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. - Daniele Micciancio; Chris Peikert (IACR Cryptol. ePrint Arch., 2011)

Bi-Deniable Public-Key Encryption. - Adam O'Neill; Chris Peikert; Brent Waters (IACR Cryptol. ePrint Arch., 2011)

Lossy Trapdoor Functions and Their Applications. - Chris Peikert; Brent Waters (SIAM J. Comput., 2011)

An update on SIPHER (Scalable Implementation of Primitives for Homomorphic EncRyption) - FPGA implementation using Simulink. - David Cousins; Kurt Rohloff; Chris Peikert; Richard E. Schantz (HPEC, 2012)

Circular and KDM Security for Identity-Based Encryption. - Jacob Alperin-Sheriff; Chris Peikert (Public Key Cryptography, 2012)

Ring Switching in BGV-Style Homomorphic Encryption. - Craig Gentry; Shai Halevi; Chris Peikert; Nigel P. Smart (SCN, 2012)

Bonsai Trees, or How to Delegate a Lattice Basis. - David Cash; Dennis Hofheinz; Eike Kiltz; Chris Peikert (J. Cryptol., 2012)

On the Lattice Smoothing Parameter Problem. - Kai-Min Chung; Daniel Dadush; Feng-Hao Liu; Chris Peikert (CCC, 2013)

Classical hardness of learning with errors. - Zvika Brakerski; Adeline Langlois; Chris Peikert; Oded Regev 001; Damien Stehlé (STOC, 2013)

Practical Bootstrapping in Quasilinear Time. - Jacob Alperin-Sheriff; Chris Peikert (IACR Cryptol. ePrint Arch., 2013)

How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE. - Rikke Bendlin; Sara Krehbiel; Chris Peikert (IACR Cryptol. ePrint Arch., 2013)

A Toolkit for Ring-LWE Cryptography. - Vadim Lyubashevsky; Chris Peikert; Oded Regev 001 (IACR Cryptol. ePrint Arch., 2013)

Hardness of SIS and LWE with Small Parameters. - Daniele Micciancio; Chris Peikert (IACR Cryptol. ePrint Arch., 2013)

On Ideal Lattices and Learning with Errors over Rings. - Vadim Lyubashevsky; Chris Peikert; Oded Regev 001 (J. ACM, 2013)

Field switching in BGV-style homomorphic encryption. - Craig Gentry; Shai Halevi; Chris Peikert; Nigel P. Smart (J. Comput. Secur., 2013)

Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010). - Chris Peikert; Robert Kleinberg; Aravind Srinivasan; Alan M. Frieze; Alexander Russell; Leonard J. Schulman (SIAM J. Comput., 2013)

SPRING: Fast Pseudorandom Functions from Rounded Ring Products. - Abhishek Banerjee 001; Hai Brenner; Gaëtan Leurent; Chris Peikert; Alon Rosen (FSE, 2014)

Faster Bootstrapping with Polynomial Error. - Jacob Alperin-Sheriff; Chris Peikert (IACR Cryptol. ePrint Arch., 2014)

New and Improved Key-Homomorphic Pseudorandom Functions. - Abhishek Banerjee 001; Chris Peikert (IACR Cryptol. ePrint Arch., 2014)

Lattice Cryptography for the Internet. - Chris Peikert (IACR Cryptol. ePrint Arch., 2014)

Key-Homomorphic Constrained Pseudorandom Functions. - Abhishek Banerjee 001; Georg Fuchsbauer; Chris Peikert; Krzysztof Pietrzak; Sophie Stevens (IACR Cryptol. ePrint Arch., 2015)

Recovering Short Generators of Principal Ideals in Cyclotomic Rings. - Ronald Cramer; Léo Ducas; Chris Peikert; Oded Regev 001 (IACR Cryptol. ePrint Arch., 2015)

Λ ∘ λ: A Functional Library for Lattice Cryptography. - Eric Crockett 001; Chris Peikert (IACR Cryptol. ePrint Arch., 2015)

A Decade of Lattice Cryptography. - Chris Peikert (IACR Cryptol. ePrint Arch., 2015)

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs. - Craig Gentry; Jens Groth; Yuval Ishai; Chris Peikert; Amit Sahai; Adam D. Smith 001 (J. Cryptol., 2015)

Λολ: Functional Lattice Cryptography. - Eric Crockett 001; Chris Peikert (CCS, 2016)

Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE. - Navid Alamati; Chris Peikert (IACR Cryptol. ePrint Arch., 2016)

Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems. - Carsten Baum; Ivan Damgård; Sabine Oechsner; Chris Peikert (IACR Cryptol. ePrint Arch., 2016)

On Adaptively Secure Multiparty Computation with a Short CRS. - Ran Cohen; Chris Peikert (IACR Cryptol. ePrint Arch., 2016)

Challenges for Ring-LWE. - Eric Crockett 001; Chris Peikert (IACR Cryptol. ePrint Arch., 2016)

How (Not) to Instantiate Ring-LWE. - Chris Peikert (IACR Cryptol. ePrint Arch., 2016)

Multi-Key FHE from LWE, Revisited. - Chris Peikert; Sina Shiehian (IACR Cryptol. ePrint Arch., 2016)

List-Decoding Barnes-Wall Lattices. - Elena Grigorescu; Chris Peikert (Comput. Complex., 2017)

New (and Old) Proof Systems for Lattice Problems. - Navid Alamati; Chris Peikert; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2017)

Pseudorandomness of Ring-LWE for Any Ring and Modulus. - Chris Peikert; Oded Regev 001; Noah Stephens-Davidowitz (IACR Cryptol. ePrint Arch., 2017)

Privately Constraining and Programming PRFs, the LWE Way. - Chris Peikert; Sina Shiehian (IACR Cryptol. ePrint Arch., 2017)

ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY. - Eric Crockett 001; Chris Peikert; Chad Sharp (CCS, 2018)

More Efficient Commitments from Structured Lattice Assumptions. - Carsten Baum; Ivan Damgård; Vadim Lyubashevsky; Sabine Oechsner; Chris Peikert (SCN, 2018)

Outsourcing Computation: The Minimal Refereed Mechanism. - Yuqing Kong; Chris Peikert; Grant Schoenebeck; Biaoshuai Tao (WINE, 2019)

Identifying Research Challenges in Post Quantum Cryptography Migration and Cryptographic Agility. - David Ott; Christopher Peikert; et al. (CoRR, 2019)

He Gives C-Sieves on the CSIDH. - Chris Peikert (IACR Cryptol. ePrint Arch., 2019)

Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors. - Chris Peikert; Sina Shiehian (IACR Cryptol. ePrint Arch., 2019)

Hardness of Bounded Distance Decoding on Lattices in ℓp Norms. - Huck Bennett; Chris Peikert (CCC, 2020)

Constraining and Watermarking PRFs from Milder Assumptions. - Chris Peikert; Sina Shiehian (Public Key Cryptography (1), 2020)

Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography. - Nicholas Genise; Daniele Micciancio; Chris Peikert; Michael Walter 001 (IACR Cryptol. ePrint Arch., 2020)

F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption. - Nikola Samardzic; Axel Feldmann; Aleksandar Krastev; Srinivas Devadas; Ronald G. Dreslinski; Christopher Peikert; Daniel Sánchez 003 (MICRO, 2021)

F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (Extended Version). - Axel Feldmann; Nikola Samardzic; Aleksandar Krastev; Srini Devadas; Ronald G. Dreslinski; Karim Eldefrawy; Nicholas Genise; Chris Peikert; Daniel Sánchez 003 (CoRR, 2021)

Vector and Functional Commitments from Lattices. - Chris Peikert; Zachary Pepin; Chad Sharp (IACR Cryptol. ePrint Arch., 2021)

Improved Hardness of BDD and SVP Under Gap-(S)ETH. - Huck Bennett; Chris Peikert; Yi Tang (ITCS, 2022)

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 Sánchez 003 (ISCA, 2022)

Functional Commitments for All Functions, with Transparent Setup. - Leo de Castro; Chris Peikert (IACR Cryptol. ePrint Arch., 2022)

An Architecture to Accelerate Computation on Encrypted Data. - Axel Feldmann; Nikola Samardzic; Aleksandar Krastev; Srinivas Devadas; Ronald G. Dreslinski; Chris Peikert; Daniel Sánchez 003 (IEEE Micro, 2022)

Lattice (List) Decoding Near Minkowski's Inequality. - Ethan Mook; Chris Peikert (IEEE Trans. Inf. Theory, 2022)

Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. - Huck Bennett; Chris Peikert (APPROX/RANDOM, 2023)

Functional Commitments for All Functions, with Transparent Setup and from SIS. - Leo de Castro; Chris Peikert (EUROCRYPT (3), 2023)

Cryptanalysis of Lattice-Based Sequentiality Assumptions and Proofs of Sequential Work. - Chris Peikert; Yi Tang (IACR Cryptol. ePrint Arch., 2023)

Classical and Quantum Security of Elliptic Curve VRF, via Relative Indifferentiability. - Chris Peikert; Jiayu Xu 001 (IACR Cryptol. ePrint Arch., 2023)

Algebraically Structured LWE, Revisited. - Chris Peikert; Zachary Pepin (J. Cryptol., 2024)