Monday, March 24, 2008
11:00 AM
Computer Studies Bldg. Room 209
Vinod Vaikuntanathan
Massachusetts Institute of Technolgy
New Results in Lattice-based Cryptography
In recent years, cryptography based on integer lattices has emerged to be an attractive alternative to traditional, number-theoretic cryptography. Lattice-based cryptographic schemes are attractive for several reasons: their security can be based on the worst-case hardness of problems, the computations involved are simple and of low complexity and the schemes, unlike number-theoretic ones, have thus far resisted quantum attacks.

Unfortunately, the use of lattices in cryptography so far has been limited to relatively simple primitives such as one-way functions and public-key encryption.

In this talk, I will describe new ways to generate and exploit *trapdoors* in lattices. The cryptographic applications of our techniques are numerous: we design various kinds of trapdoor functions, simple and efficient digital signature schemes, general secure multiparty computation, and identity-based encryption, all based on the worst-case hardness of lattice problems.

Bio: Vinod Vaikuntanathan is currently a PhD candidate in Computer Science at the Massachusetts Institute of Technology, where he obtained his masters degree in 2005. He attended the Indian Institute of Technology at Madras for his undergraduate studies.

He is interested in theoretical computer science and in particular, cryptography, complexity theory and the theory of distributed systems. Of late, he has been studying the fruitful relationship between cryptography and geometric objects called lattices.

Refreshments will be provided at 10:45