On ELFs, Deterministic Encryption, and Correlated-Input Security

Mark Zhandry

Paper 2019/213

On ELFs, Deterministic Encryption, and Correlated-Input Security

Mark Zhandry

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.

Metadata

Available format(s): PDF
Publication info: Published by the IACR in EUROCRYPT 2019
Keywords: deterministic public key encryption lossy functions
Contact author(s): mzhandry @ princeton edu
History: 2019-02-27: received
Short URL: https://ia.cr/2019/213
License: CC BY

BibTeX

@misc{cryptoeprint:2019/213,
      author = {Mark Zhandry},
      title = {On ELFs, Deterministic Encryption, and Correlated-Input Security},
      howpublished = {Cryptology ePrint Archive, Paper 2019/213},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/213}},
      url = {https://eprint.iacr.org/2019/213}
}