Cryptology ePrint Archive: Report 2008/267

Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

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

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.

Category / Keywords: foundations / deterministic encryption, public key encryption, standard model

Publication Info: A preliminary version to appear at Crypto 2008.

Date: received 11 Jun 2008, last revised 17 Feb 2009

Contact author: tristenp at cs ucsd edu

Available formats: PDF | BibTeX Citation

Note: Revision on Feb 17, 2009 fixes a couple of typos.

Version: 20090217:235832 (All versions of this report)

Discussion forum: Show discussion | Start new discussion