To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1b539| Abstract: | We construct deterministic public key encryption secure for any constant number of arbitrarily correlated computationally unpredictable messages. Prior works required either random oracles or non-standard knowledge assumptions. In contrast, our constructions are based on the exponential hardness of DDH, which is plausible in elliptic curve groups. Our central tool is a new trapdoored extremely lossy function, which modifies extremely lossy functions by adding a trapdoor. |
| Publication Date: | 2019 |
| Citation: | Zhandry, Mark. "On ELFs, Deterministic Encryption, and Correlated-Input Security." In Annual International Conference on the Theory and Applications of Cryptographic Techniques (2019): pp. 3-32. doi:10.1007/978-3-030-17659-4_1 |
| DOI: | 10.1007/978-3-030-17659-4_1 |
| ISSN: | 0302-9743 |
| EISSN: | 1611-3349 |
| Pages: | 3 - 32 |
| Type of Material: | Conference Article |
| Journal/Proceeding Title: | Annual International Conference on the Theory and Applications of Cryptographic Techniques |
| Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.