CryptoDB
On ELFs, Deterministic Encryption, and Correlated-Input Security
| Authors: | |
|---|---|
| Download: |
|
| 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. |
Video from EUROCRYPT 2019
BibTeX
@article{eurocrypt-2019-29379,
title={On ELFs, Deterministic Encryption, and Correlated-Input Security},
booktitle={Advances in Cryptology – EUROCRYPT 2019},
series={Advances in Cryptology – EUROCRYPT 2019},
publisher={Springer},
volume={11478},
pages={3-32},
doi={10.1007/978-3-030-17659-4_1},
author={Mark Zhandry},
year=2019
}