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.
CITATION STYLE
Zhandry, M. (2019). On ELFs, deterministic encryption, and correlated-input security. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11478 LNCS, pp. 3–32). Springer Verlag. https://doi.org/10.1007/978-3-030-17659-4_1
Mendeley helps you to discover research relevant for your work.