[Resource Topic] 2019/213: On ELFs, Deterministic Encryption, and Correlated-Input Security

Welcome to the resource topic for 2019/213

On ELFs, Deterministic Encryption, and Correlated-Input Security

Authors: Mark Zhandry


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.

ePrint: https://eprint.iacr.org/2019/213

Talk: https://www.youtube.com/watch?v=KOMZohEuOcs

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .