Public-key encryption schemes with auxiliary inputs
Theory of Cryptography: 7th Theory of Cryptography Conference, TCC 2010 …, 2010•Springer
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.
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.
Abstract
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.
Springer