Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

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

  • Affiliations:
  • Dept. of Computer Science & Engineering, University of California at San Diego, La Jolla, USA CA 92093-0404;Dept. of Computer Science, Darmstadt University of Technology, Darmstadt, Germany 64289;College of Computing, Georgia Institute of Technology, Atlanta, USA GA 30332;Dept. of Computer Science & Engineering, University of California at San Diego, La Jolla, USA CA 92093-0404

  • Venue:
  • CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.