Public key Encryption Schemes with Auxiliary Input
Speaker: Vinod Vaikuntanathan , IBM TJ Watson
Date: November 20 2009
Time: 10:30AM to 12:00PM
Contact: Be, 3-6098, email@example.com
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one that may reveal the secret key information-theoretically). Our schemes are based on the decisional Diffie-Hellman and Learning with Errors problems.
Our technical contributions include:
* a novel extension of the Goldreich-Levin theorem to provide a hard-core (pseudorandom) value over large fields, and
* a proof that the learning with errors assumption holds even in the presence of auxiliary information about the secrets.
Joint work with Yevgeniy Dodis, Shafi Goldwasser, Yael Kalai and Chris Peikert.
See other events that are part of CIS/Microsoft Seminars 2009/2010
See other events happening in November 2009