Search the dblp DataBase
Vadim Lyubashevsky :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] Vadim Lyubashevsky , Daniele Micciancio Generalized Compact Knapsacks Are Collision Resistant. [Citation Graph (0, 0)][DBLP ] ICALP (2), 2006, pp:144-155 [Conf ] 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 ] 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 ] Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. [Citation Graph (, )][DBLP ] On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. [Citation Graph (, )][DBLP ] On Ideal Lattices and Learning with Errors over Rings. [Citation Graph (, )][DBLP ] SWIFFT: A Modest Proposal for FFT Hashing. [Citation Graph (, )][DBLP ] Lattice-Based Identification Schemes Secure Under Active Attacks. [Citation Graph (, )][DBLP ] Asymptotically Efficient Lattice-Based Digital Signatures. [Citation Graph (, )][DBLP ] Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. [Citation Graph (, )][DBLP ] A Note on the Distribution of the Distance from a Lattice. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs