Public-Key Encryption Schemes with Auxiliary Inputs. Theory of Cryptography

• Main Authors: Dodis, Yevgeniy (Author), Goldwasser, Shafi (Contributor)
• Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
• Format: Article
• Language: English
• Published: Springer Berlin / Heidelberg, 2012-10-10T19:18:35Z.
• Subjects: Article
• Online Access: Get fulltext

7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings
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 (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.
National Science Foundation (U.S.) (Grant CCF-0514167)
National Science Foundation (U.S.) (Grant CCF-0635297)
National Science Foundation (U.S.) (Grant NSF-0729011)
Israel Science Foundation (700/08)
Chais Family Fellows Program