[Resource Topic] 2008/267: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

Welcome to the resource topic for 2008/267

Title:
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

Authors: Mihir Bellare, Marc Fischlin, Adam O'Neill, Thomas Ristenpart

Abstract:

We strengthen the foundations of deterministic public-key encryption via definitional equivalences and standard-model constructs based on general assumptions. Specifically we consider seven notions of privacy for deterministic encryption, including six forms of semantic security and an indistinguishability notion, and show them all equivalent. We then present a deterministic scheme for the secure encryption of uniformly and independently distributed messages based solely on the existence of trapdoor one-way permutations. We show a generalization of the construction that allows secure deterministic encryption of independent high-entropy messages. Finally we show relations between deterministic and standard (randomized) encryption.

ePrint: https://eprint.iacr.org/2008/267

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 .