[Busec] BUsec this week: Daniele Micciancio (Thurs 11AM)

Sharon Goldberg goldbe at cs.bu.edu
Wed Apr 4 23:06:41 EDT 2012


Hi All,

Reminder for Daniele's talk tomorrow (Thursday) at 11AM in MCS148 at
111 Cummington St. Lunch will be provided and the talk is open to the
public.

See you then!
Sharon

****
https://sites.google.com/site/busecuritygroup/calendar
*****


Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Speaker: Daniele Micciancio (UCSD)
Thursday 11AM, MCS148

Cryptographic constructions based on the hardness of solving
computational problems on  point lattices are among the most prominent
alternatives to traditional cryptography based on integer
factorization and related problems from number theory. A fundamental
operation in most lattice based cryptographic constructions is the
generation of a hard random lattice, together with some trapdoor
information (typically a good lattice basis) for the efficient
solution of the associated hard lattice problems. In this talk we give
new methods for generating and using strong trapdoors in cryptographic
lattices, which are simultaneously simple, efficient, easy to
implement (even in parallel), and asymptotically optimal with very
small hidden constants.  Our methods involve a new kind of trapdoor,
and include specialized algorithms for solving the most important
operations employed in the construction of cryptographic functions.
These tasks were previously the main bottleneck for a wide range of
cryptographic schemes, and our techniques substantially improve upon
the prior ones, both in terms of practical performance and quality of
the produced outputs.

(Joint work with Chris Peikert. To appear in Eurocrypt 2012.)

- Bio sketch: Daniele Micciancio got his  PhD from MIT  in 1998, and
joined the UCSD CSE faculty in 1999. He is the recipient of several
awards, including an NSF CAREER award, Sloan Fellowship and Hellman
Fellowship. He is most known for his research on the complexity of
lattice problems, which spans the whole spectrum from computational
complexity and algorithms, to cryptography. His most notable
achievements include the first significant inapproximability result
for the Shortest Vector Problem, pioneering the use of cyclic and
ideal lattices in cryptographic constructions based on worst-case
complexity assumptions, and the discovery of the asymptotically
fastest known  algorithms to solve all the most important
computational problems on point lattices.



More information about the Busec mailing list