| 2009 |
|---|
| 22 | EE | Joël Alwen,
Chris Peikert:
Generating Shorter Bases for Hard Random Lattices.
STACS 2009: 75-86 |
| 21 | EE | Chris Peikert:
Some Recent Progress in Lattice-Based Cryptography.
TCC 2009: 72 |
| 2008 |
|---|
| 20 | EE | Chris Peikert,
Vinod Vaikuntanathan:
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems.
CRYPTO 2008: 536-553 |
| 19 | EE | Chris Peikert,
Vinod Vaikuntanathan,
Brent Waters:
A Framework for Efficient and Composable Oblivious Transfer.
CRYPTO 2008: 554-571 |
| 18 | EE | Vadim Lyubashevsky,
Daniele Micciancio,
Chris Peikert,
Alon Rosen:
SWIFFT: A Modest Proposal for FFT Hashing.
FSE 2008: 54-72 |
| 17 | EE | Chris Peikert,
Brent Waters:
Lossy trapdoor functions and their applications.
STOC 2008: 187-196 |
| 16 | EE | Craig Gentry,
Chris Peikert,
Vinod Vaikuntanathan:
Trapdoors for hard lattices and new cryptographic constructions.
STOC 2008: 197-206 |
| 15 | EE | Chris Peikert:
Limits on the Hardness of Lattice Problems in lp Norms.
Computational Complexity 17(2): 300-351 (2008) |
| 14 | EE | Chris Peikert:
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem.
Electronic Colloquium on Computational Complexity (ECCC) 15(100): (2008) |
| 2007 |
|---|
| 13 | EE | Chris Peikert:
Limits on the Hardness of Lattice Problems in ell _p Norms.
IEEE Conference on Computational Complexity 2007: 333-346 |
| 12 | EE | Chris Peikert,
Alon Rosen:
Lattices that admit logarithmic worst-case to average-case connection factors.
STOC 2007: 478-487 |
| 11 | EE | Chris Peikert,
Brent Waters:
Lossy Trapdoor Functions and Their Applications.
Electronic Colloquium on Computational Complexity (ECCC) 14(080): (2007) |
| 10 | EE | Craig Gentry,
Chris Peikert,
Vinod Vaikuntanathan:
Trapdoors for Hard Lattices and New Cryptographic Constructions.
Electronic Colloquium on Computational Complexity (ECCC) 14(133): (2007) |
| 2006 |
|---|
| 9 | EE | Chris Peikert,
Alon Rosen:
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices.
TCC 2006: 145-166 |
| 8 | EE | Chris Peikert:
On Error Correction in the Exponent.
TCC 2006: 167-183 |
| 7 | EE | Chris Peikert,
Alon Rosen:
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors.
Electronic Colloquium on Computational Complexity (ECCC) 13(147): (2006) |
| 6 | EE | Chris Peikert:
Limits on the Hardness of Lattice Problems in $\ell_p$ Norms.
Electronic Colloquium on Computational Complexity (ECCC) 13(148): (2006) |
| 2005 |
|---|
| 5 | EE | Silvio Micali,
Chris Peikert,
Madhu Sudan,
David A. Wilson:
Optimal Error Correction Against Computationally Bounded Noise.
TCC 2005: 1-16 |
| 4 | EE | Chris Peikert,
Alon Rosen:
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
Electronic Colloquium on Computational Complexity (ECCC)(158): (2005) |
| 2004 |
|---|
| 3 | EE | Matt Lepinski,
Silvio Micali,
Chris Peikert,
Abhi Shelat:
Completely fair SFE and coalition-safe cheap talk.
PODC 2004: 1-10 |
| 2003 |
|---|
| 2 | EE | Chris Peikert,
Abhi Shelat,
Adam Smith:
Lower bounds for collusion-secure fingerprinting.
SODA 2003: 472-479 |
| 2001 |
|---|
| 1 | EE | Anna Lysyanskaya,
Chris Peikert:
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes.
ASIACRYPT 2001: 331-350 |
