Active Bibliography

3 Provably secure FFT hashing – Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen - 2006
36 Lattice-based Cryptography – Daniele Micciancio, Oded Regev - 2008
40 Generalized compact knapsacks are collision resistant – Vadim Lyubashevsky, Daniele Micciancio - 2006
2 The Geometry of Lattice Cryptography – Daniele Micciancio - 2012
Principal Adviser – Craig Gentry - 2009
19 Lattices that admit logarithmic worst-case to averagecase connection factors – Chris Peikert, Alon Rosen - 2007
3 Cryptographic functions from worst-case complexity assumptions – Daniele Micciancio - 2007
10 Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures – Vadim Lyubashevsky - 2009
1 How to Use a Short Basis: Trapdoors for Hard Lattices and New Cryptographic Constructions – Craig Gentry, Vinod Vaikuntanathan, Chris Peikert - 2008
18 Limits on the hardness of lattice problems in ℓp norms – Chris Peikert - 2007
5 The Learning with Errors Problem – Oded Regev
3 Worst-Case to Average-Case Reductions for Module Lattices – Adeline Langlois, Damien Stehlé
A Study on Lattice-Based Public-Key Cryptosystems – M Keita Xagawa
Faster and Smoother – VSH Revisited – Juraj ˇ Sarinay
3 Explicit hard instances of the shortest vector problem – Johannes Buchmann, Richard Lindner, Markus Rückert, Michael Schneider - 2008
65 Bonsai Trees, or How to Delegate a Lattice Basis – David Cash, Dennis Hofheinz, Eike Kiltz, Chris Peikert - 2010
7 Towards Practical Lattice-Based Cryptography – Vadim Lyubashevsky - 2008
38 New lattice based cryptographic constructions – Oded Regev - 2003
17 Asymptotically efficient lattice-based digital signatures – Vadim Lyubashevsky, Daniele Micciancio - 2008