Chapter

Advances in Cryptology – CRYPTO 2008

Volume 5157 of the series Lecture Notes in Computer Science pp 360-378

Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

  • Mihir BellareAffiliated withDept. of Computer Science & Engineering, University of California at San Diego
  • , Marc FischlinAffiliated withDept. of Computer Science, Darmstadt University of Technology
  • , Adam O’NeillAffiliated withCollege of Computing, Georgia Institute of Technology
  • , Thomas RistenpartAffiliated withDept. of Computer Science & Engineering, University of California at San Diego

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.