Cryptology ePrint Archive: Report 2019/1017

The Local Forking Lemma and its Application to Deterministic Encryption

Mihir Bellare and Wei Dai and Lucy Li

Abstract: We bypass impossibility results for the deterministic encryption of public-key-dependent messages, showing that, in this setting, the classical Encrypt-with-Hash scheme provides message-recovery security, across a broad range of message distributions. The proof relies on a new variant of the forking lemma in which the random oracle is reprogrammed on just a single fork point rather than on all points past the fork.

Category / Keywords: public-key cryptography / Deterministic public-key encryption, searchable encryption, forking lemma, random oracle model

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

Date: received 9 Sep 2019, last revised 11 Sep 2019

Contact author: mihir at eng ucsd edu,weidai@eng ucsd edu,lucy@cs cornell edu

Available format(s): PDF | BibTeX Citation

Note: Fixed a undefined reference on page 3.

Version: 20190912:001107 (All versions of this report)

Short URL: ia.cr/2019/1017


[ Cryptology ePrint archive ]