Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarChris Peikert
Christopher Jason Peikert
Person information
- affiliation: University of Michigan, Ann Arbor, MI, USA
- affiliation (former): Massachusetts Institute of Technology, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[c53]Navid Alamati, Chris Peikert, Noah Stephens-Davidowitz:
New (and Old) Proof Systems for Lattice Problems. Public Key Cryptography (2) 2018: 619-643- [c52]Chris Peikert, Sina Shiehian:
Privately Constraining and Programming PRFs, the LWE Way. Public Key Cryptography (2) 2018: 675-701 - 2017
- [j11]Elena Grigorescu, Chris Peikert:
List-Decoding Barnes-Wall Lattices. Computational Complexity 26(2): 365-392 (2017) - [c51]Chris Peikert, Oded Regev, Noah Stephens-Davidowitz:
Pseudorandomness of ring-LWE for any ring and modulus. STOC 2017: 461-473 - [i48]Chris Peikert, Oded Regev, Noah Stephens-Davidowitz:
Pseudorandomness of Ring-LWE for Any Ring and Modulus. IACR Cryptology ePrint Archive 2017: 258 (2017) - [i47]Chris Peikert, Sina Shiehian:
Privately Constraining and Programming PRFs, the LWE Way. IACR Cryptology ePrint Archive 2017: 1094 (2017) - [i46]Navid Alamati, Chris Peikert, Noah Stephens-Davidowitz:
New (and Old) Proof Systems for Lattice Problems. IACR Cryptology ePrint Archive 2017: 1226 (2017) - 2016
- [j10]Chris Peikert:
A Decade of Lattice Cryptography. Foundations and Trends in Theoretical Computer Science 10(4): 283-424 (2016) - [c50]Eric Crockett, Chris Peikert:
Λολ: Functional Lattice Cryptography. ACM Conference on Computer and Communications Security 2016: 993-1005 - [c49]Navid Alamati, Chris Peikert:
Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE. CRYPTO (2) 2016: 659-680 - [c48]Ronald Cramer, Léo Ducas, Chris Peikert, Oded Regev:
Recovering Short Generators of Principal Ideals in Cyclotomic Rings. EUROCRYPT (2) 2016: 559-585 - [c47]
- [c46]
- [c45]
- [i45]Navid Alamati, Chris Peikert:
Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE. IACR Cryptology ePrint Archive 2016: 110 (2016) - [i44]Chris Peikert, Sina Shiehian:
Multi-Key FHE from LWE, Revisited. IACR Cryptology ePrint Archive 2016: 196 (2016) - [i43]
- [i42]Eric Crockett, Chris Peikert:
Challenges for Ring-LWE. IACR Cryptology ePrint Archive 2016: 782 (2016) - [i41]Ran Cohen, Chris Peikert:
On Adaptively Secure Multiparty Computation with a Short CRS. IACR Cryptology ePrint Archive 2016: 976 (2016) - [i40]Carsten Baum, Ivan Damgård, Sabine Oechsner, Chris Peikert:
Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems. IACR Cryptology ePrint Archive 2016: 997 (2016) - 2015
- [j9]Craig Gentry, Jens Groth, Yuval Ishai, Chris Peikert, Amit Sahai, Adam D. Smith:
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs. J. Cryptology 28(4): 820-843 (2015) - [c44]Abhishek Banerjee, Georg Fuchsbauer, Chris Peikert, Krzysztof Pietrzak, Sophie Stevens:
Key-Homomorphic Constrained Pseudorandom Functions. TCC (2) 2015: 31-60 - [i39]Abhishek Banerjee, Georg Fuchsbauer, Chris Peikert, Krzysztof Pietrzak, Sophie Stevens:
Key-Homomorphic Constrained Pseudorandom Functions. IACR Cryptology ePrint Archive 2015: 180 (2015) - [i38]Ronald Cramer, Léo Ducas, Chris Peikert, Oded Regev:
Recovering Short Generators of Principal Ideals in Cyclotomic Rings. IACR Cryptology ePrint Archive 2015: 313 (2015) - [i37]
- [i36]Eric Crockett, Chris Peikert:
$\Lambda \circ \lambda$: A Functional Library for Lattice Cryptography. IACR Cryptology ePrint Archive 2015: 1134 (2015) - 2014
- [c43]Jacob Alperin-Sheriff, Chris Peikert:
Faster Bootstrapping with Polynomial Error. CRYPTO (1) 2014: 297-314 - [c42]Abhishek Banerjee, Chris Peikert:
New and Improved Key-Homomorphic Pseudorandom Functions. CRYPTO (1) 2014: 353-370 - [c41]Abhishek Banerjee, Hai Brenner, Gaëtan Leurent, Chris Peikert, Alon Rosen:
SPRING: Fast Pseudorandom Functions from Rounded Ring Products. FSE 2014: 38-57 - [c40]
- [i35]Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, Chris Peikert:
On the Lattice Smoothing Parameter Problem. CoRR abs/1412.7979 (2014) - [i34]Chris Peikert:
Lattice Cryptography for the Internet. IACR Cryptology ePrint Archive 2014: 70 (2014) - [i33]Abhishek Banerjee, Chris Peikert:
New and Improved Key-Homomorphic Pseudorandom Functions. IACR Cryptology ePrint Archive 2014: 74 (2014) - [i32]Jacob Alperin-Sheriff, Chris Peikert:
Faster Bootstrapping with Polynomial Error. IACR Cryptology ePrint Archive 2014: 94 (2014) - 2013
- [j8]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors over Rings. J. ACM 60(6): 43:1-43:35 (2013) - [j7]Craig Gentry, Shai Halevi, Chris Peikert, Nigel P. Smart:
Field switching in BGV-style homomorphic encryption. Journal of Computer Security 21(5): 663-684 (2013) - [j6]Chris Peikert, Robert Kleinberg, Aravind Srinivasan, Alan M. Frieze, Alexander Russell, Leonard J. Schulman:
Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010). SIAM J. Comput. 42(3): 1216-1217 (2013) - [c39]Rikke Bendlin, Sara Krehbiel, Chris Peikert:
How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE. ACNS 2013: 218-236 - [c38]Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, Chris Peikert:
On the Lattice Smoothing Parameter Problem. IEEE Conference on Computational Complexity 2013: 230-241 - [c37]Jacob Alperin-Sheriff, Chris Peikert:
Practical Bootstrapping in Quasilinear Time. CRYPTO (1) 2013: 1-20 - [c36]Daniele Micciancio, Chris Peikert:
Hardness of SIS and LWE with Small Parameters. CRYPTO (1) 2013: 21-39 - [c35]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
A Toolkit for Ring-LWE Cryptography. EUROCRYPT 2013: 35-54 - [c34]Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé:
Classical hardness of learning with errors. STOC 2013: 575-584 - [i31]Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé:
Classical Hardness of Learning with Errors. CoRR abs/1306.0281 (2013) - [i30]Daniele Micciancio, Chris Peikert:
Hardness of SIS and LWE with Small Parameters. IACR Cryptology ePrint Archive 2013: 69 (2013) - [i29]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
A Toolkit for Ring-LWE Cryptography. IACR Cryptology ePrint Archive 2013: 293 (2013) - [i28]Jacob Alperin-Sheriff, Chris Peikert:
Practical Bootstrapping in Quasilinear Time. IACR Cryptology ePrint Archive 2013: 372 (2013) - [i27]Rikke Bendlin, Sara Krehbiel, Chris Peikert:
How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE. IACR Cryptology ePrint Archive 2013: 419 (2013) - 2012
- [j5]David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert:
Bonsai Trees, or How to Delegate a Lattice Basis. J. Cryptology 25(4): 601-639 (2012) - [c33]Elena Grigorescu, Chris Peikert:
List Decoding Barnes-Wall Lattices. IEEE Conference on Computational Complexity 2012: 316-325 - [c32]Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters:
Identity-Based (Lossy) Trapdoor Functions and Applications. EUROCRYPT 2012: 228-245 - [c31]Daniele Micciancio, Chris Peikert:
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. EUROCRYPT 2012: 700-718 - [c30]Abhishek Banerjee, Chris Peikert, Alon Rosen:
Pseudorandom Functions and Lattices. EUROCRYPT 2012: 719-737 - [c29]David Cousins, Kurt Rohloff, Chris Peikert, Richard E. Schantz:
An update on SIPHER (Scalable Implementation of Primitives for Homomorphic EncRyption) - FPGA implementation using Simulink. HPEC 2012: 1-5 - [c28]Jacob Alperin-Sheriff, Chris Peikert:
Circular and KDM Security for Identity-Based Encryption. Public Key Cryptography 2012: 334-352 - [c27]Craig Gentry, Shai Halevi, Chris Peikert, Nigel P. Smart:
Ring Switching in BGV-Style Homomorphic Encryption. SCN 2012: 19-37 - [i26]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors Over Rings. IACR Cryptology ePrint Archive 2012: 230 (2012) - 2011
- [j4]Joël Alwen, Chris Peikert:
Generating Shorter Bases for Hard Random Lattices. Theory Comput. Syst. 48(3): 535-553 (2011) - [j3]Chris Peikert, Brent Waters:
Lossy Trapdoor Functions and Their Applications. SIAM J. Comput. 40(6): 1803-1844 (2011) - [c26]
- [c25]Richard Lindner, Chris Peikert:
Better Key Sizes (and Attacks) for LWE-Based Encryption. CT-RSA 2011: 319-339 - [c24]Daniel Dadush, Chris Peikert, Santosh Vempala:
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings. FOCS 2011: 580-589 - [i25]
- [i24]Elena Grigorescu, Chris Peikert:
List Decoding Barnes-Wall Lattices. Electronic Colloquium on Computational Complexity (ECCC) 18: 165 (2011) - [i23]Adam O'Neill, Chris Peikert, Brent Waters:
Bi-Deniable Public-Key Encryption. IACR Cryptology ePrint Archive 2011: 352 (2011) - [i22]Abhishek Banerjee, Chris Peikert, Alon Rosen:
Pseudorandom Functions and Lattices. IACR Cryptology ePrint Archive 2011: 401 (2011) - [i21]Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters:
Identity-Based (Lossy) Trapdoor Functions and Applications. IACR Cryptology ePrint Archive 2011: 479 (2011) - [i20]Daniele Micciancio, Chris Peikert:
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. IACR Cryptology ePrint Archive 2011: 501 (2011) - 2010
- [j2]Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson:
Optimal Error Correction for Computationally Bounded Noise. IEEE Trans. Information Theory 56(11): 5673-5680 (2010) - [c23]
- [c22]Vadim Lyubashevsky, Chris Peikert, Oded Regev:
On Ideal Lattices and Learning with Errors over Rings. EUROCRYPT 2010: 1-23 - [c21]David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert:
Bonsai Trees, or How to Delegate a Lattice Basis. EUROCRYPT 2010: 523-552 - [c20]Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan:
Robustness of the Learning with Errors Assumption. ICS 2010: 230-240 - [c19]
- [c18]Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan:
Public-Key Encryption Schemes with Auxiliary Inputs. TCC 2010: 361-381 - [i19]Daniel Dadush, Chris Peikert, Santosh Vempala:
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings. CoRR abs/1011.5666 (2010) - [i18]Chris Peikert:
An Efficient and Parallel Gaussian Sampler for Lattices. IACR Cryptology ePrint Archive 2010: 88 (2010) - [i17]David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert:
Bonsai Trees, or How to Delegate a Lattice Basis. IACR Cryptology ePrint Archive 2010: 591 (2010) - [i16]Richard Lindner, Chris Peikert:
Better Key Sizes (and Attacks) for LWE-Based Encryption. IACR Cryptology ePrint Archive 2010: 613 (2010)
2000 – 2009
- 2009
- [c17]Benny Applebaum, David Cash, Chris Peikert, Amit Sahai:
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. CRYPTO 2009: 595-618 - [c16]
- [c15]Chris Peikert:
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. STOC 2009: 333-342 - [c14]
- [i15]Chris Peikert:
Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography). IACR Cryptology ePrint Archive 2009: 359 (2009) - 2008
- [j1]Chris Peikert:
Limits on the Hardness of Lattice Problems in lp Norms. Computational Complexity 17(2): 300-351 (2008) - [c13]Chris Peikert, Vinod Vaikuntanathan:
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems. CRYPTO 2008: 536-553 - [c12]Chris Peikert, Vinod Vaikuntanathan, Brent Waters:
A Framework for Efficient and Composable Oblivious Transfer. CRYPTO 2008: 554-571 - [c11]Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen:
SWIFFT: A Modest Proposal for FFT Hashing. FSE 2008: 54-72 - [c10]
- [c9]Craig Gentry, Chris Peikert, Vinod Vaikuntanathan:
Trapdoors for hard lattices and new cryptographic constructions. STOC 2008: 197-206 - [i14]Chris Peikert:
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. Theoretical Foundations of Practical Information Security 2008 - [i13]Chris Peikert:
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. Electronic Colloquium on Computational Complexity (ECCC) 15(100) (2008) - [i12]Chris Peikert:
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. IACR Cryptology ePrint Archive 2008: 481 (2008) - [i11]Joël Alwen, Chris Peikert:
Generating Shorter Bases for Hard Random Lattices. IACR Cryptology ePrint Archive 2008: 521 (2008) - 2007
- [c8]Chris Peikert:
Limits on the Hardness of Lattice Problems in ell _p Norms. IEEE Conference on Computational Complexity 2007: 333-346 - [c7]Chris Peikert, Alon Rosen:
Lattices that admit logarithmic worst-case to average-case connection factors. STOC 2007: 478-487 - [i10]Chris Peikert, Brent Waters:
Lossy Trapdoor Functions and Their Applications. Electronic Colloquium on Computational Complexity (ECCC) 14(080) (2007) - [i9]Craig Gentry, Chris Peikert, Vinod Vaikuntanathan:
Trapdoors for Hard Lattices and New Cryptographic Constructions. Electronic Colloquium on Computational Complexity (ECCC) 14(133) (2007) - [i8]Chris Peikert, Brent Waters:
Lossy Trapdoor Functions and Their Applications. IACR Cryptology ePrint Archive 2007: 279 (2007) - [i7]Chris Peikert, Vinod Vaikuntanathan, Brent Waters:
A Framework for Efficient and Composable Oblivious Transfer. IACR Cryptology ePrint Archive 2007: 348 (2007) - [i6]Craig Gentry, Chris Peikert, Vinod Vaikuntanathan:
Trapdoors for Hard Lattices and New Cryptographic Constructions. IACR Cryptology ePrint Archive 2007: 432 (2007) - 2006
- [b1]Christopher Jason Peikert:
Cryptographic error correction. Massachusetts Institute of Technology, Cambridge, MA, USA 2006 - [c6]Chris Peikert, Alon Rosen:
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. TCC 2006: 145-166 - [c5]
- [i5]Chris Peikert, Alon Rosen:
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. Electronic Colloquium on Computational Complexity (ECCC) 13(147) (2006) - [i4]Chris Peikert:
Limits on the Hardness of Lattice Problems in ℓp Norms. Electronic Colloquium on Computational Complexity (ECCC) 13(148) (2006) - [i3]Chris Peikert, Alon Rosen:
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. IACR Cryptology ePrint Archive 2006: 444 (2006) - 2005
- [c4]Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson:
Optimal Error Correction Against Computationally Bounded Noise. TCC 2005: 1-16 - [i2]Chris Peikert, Alon Rosen:
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. Electronic Colloquium on Computational Complexity (ECCC)(158) (2005) - [i1]
- 2004
- [c3]Matt Lepinski, Silvio Micali, Chris Peikert, Abhi Shelat:
Completely fair SFE and coalition-safe cheap talk. PODC 2004: 1-10 - 2003
- [c2]Chris Peikert, Abhi Shelat, Adam D. Smith:
Lower bounds for collusion-secure fingerprinting. SODA 2003: 472-479 - 2001
- [c1]Anna Lysyanskaya, Chris Peikert:
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes. ASIACRYPT 2001: 331-350
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-15 21:06 CEST by the dblp team