Public-Key Encryption Schemes with Auxiliary Inputs

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 informationtheoretically). Our schemes are based on the decisional Diffie-Hellman (DDH) and the Learning with Errors (LWE) problems. As an independent technical contribution, we extend the Goldreich-Levin theorem to provide a hard-core (pseudorandom) value over large fields.

• Type: Conference
• Year: 2010
• Where: TCC
• Authors: Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan
• Keywords: Cryptography, Independent Technical Contribution, Secret Key, Secret Key Informationtheoretically, TCC 2010