Welcome to the resource topic for 2019/1017
Title:
The Local Forking Lemma and its Application to Deterministic Encryption
Authors: Mihir Bellare, Wei Dai, 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.
ePrint: https://eprint.iacr.org/2019/1017
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .