 | 2009 |
|---|
| 10 |       | Vadim Lyubashevsky,
Daniele Micciancio:
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem.
CRYPTO 2009: 577-594 |
| 9 | | Ishay Haviv,
Vadim Lyubashevsky,
Oded Regev:
A Note on the Distribution of the Distance from a Lattice.
Discrete & Computational Geometry 41(1): 162-176 (2009) |
| 2008 |
|---|
| 8 | | Vadim Lyubashevsky,
Daniele Micciancio,
Chris Peikert,
Alon Rosen:
SWIFFT: A Modest Proposal for FFT Hashing.
FSE 2008: 54-72 |
| 7 | | Vadim Lyubashevsky:
Lattice-Based Identification Schemes Secure Under Active Attacks.
Public Key Cryptography 2008: 162-179 |
| 6 | | Vadim Lyubashevsky,
Daniele Micciancio:
Asymptotically Efficient Lattice-Based Digital Signatures.
TCC 2008: 37-54 |
| 2006 |
|---|
| 5 | | Yi-Kai Liu,
Vadim Lyubashevsky,
Daniele Micciancio:
On Bounded Distance Decoding for General Lattices.
APPROX-RANDOM 2006: 450-461 |
| 4 | | Vadim Lyubashevsky,
Daniele Micciancio:
Generalized Compact Knapsacks Are Collision Resistant.
ICALP (2) 2006: 144-155 |
| 2005 |
|---|
| 3 | | Vadim Lyubashevsky:
The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem.
APPROX-RANDOM 2005: 378-389 |
| 2 | | Vadim Lyubashevsky:
On Random High Density Subset Sums
Electronic Colloquium on Computational Complexity (ECCC)(007): (2005) |
| 1 | | Vadim Lyubashevsky,
Daniele Micciancio:
Generalized Compact Knapsacks are Collision Resistant
Electronic Colloquium on Computational Complexity (ECCC)(142): (2005) |
