Public-Key Encryption Schemes with Auxiliary Inputs. Theory of Cryptography
Name
Goldwasser-Public-key encryption.pdf
Size
254.15 KB
Format
Adobe PDF
Checksum (MD5)
b307bac00d4f32f007b710b4fcb2bcd2
Author(s)
Dodis, Yevgeniy
Goldwasser, Shafi
Alternative Title
Public-Key Encryption Schemes with Auxiliary Inputs
Date Issued
February 2010
Journal
Theory of Cryptography
Publisher
Springer Berlin / Heidelberg
Citation
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.
Version
Author's final manuscript
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.
Description
7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-11799-2_22
