Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De spite their apparent simplicity, lattices hide a rich combinatorial struc ture, which has attracted the attention of great mathematicians over the last two centuries. Not surprisingly, lattices have found numerous ap plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. The study of lattices, specifically from a computational point of view, was marked...

TCC2010, the7thTheoryofCryptographyConference, washeldatETHZurich, Zurich, Switzerland, during February 9-11, 2010. TCC 2010 was sponsored by theInternationalAssociationofCryptologicResearch(IACR)andwasorganized in cooperation with the Information Security and Cryptography group at ETH Zurich.The GeneralChairsof the conferencewereMartin Hirt andUeli Maurer. The conference received 100 submissions, of which the Program Committee selected 33 for presentation at the conference. The Best Student Paper Award was given to Kai-Min Chung and Feng-Hao Liu for their paper "ParallelRepe- tion Theorems...

Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De- spite their apparent simplicity, lattices hide a rich combinatorial struc- ture, which has attracted the attention of great mathematicians over the last two centuries. Not surprisingly, lattices have found numerous ap- plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. The study of lattices, specifically from a computational point of view, was...