Paper 2019/1017

The Local Forking Lemma and its Application to Deterministic Encryption

Mihir Bellare, 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.

Note: Fixed a undefined reference on page 3.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published by the IACR in ASIACRYPT 2019
Keywords
Deterministic public-key encryptionsearchable encryptionforking lemmarandom oracle model
Contact author(s)
mihir @ eng ucsd edu
weidai @ eng ucsd edu
lucy @ cs cornell edu
History
2019-09-12: revised
2019-09-10: received
See all versions
Short URL
https://ia.cr/2019/1017
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/1017,
      author = {Mihir Bellare and Wei Dai and Lucy Li},
      title = {The Local Forking Lemma and its Application to Deterministic Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1017},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/1017}},
      url = {https://eprint.iacr.org/2019/1017}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.