| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
On Ideal Lattices and Learning with Errors Over Rings.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters |
Identity-Based (Lossy) Trapdoor Functions and Applications. |
EUROCRYPT |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhishek Banerjee 0001, Chris Peikert, Alon Rosen |
Pseudorandom Functions and Lattices. |
EUROCRYPT |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Chris Peikert |
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. |
EUROCRYPT |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Grigorescu, Chris Peikert |
List Decoding Barnes-Wall Lattices. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters |
Identity-Based (Lossy) Trapdoor Functions and Applications. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Abhishek Banerjee 0001, Chris Peikert, Alon Rosen |
Pseudorandom Functions and Lattices. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Adam O'Neill, Chris Peikert, Brent Waters |
Bi-Deniable Public-Key Encryption. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio, Chris Peikert |
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Elena Grigorescu, Chris Peikert |
List Decoding Barnes-Wall Lattices |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Joël Alwen, Chris Peikert |
Generating Shorter Bases for Hard Random Lattices. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Brent Waters |
Lossy Trapdoor Functions and Their Applications. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Lindner, Chris Peikert |
Better Key Sizes (and Attacks) for LWE-Based Encryption. |
CT-RSA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam O'Neill, Chris Peikert, Brent Waters |
Bi-Deniable Public-Key Encryption. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Dadush, Chris Peikert, Santosh Vempala |
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert |
An Efficient and Parallel Gaussian Sampler for Lattices. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert |
Bonsai Trees, or How to Delegate a Lattice Basis. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Richard Lindner, Chris Peikert |
Better Key Sizes (and Attacks) for LWE-Based Encryption. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Richard Lindner, Chris Peikert |
Better Key Sizes (and Attacks) for LWE-Based Encryption. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Daniel Dadush, Chris Peikert, Santosh Vempala |
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson |
Optimal Error Correction for Computationally Bounded Noise. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert |
Heuristics and Rigor in Lattice-Based Cryptography - (Invited Talk). |
SCN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert |
Bonsai Trees, or How to Delegate a Lattice Basis. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Chris Peikert, Oded Regev |
On Ideal Lattices and Learning with Errors over Rings. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan |
Public-Key Encryption Schemes with Auxiliary Inputs. |
TCC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert |
An Efficient and Parallel Gaussian Sampler for Lattices. |
CRYPTO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan |
Robustness of the Learning with Errors Assumption. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert |
Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography). |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Joël Alwen, Chris Peikert |
Generating Shorter Bases for Hard Random Lattices. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert |
Some Recent Progress in Lattice-Based Cryptography. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, David Cash, Chris Peikert, Amit Sahai |
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
Key-dependent message security, Learning problems, Encryption, Lattice-based cryptography |
| 1 | Chris Peikert |
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
cryptography, lattices |
| 1 | Chris Peikert |
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert |
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Joël Alwen, Chris Peikert |
Generating Shorter Bases for Hard Random Lattices. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert |
Limits on the Hardness of Lattice Problems in lp Norms. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
11H06, 94B75, 68Q25, Subject classification. 68Q17 |
| 1 | Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen |
SWIFFT: A Modest Proposal for FFT Hashing. |
FSE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Vinod Vaikuntanathan, Brent Waters |
A Framework for Efficient and Composable Oblivious Transfer. |
CRYPTO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Vinod Vaikuntanathan |
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems. |
CRYPTO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Brent Waters |
Lossy trapdoor functions and their applications. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
public key encryption, trapdoor functions |
| 1 | Craig Gentry, Chris Peikert, Vinod Vaikuntanathan |
Trapdoors for hard lattices and new cryptographic constructions. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
lattice-based cryptography, trapdoor functions |
| 1 | Chris Peikert, Brent Waters |
Lossy Trapdoor Functions and Their Applications. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Craig Gentry, Chris Peikert, Vinod Vaikuntanathan |
Trapdoors for Hard Lattices and New Cryptographic Constructions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert, Brent Waters |
Lossy Trapdoor Functions and Their Applications. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Craig Gentry, Chris Peikert, Vinod Vaikuntanathan |
Trapdoors for Hard Lattices and New Cryptographic Constructions. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert, Vinod Vaikuntanathan, Brent Waters |
A Framework for Efficient and Composable Oblivious Transfer. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert |
Limits on the Hardness of Lattice Problems in ell _p Norms. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Alon Rosen |
Lattices that admit logarithmic worst-case to average-case connection factors. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
algebraic number theory, worst-case to average-case reductions, lattices |
| 1 | Chris Peikert |
Limits on the Hardness of Lattice Problems in $\ell_p$ Norms. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert, Alon Rosen |
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert, Alon Rosen |
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. |
IACR Cryptology ePrint Archive |
2006 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert |
On Error Correction in the Exponent. |
TCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Alon Rosen |
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. |
TCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Alon Rosen |
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Chris Peikert |
On Error Correction in the Exponent. |
IACR Cryptology ePrint Archive |
2005 |
DBLP BibTeX RDF |
|
| 1 | Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson |
Optimal Error Correction Against Computationally Bounded Noise. |
TCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Matt Lepinski, Silvio Micali, Chris Peikert, Abhi Shelat |
Completely fair SFE and coalition-safe cheap talk. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
correlated equilibrium, game theory, mechanism design, secure function evaluation |
| 1 | Chris Peikert, Abhi Shelat, Adam Smith |
Lower bounds for collusion-secure fingerprinting. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Lysyanskaya, Chris Peikert |
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes. |
ASIACRYPT |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")