[GSV98] O. Goldreich, A. Sahai, and S. P. Vadhan. Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In STOC, pages 399–408. 1998.
[GSV99] O. Goldreich, A. Sahai, and S. P. Vadhan. Can statistical zero knowledge be made non-interactive? or on the relationship of SZK and NISZK. In CRYPTO, pages 467–484. 1999.
[Hoe63] W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13–30, 1963.
[HR14] I. Haviv and O. Regev. On the lattice isomorphism problem. In SODA, pages 391–404. 2014.
[JS98] A. Joux and J. Stern. Lattice reduction: A toolbox for the cryptanalyst. J. Cryptology, 11(3):161–185, 1998.
[Kan83] R. Kannan. Improved algorithms for integer programming and related lattice problems. In STOC, pages 193–206. 1983.
[Kle00] P. N. Klein. Finding the closest lattice vector when it’s unusually close. In SODA, pages 937–941. 2000.
[Len83] H. W. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4):538–548, November 1983.
[LLL82] A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261(4):515–534, December 1982.
[MG02] D. Micciancio and S. Goldwasser. Complexity of Lattice Problems: a cryptographic perspective, volume 671 of The Kluwer International Series in Engineering and Computer Science. Kluwer Academic Publishers, Boston, Massachusetts, 2002.
[MP12] D. Micciancio and C. Peikert. Trapdoors for lattices: Simpler, tighter, faster, smaller. In EUROCRYPT, pages 700–718. 2012.
[MR04] D. Micciancio and O. Regev. Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput., 37(1):267–302, 2007. Preliminary version in FOCS 2004.
[MV03] D. Micciancio and S. P. Vadhan. Statistical zero-knowledge proofs with efficient provers: Lattice problems and more. In CRYPTO, pages 282–298. 2003.
[NS01] P. Q. Nguyen and J. Stern. The two faces of lattices in cryptology. In CaLC, pages 146–180. 2001.
[NV06] M. Nguyen and S. P. Vadhan. Zero knowledge with efficient provers. In STOC, pages 287–295. 2006.
[NY90] M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In STOC, pages 427–437. 1990.
[Odl90] A. M. Odlyzko. The rise and fall of knapsack cryptosystems. In C. Pomerance, editor, Cryptography and Computational Number Theory, volume 42 of Proceedings of Symposia in Applied Mathematics, pages 75–88. 1990.