Public-Key Encryption Schemes with Auxiliary Inputs. Theory of Cryptography
Author(s)Dodis, Yevgeniy; Goldwasser, Shafi
Public-Key Encryption Schemes with Auxiliary Inputs
MetadataShow full item record
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.
7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Theory of Cryptography
Springer Berlin / Heidelberg
Dodis, Yevgeniy et al. “Public-Key Encryption Schemes with Auxiliary Inputs.” Theory of Cryptography. Ed. Daniele Micciancio. LNCS Vol. 5978. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. 361–381.
Author's final manuscript