Paper 2008/267

Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

Mihir Bellare, Marc Fischlin, Adam O'Neill, and Thomas Ristenpart


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.

Note: Fixed some errata. (Thanks to Kirill Morozov for pointing them out.)

Available format(s)
Publication info
Published elsewhere. Preliminary version in CRYPTO 2008. This is the full version.
deterministic encryptionpublic key encryptionstandard model
Contact author(s)
mihir @ eng ucsd edu
2013-01-02: last of 5 revisions
2008-06-18: received
See all versions
Short URL
Creative Commons Attribution


      author = {Mihir Bellare and Marc Fischlin and Adam O'Neill and Thomas Ristenpart},
      title = {Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles},
      howpublished = {Cryptology ePrint Archive, Paper 2008/267},
      year = {2008},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.