| 1 | 2013 | Eurocrypt | pc |
| 2 | 2012 | PKC | pc |
| 3 | 2012 | TCC | pc |
| 4 | 2011 | Eurocrypt | pc |
| 5 | 2011 | TCC | pc |
| 6 | 2010 | PKC | pc |
| 7 | 2010 | Asiacrypt | pc |
| year | title | booktitle | pages | |
|---|---|---|---|---|
| 1 | 2012 | From Selective to Full Security: Semi-generic Transformations in the Standard Model | pkc | 316-333 |
| 2 | 2012 | Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems | ches | 530-547 |
| 3 | 2012 | Lattice Signatures without Trapdoors | eurocrypt | 738-755 |
| 4 | 2012 | Tightly-Secure Signatures from Lossy Identification Schemes | eurocrypt | 572-590 |
| 5 | 2010 | Public-Key Cryptographic Primitives Provably as Secure as Subset Sum | tcc | 382-400 |
| 6 | 2010 | On Ideal Lattices and Learning with Errors over Rings | eurocrypt | 1-23 |
| 7 | 2009 | On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem | crypto | 577-594 |
| 8 | 2009 | Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures | asiacrypt | 598-616 |
| 9 | 2008 | SWIFFT: A Modest Proposal for FFT Hashing | fse | online |
| 10 | 2008 | Asymptotically Efficient Lattice-Based Digital Signatures | tcc | 37-54 |
| 11 | 2008 | Lattice-Based Identification Schemes Secure Under Active Attacks | pkc | 162-179 |
Coauthors of Vadim Lyubashevsky |