Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

  • Mihir Bellare
  • Marc Fischlin
  • Adam O’Neill
  • Thomas Ristenpart
Conference paper

DOI: 10.1007/978-3-540-85174-5_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5157)
Cite this paper as:
Bellare M., Fischlin M., O’Neill A., Ristenpart T. (2008) Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. In: Wagner D. (eds) Advances in Cryptology – CRYPTO 2008. CRYPTO 2008. Lecture Notes in Computer Science, vol 5157. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mihir Bellare
    • 1
  • Marc Fischlin
    • 2
  • Adam O’Neill
    • 3
  • Thomas Ristenpart
    • 1
  1. 1.Dept. of Computer Science & EngineeringUniversity of California at San DiegoLa JollaUSA
  2. 2.Dept. of Computer ScienceDarmstadt University of TechnologyDarmstadtGermany
  3. 3.College of ComputingGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations