The Local Forking Lemma And Its Application To Deterministic Encryption
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2019, PT III(2019)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络