Chris Peikert

Zachary Pepin

J. Cryptol., September, 2024

2023

Classical and Quantum Security of Elliptic Curve VRF, via Relative Indifferentiability.

[BibT_eX]

[DOI]

Jiayu Xu

IACR Cryptol. ePrint Arch., 2023

Cryptanalysis of Lattice-Based Sequentiality Assumptions and Proofs of Sequential Work.

[BibT_eX]

[DOI]

Yi Tang

IACR Cryptol. ePrint Arch., 2023

Functional Commitments for All Functions, with Transparent Setup and from SIS.

[BibT_eX]

[DOI]

Leo de Castro

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes.

[BibT_eX]

[DOI]

Huck Bennett

Proceedings of the Approximation, 2023

2022

Lattice (List) Decoding Near Minkowski's Inequality.

[BibT_eX]

[DOI]

Ethan Mook

IEEE Trans. Inf. Theory, 2022

An Architecture to Accelerate Computation on Encrypted Data.

[BibT_eX]

[DOI]

IEEE Micro, 2022

Functional Commitments for All Functions, with Transparent Setup.

[BibT_eX]

[DOI]

Leo de Castro

IACR Cryptol. ePrint Arch., 2022

CraterLake: a hardware accelerator for efficient unbounded computation on encrypted data.

[BibT_eX]

[DOI]

Proceedings of the ISCA '22: The 49th Annual International Symposium on Computer Architecture, New York, New York, USA, June 18, 2022

Improved Hardness of BDD and SVP Under Gap-(S)ETH.

[BibT_eX]

[DOI]

Huck Bennett

Yi Tang

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Vector and Functional Commitments from Lattices.

[BibT_eX]

[DOI]

Zachary Pepin

Chad Sharp

IACR Cryptol. ePrint Arch., 2021

F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2021

F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the MICRO '21: 54th Annual IEEE/ACM International Symposium on Microarchitecture, 2021

2020

Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Constraining and Watermarking PRFs from Milder Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Hardness of Bounded Distance Decoding on Lattices in ℓp Norms.

[BibT_eX]

[DOI]

Huck Bennett

Proceedings of the 35th Computational Complexity Conference, 2020

2019

Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

He Gives C-Sieves on the CSIDH.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Identifying Research Challenges in Post Quantum Cryptography Migration and Cryptographic Agility.

[BibT_eX]

[DOI]

David Ott

Christopher Peikert

et al.

CoRR, 2019

Outsourcing Computation: The Minimal Refereed Mechanism.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

2018

More Efficient Commitments from Structured Lattice Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

ALCHEMY: A Language and Compiler for Homomorphic Encryption Made easY.

[BibT_eX]

[DOI]

Chad Sharp

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

Privately Constraining and Programming PRFs, the LWE Way.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Pseudorandomness of Ring-LWE for Any Ring and Modulus.

[BibT_eX]

[DOI]

Oded Regev

Noah Stephens-Davidowitz

IACR Cryptol. ePrint Arch., 2017

New (and Old) Proof Systems for Lattice Problems.

[BibT_eX]

[DOI]

Navid Alamati

Noah Stephens-Davidowitz

IACR Cryptol. ePrint Arch., 2017

List-Decoding Barnes-Wall Lattices.

[BibT_eX]

[DOI]

Elena Grigorescu

Comput. Complex., 2017

2016

Multi-Key FHE from LWE, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

How (Not) to Instantiate Ring-LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Challenges for Ring-LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

On Adaptively Secure Multiparty Computation with a Short CRS.

[BibT_eX]

[DOI]

Ran Cohen

IACR Cryptol. ePrint Arch., 2016

Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE.

[BibT_eX]

[DOI]

Navid Alamati

IACR Cryptol. ePrint Arch., 2016

Λολ: Functional Lattice Cryptography.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015

Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

J. Cryptol., 2015

A Decade of Lattice Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Λ ∘ λ: A Functional Library for Lattice Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Recovering Short Generators of Principal Ideals in Cyclotomic Rings.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Key-Homomorphic Constrained Pseudorandom Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2014

Lattice Cryptography for the Internet.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

New and Improved Key-Homomorphic Pseudorandom Functions.

[BibT_eX]

[DOI]

Abhishek Banerjee

IACR Cryptol. ePrint Arch., 2014

Faster Bootstrapping with Polynomial Error.

[BibT_eX]

[DOI]

Jacob Alperin-Sheriff

IACR Cryptol. ePrint Arch., 2014

SPRING: Fast Pseudorandom Functions from Rounded Ring Products.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption - 21st International Workshop, 2014

2013

Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010).

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

Field switching in BGV-style homomorphic encryption.

[BibT_eX]

[DOI]

J. Comput. Secur., 2013

On Ideal Lattices and Learning with Errors over Rings.

[BibT_eX]

[DOI]

Vadim Lyubashevsky

Oded Regev

J. ACM, 2013

Hardness of SIS and LWE with Small Parameters.

