Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Chris Peikert
2010 – today
- 2013
[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
- [i27]Daniele Micciancio, Chris Peikert: Hardness of SIS and LWE with Small Parameters. IACR Cryptology ePrint Archive 2013: 69 (2013)
- [i26]Vadim Lyubashevsky, Chris Peikert, Oded Regev: A Toolkit for Ring-LWE Cryptography. IACR Cryptology ePrint Archive 2013: 293 (2013)
- 2012
- [j6]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
- [i25]Vadim Lyubashevsky, Chris Peikert, Oded Regev: On Ideal Lattices and Learning with Errors Over Rings. IACR Cryptology ePrint Archive 2012: 230 (2012)
- 2011
- [j5]Elena Grigorescu, Chris Peikert: List Decoding Barnes-Wall Lattices. Electronic Colloquium on Computational Complexity (ECCC) 18: 165 (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
- [i24]
- [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 Transactions on 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: 592 (2010)
- [i15]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]
- [i14]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
- [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
- [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 $\ell_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 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-14 22:41 CEST by the dblp team