Cryptology ePrint Archive: Report 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.

Category / Keywords: deterministic public key encryption, lossy functions

Original Publication (in the same form): IACR-EUROCRYPT-2019

Date: received 23 Feb 2019

Contact author: mzhandry at princeton edu

Available format(s): PDF | BibTeX Citation

Version: 20190227:030218 (All versions of this report)

Short URL: ia.cr/2019/213


[ Cryptology ePrint archive ]