[Ban95] W. Banaszczyk. Inequalites for convex bodies and polar reciprocal lattices in $\mathbb{R}^n$. Discrete & Computational Geometry, 13:217–231, 1995.
[BDMP88] M. Blum, A. De Santis, S. Micali, and G. Persiano. Noninteractive zero-knowledge. SIAM J. Comput., 20(6):1084–1118, 1991. Preliminary version in STOC 1988.
[BG89] M. Bellare and S. Goldwasser. New paradigms for digital signatures and message authentication based on non-iterative zero knowledge proofs. In CRYPTO, pages 194–211. 1989.
[BGV12] Z. Brakerski, C. Gentry, and V. Vaikuntanathan. (Leveled) fully homomorphic encryption without bootstrapping. TOCT, 6(3):13, 2014. Preliminary version in ITCS 2012.
[BHZ87] R. B. Boppana, J. Håstad, and S. Zachos. Does co-NP have short interactive proofs? Inf. Process. Lett., 25(2):127–132, 1987.
[BLP+13] Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé. Classical hardness of learning with errors. In STOC, pages 575–584. 2013.
[BV11] Z. Brakerski and V. Vaikuntanathan. Efficient fully homomorphic encryption from (standard) LWE. SIAM J. Comput., 43(2):831–871, 2014. Preliminary version in FOCS 2011.
[Can01] R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS, pages 136–145. 2001.
[CDLP13] K. Chung, D. Dadush, F. Liu, and C. Peikert. On the lattice smoothing parameter problem. In IEEE Conference on Computational Complexity, pages 230–241. 2013.
[DN00] C. Dwork and M. Naor. Zaps and their applications. SIAM J. Comput., 36(6):1513–1543, 2007.
[DPV11] D. Dadush, C. Peikert, and S. Vempala. Enumerative lattice algorithms in any norm via M-ellipsoid coverings. In FOCS, pages 580–589. 2011.
[DR16] D. Dadush and O. Regev. Towards strong reverse Minkowski-type inequalities for lattices. In FOCS, pages 447–456. 2016.
[GG98] O. Goldreich and S. Goldwasser. On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci., 60(3):540–563, 2000. Preliminary version in STOC 1998.
[GMR85] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18(1):186–208, 1989. Preliminary version in STOC 1985.
[GMR04] V. Guruswami, D. Micciancio, and O. Regev. The complexity of the covering radius problem. Computational Complexity, 14(2):90–121, 2005. Preliminary version in CCC 2004.
[GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In STOC, pages 218–229. 1987.
[GMW91] O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM, 38(3):691–729, 1991.
[GPV08] C. Gentry, C. Peikert, and V. Vaikuntanathan. Trapdoors for hard lattices and new cryptographic constructions. In STOC, pages 197–206. 2008.