Search the dblp DataBase

Publications of Author

1. Vadim Lyubashevsky
   The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2005, pp:378-389 [Conf]
   
2. Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio
   On Bounded Distance Decoding for General Lattices. [Citation Graph (0, 0)][DBLP]
   APPROX-RANDOM, 2006, pp:450-461 [Conf]
   
3. Vadim Lyubashevsky, Daniele Micciancio
   Generalized Compact Knapsacks Are Collision Resistant. [Citation Graph (0, 0)][DBLP]
   ICALP (2), 2006, pp:144-155 [Conf]
   
4. Vadim Lyubashevsky
   On Random High Density Subset Sums [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:007, pp:- [Journal]
   
5. Vadim Lyubashevsky, Daniele Micciancio
   Generalized Compact Knapsacks are Collision Resistant [Citation Graph (0, 0)][DBLP]
   Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:142, pp:- [Journal]
   
6. 
   Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. [Citation Graph (, )][DBLP]
   
   
7. 
   On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. [Citation Graph (, )][DBLP]
   
   
8. 
   On Ideal Lattices and Learning with Errors over Rings. [Citation Graph (, )][DBLP]
   
   
9. 
   SWIFFT: A Modest Proposal for FFT Hashing. [Citation Graph (, )][DBLP]
   
   
10. 
    Lattice-Based Identification Schemes Secure Under Active Attacks. [Citation Graph (, )][DBLP]
    
    
11. 
    Asymptotically Efficient Lattice-Based Digital Signatures. [Citation Graph (, )][DBLP]
    
    
12. 
    Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. [Citation Graph (, )][DBLP]
    
    
13. 
    A Note on the Distribution of the Distance from a Lattice. [Citation Graph (, )][DBLP]