TY - GEN

T1 - Public-key encryption schemes with auxiliary inputs

AU - Dodis, Yevgeniy

AU - Goldwasser, Shafi

AU - Tauman Kalai, Yael

AU - Peikert, Chris

AU - Vaikuntanathan, Vinod

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77949580684&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77949580684&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-11799-2_22

DO - 10.1007/978-3-642-11799-2_22

M3 - Conference contribution

AN - SCOPUS:77949580684

SN - 3642117988

SN - 9783642117985

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 361

EP - 381

BT - Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings

T2 - 7th Theory of Cryptography Conference, TCC 2010

Y2 - 9 February 2010 through 11 February 2010

ER -