| 2008 | ||
|---|---|---|
| 7 | EE | Vadim Lyubashevsky: Lattice-Based Identification Schemes Secure Under Active Attacks. Public Key Cryptography 2008: 162-179 |
| 6 | EE | Vadim Lyubashevsky, Daniele Micciancio: Asymptotically Efficient Lattice-Based Digital Signatures. TCC 2008: 37-54 |
| 2006 | ||
| 5 | EE | Yi-Kai Liu, Vadim Lyubashevsky, Daniele Micciancio: On Bounded Distance Decoding for General Lattices. APPROX-RANDOM 2006: 450-461 |
| 4 | EE | Vadim Lyubashevsky, Daniele Micciancio: Generalized Compact Knapsacks Are Collision Resistant. ICALP (2) 2006: 144-155 |
| 2005 | ||
| 3 | EE | 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 | EE | Vadim Lyubashevsky: On Random High Density Subset Sums Electronic Colloquium on Computational Complexity (ECCC)(007): (2005) |
| 1 | EE | Vadim Lyubashevsky, Daniele Micciancio: Generalized Compact Knapsacks are Collision Resistant Electronic Colloquium on Computational Complexity (ECCC)(142): (2005) |
| 1 | Yi-Kai Liu | [5] |
| 2 | Daniele Micciancio | [1] [4] [5] [6] |