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: Preliminary version in CRYPTO 2008. This is the full version.

Date: received 11 Jun 2008, last revised 1 Jan 2013

Contact author: mihir at eng ucsd edu

Available format(s): PDF | BibTeX Citation

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

Version: 20130102:014502 (All versions of this report)

Short URL: ia.cr/2008/267