International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

Authors:
Mihir Bellare
Marc Fischlin
Adam O'Neill
Thomas Ristenpart
Download:
URL: http://eprint.iacr.org/2008/267
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2008-17944,
  title={Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles},
  booktitle={IACR Eprint archive},
  keywords={foundations / deterministic encryption, public key encryption, standard model},
  url={http://eprint.iacr.org/2008/267},
  note={A preliminary version to appear at Crypto 2008. tristenp@cs.ucsd.edu 14041 received 11 Jun 2008},
  author={Mihir Bellare and Marc Fischlin and Adam O'Neill and Thomas Ristenpart},
  year=2008
}