Search the dblp DataBase

Publications of Author

1. Anna Lysyanskaya, Chris Peikert
   Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes. [Citation Graph (0, 0)][DBLP]
   ASIACRYPT, 2001, pp:331-350 [Conf]
   
2. Matt Lepinski, Silvio Micali, Chris Peikert, Abhi Shelat
   Completely fair SFE and coalition-safe cheap talk. [Citation Graph (0, 0)][DBLP]
   PODC, 2004, pp:1-10 [Conf]
   
3. Chris Peikert, Abhi Shelat, Adam Smith
   Lower bounds for collusion-secure fingerprinting. [Citation Graph (0, 0)][DBLP]
   SODA, 2003, pp:472-479 [Conf]
   
4. Chris Peikert
   On Error Correction in the Exponent. [Citation Graph (0, 0)][DBLP]
   TCC, 2006, pp:167-183 [Conf]
   
5. Chris Peikert, Alon Rosen
   Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. [Citation Graph (0, 0)][DBLP]
   TCC, 2006, pp:145-166 [Conf]
   
6. Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson
   Optimal Error Correction Against Computationally Bounded Noise. [Citation Graph (0, 0)][DBLP]
   TCC, 2005, pp:1-16 [Conf]
   
7. Chris Peikert, Alon Rosen
   Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:158, pp:- [Journal]
   
8. Chris Peikert
   Limits on the Hardness of Lattice Problems in ell _p Norms. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2007, pp:333-346 [Conf]
   
9. Chris Peikert, Alon Rosen
   Lattices that admit logarithmic worst-case to average-case connection factors. [Citation Graph (0, 0)][DBLP]
   STOC, 2007, pp:478-487 [Conf]
   
10. 
    A Framework for Efficient and Composable Oblivious Transfer. [Citation Graph (, )][DBLP]
    
    
11. 
    Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems. [Citation Graph (, )][DBLP]
    
    
12. 
    Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. [Citation Graph (, )][DBLP]
    
    
13. 
    An Efficient and Parallel Gaussian Sampler for Lattices. [Citation Graph (, )][DBLP]
    
    
14. 
    Bonsai Trees, or How to Delegate a Lattice Basis. [Citation Graph (, )][DBLP]
    
    
15. 
    On Ideal Lattices and Learning with Errors over Rings. [Citation Graph (, )][DBLP]
    
    
16. 
    SWIFFT: A Modest Proposal for FFT Hashing. [Citation Graph (, )][DBLP]
    
    
17. 
    Heuristics and Rigor in Lattice-Based Cryptography - (Invited Talk). [Citation Graph (, )][DBLP]
    
    
18. 
    Generating Shorter Bases for Hard Random Lattices. [Citation Graph (, )][DBLP]
    
    
19. 
    Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. [Citation Graph (, )][DBLP]
    
    
20. 
    Lossy trapdoor functions and their applications. [Citation Graph (, )][DBLP]
    
    
21. 
    Trapdoors for hard lattices and new cryptographic constructions. [Citation Graph (, )][DBLP]
    
    
22. 
    Some Recent Progress in Lattice-Based Cryptography. [Citation Graph (, )][DBLP]
    
    
23. 
    Public-Key Encryption Schemes with Auxiliary Inputs. [Citation Graph (, )][DBLP]
    
    
24. 
    Robustness of the Learning with Errors Assumption. [Citation Graph (, )][DBLP]
    
    
25. 
    Limits on the Hardness of Lattice Problems in l_p Norms. [Citation Graph (, )][DBLP]
    
    
26. 
    Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. [Citation Graph (, )][DBLP]
    
    
27. 
    Lossy Trapdoor Functions and Their Applications. [Citation Graph (, )][DBLP]
    
    
28. 
    Trapdoors for Hard Lattices and New Cryptographic Constructions. [Citation Graph (, )][DBLP]
    
    
29. 
    Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. [Citation Graph (, )][DBLP]
    
    
30. 
    Limits on the Hardness of Lattice Problems in $\ell_p$ Norms. [Citation Graph (, )][DBLP]