Deniable Encryption with Negligible Detection Probability: An Interactive Construction

  • Markus Dürmuth
  • David Mandell Freeman
Conference paper

DOI: 10.1007/978-3-642-20465-4_33

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6632)
Cite this paper as:
Dürmuth M., Freeman D.M. (2011) Deniable Encryption with Negligible Detection Probability: An Interactive Construction. In: Paterson K.G. (eds) Advances in Cryptology – EUROCRYPT 2011. EUROCRYPT 2011. Lecture Notes in Computer Science, vol 6632. Springer, Berlin, Heidelberg

Abstract

Deniable encryption, introduced in 1997 by Canetti, Dwork, Naor, and Ostrovsky, guarantees that the sender or the receiver of a secret message is able to “fake” the message encrypted in a specific ciphertext in the presence of a coercing adversary, without the adversary detecting that he was not given the real message. To date, constructions are only known either for weakened variants with separate “honest” and “dishonest” encryption algorithms, or for single-algorithm schemes with non-negligible detection probability.

We propose the first sender-deniable public key encryption system with a single encryption algorithm and negligible detection probability. We describe a generic interactive construction based on a public key bit encryption scheme that has certain properties, and we give two examples of encryption schemes with these properties, one based on the quadratic residuosity assumption and the other on trapdoor permutations.

Keywords

Deniable encryption electronic voting multi-party computation 

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Markus Dürmuth
    • 1
  • David Mandell Freeman
    • 2
  1. 1.Ruhr-UniversityBochumGermany
  2. 2.Stanford UniversityUSA

Personalised recommendations