CANDIDATE MULTILINEAR MAPS FROM IDEAL LATTICES

Speaker: Dr. Shai Halevi , IBM

Date: Friday, January 31, 2014

Time: 10:30 AM to 12:00 PM Note: all times are in the Eastern Time Zone

Public: Yes

Location: 32-D507

Event Type:

Room Description:

Host: Vinod Vaikuntanathan, CIS, TOC, CSAIL, MIT

Contact: Holly A Jones, hjones01@csail.mit.edu

Relevant URL: http://toc.csail.mit.edu/node/453

Speaker URL: None

Speaker Photo:
None

Reminders to: cis-seminars@csail.mit.edu, seminars@lists.csail.mit.edu

Reminder Subject: TALK: CANDIDATE MULTILINEAR MAPS FROM IDEAL LATTICES

Abstract: We describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups. The security of our constructions relies on seemingly hard problems in ideal lattices, which can be viewed as extensions of the assumed hardness of the NTRU function. *Joint work with Sanjam Garg and Craig Gentry

Research Areas:

Impact Areas:

See other events that are part of the Cryptography and Information Security Seminar Seminars Fall 2013 / Spring 2014.

Created by Holly A Jones Email at Wednesday, January 15, 2014 at 4:06 PM.