International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: The Local Forking Lemma and Its Application to Deterministic Encryption

Authors:
Mihir Bellare
Wei Dai
Lucy Li
Download:
DOI: 10.1007/978-3-030-34618-8_21
Search ePrint
Search Google
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.
BibTeX
@article{asiacrypt-2019-30075,
  title={The Local Forking Lemma and Its Application to Deterministic Encryption},
  booktitle={Advances in Cryptology – ASIACRYPT 2019},
  series={Advances in Cryptology – ASIACRYPT 2019},
  publisher={Springer},
  volume={11923},
  pages={607-636},
  doi={10.1007/978-3-030-34618-8_21},
  author={Mihir Bellare and Wei Dai and Lucy Li},
  year=2019
}