[BibT_eX]

[DOI]

Daniele Micciancio

IACR Cryptol. ePrint Arch., 2013

A Toolkit for Ring-LWE Cryptography.

[BibT_eX]

[DOI]

Vadim Lyubashevsky

Oded Regev

IACR Cryptol. ePrint Arch., 2013

How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE.

[BibT_eX]

[DOI]

Rikke Bendlin

Sara Krehbiel

IACR Cryptol. ePrint Arch., 2013

Practical Bootstrapping in Quasilinear Time.

[BibT_eX]

[DOI]

Jacob Alperin-Sheriff

IACR Cryptol. ePrint Arch., 2013

Classical hardness of learning with errors.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

On the Lattice Smoothing Parameter Problem.

[BibT_eX]

[DOI]

Proceedings of the 28th Conference on Computational Complexity, 2013

2012

Bonsai Trees, or How to Delegate a Lattice Basis.

[BibT_eX]

[DOI]

J. Cryptol., 2012

Ring Switching in BGV-Style Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

Circular and KDM Security for Identity-Based Encryption.

[BibT_eX]

[DOI]

Jacob Alperin-Sheriff

Proceedings of the Public Key Cryptography - PKC 2012, 2012

An update on SIPHER (Scalable Implementation of Primitives for Homomorphic EncRyption) - FPGA implementation using Simulink.

[BibT_eX]

[DOI]

Proceedings of the IEEE Conference on High Performance Extreme Computing, 2012

2011

Lossy Trapdoor Functions and Their Applications.

[BibT_eX]

[DOI]

Brent Waters

SIAM J. Comput., 2011

Bi-Deniable Public-Key Encryption.

[BibT_eX]

[DOI]

Adam O'Neill

Brent Waters

IACR Cryptol. ePrint Arch., 2011

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.

[BibT_eX]

[DOI]

Daniele Micciancio

IACR Cryptol. ePrint Arch., 2011

Identity-Based (Lossy) Trapdoor Functions and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Pseudorandom Functions and Lattices.

[BibT_eX]

[DOI]

Abhishek Banerjee

Alon Rosen

IACR Cryptol. ePrint Arch., 2011

Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings.

[BibT_eX]

[DOI]

Daniel Dadush

Santosh S. Vempala

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Optimal Error Correction for Computationally Bounded Noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

An Efficient and Parallel Gaussian Sampler for Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Better Key Sizes (and Attacks) for LWE-Based Encryption.

[BibT_eX]

[DOI]

Richard Lindner

IACR Cryptol. ePrint Arch., 2010

Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings

[BibT_eX]

[DOI]

Daniel Dadush

Santosh S. Vempala

CoRR, 2010

Public-Key Encryption Schemes with Auxiliary Inputs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Heuristics and Rigor in Lattice-Based Cryptography - (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Robustness of the Learning with Errors Assumption.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Computer Science, 2010

2009

Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Some Recent Progress in Lattice-Based Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Public-key cryptosystems from the worst-case shortest vector problem: extended abstract.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

2008

Generating Shorter Bases for Hard Random Lattices.

[BibT_eX]

[DOI]

Joël Alwen

IACR Cryptol. ePrint Arch., 2008

Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2008

Limits on the Hardness of Lattice Problems in lp Norms.

[BibT_eX]

[DOI]

Comput. Complex., 2008

SWIFFT: A Modest Proposal for FFT Hashing.

[BibT_eX]

[DOI]

Proceedings of the Fast Software Encryption, 15th International Workshop, 2008

Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems.

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology, 2008

2007

A Framework for Efficient and Composable Oblivious Transfer.

[BibT_eX]

[DOI]

Vinod Vaikuntanathan

Brent Waters

IACR Cryptol. ePrint Arch., 2007

Trapdoors for Hard Lattices and New Cryptographic Constructions.

[BibT_eX]

[DOI]

Craig Gentry

Vinod Vaikuntanathan

Electron. Colloquium Comput. Complex., 2007

Limits on the Hardness of Lattice Problems in ell _p Norms.

[BibT_eX]

[DOI]

Christopher Jason Peikert

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007

2006

Cryptographic error correction.

[BibT_eX]

[DOI]

PhD thesis, 2006

Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors.

[BibT_eX]

[DOI]

Alon Rosen

Electron. Colloquium Comput. Complex., 2006

Limits on the Hardness of Lattice Problems in ℓp Norms.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

2005

On Error Correction in the Exponent.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices

[BibT_eX]

[DOI]

Alon Rosen

Electron. Colloquium Comput. Complex., 2005

Optimal Error Correction Against Computationally Bounded Noise.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005

2004

Completely fair SFE and coalition-safe cheap talk.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003

Lower bounds for collusion-secure fingerprinting.

[BibT_eX]

[DOI]

Abhi Shelat

Adam D. Smith

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2001

Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes.

[BibT_eX]

[DOI]

Anna Lysyanskaya