Paper 2019/1017 Original: eprint.iacr.org/2019/1017 ↗
The Local Forking Lemma and its Application to Deterministic Encryption
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2019-09-12: last updated
- 2019-09-10: published
- Short URL
- https://ia.cr/2019/1017
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2019/1017}
}