# Deniable Encryption with Negligible Detection Probability: An Interactive Construction

@article{Drmuth2011DeniableEW, title={Deniable Encryption with Negligible Detection Probability: An Interactive Construction}, author={Markus D{\"u}rmuth and David Mandell Freeman}, journal={IACR Cryptol. ePrint Arch.}, year={2011}, volume={2011}, pages={66} }

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… Expand

#### Topics from this paper

#### 52 Citations

On Minimal Assumptions for Sender-Deniable Public Key Encryption

- Mathematics, Computer Science
- Public Key Cryptography
- 2014

It is shown that there is no black-box construction of sender-deniable public key encryption with super-polynomial security from simulatable PKE, indicating that improving on the original construction requires the use of non-black-box techniques, stronger assumptions, or interaction, thus giving some evidence that strong assumptions such as those used by Sahai and Waters are necessary. Expand

Deniably Information-Hiding Encryptions Secure against Adaptive Chosen Ciphertext Attack

- Computer Science
- 2012 Fourth International Conference on Intelligent Networking and Collaborative Systems
- 2012

This paper proposes the first DIHE construction with deniability and indistinguishability against adaptive chosen cipher text attack (CCA) which is stronger than the CPA attack. Expand

On the Impossibility of Sender-Deniable Public Key Encryption

- Computer Science
- IACR Cryptol. ePrint Arch.
- 2012

This work investigates the possibility of constructing sender-deniable public key encryption from the primitive of simulatable PKE in a black-box manner and shows that, in fact, there is no black- box construction of senderdeniable encryption with super-polynomial security from simulatablePKE. Expand

Deniable Encryptions Secure against Adaptive Chosen Ciphertext Attack

- Computer Science
- ISPEC
- 2012

This paper introduces some security notions under adaptive chosen ciphertext attack (CCA) and the first sender-deniable construction with deniability and indistinguishability against CCA attack is constructed. Expand

Constructing Practical Public-Key Deniable Encryption

- 2015

The goal of deniable encryption is to protect the privacy of communicated data when the sender or receiver was forced to open the plaintext by a coercer. There does not exist an efficient scheme to… Expand

Bi-Deniable Public-Key Encryption

- Computer Science
- CRYPTO
- 2011

This work constructs bi-deniable public-key cryptosystems, in which both the sender and receiver can simultaneously equivocate, and argues that it is meaningful and useful because it provides credible coercion resistance in certain settings, and suffices for all of the related properties mentioned above. Expand

Lower and Upper Bounds for Deniable Public-Key Encryption

- Computer Science, Mathematics
- ASIACRYPT
- 2011

It is proved that there does not exist any non-interactive receiver-deniable cryptosystem with better than polynomial security, and it is shown that it is impossible to construct a non-Interactive bi-deniability public-key encryption scheme with betterthan-polynomialSecurity. Expand

Deniable Encryption using One Time Pads

- Computer Science
- 2016

This paper tries to propose a deniable encryption mechanism using One Time Pads in such a way that in case the sender and receiver are coerced to release the key to any third party, they can produce a fake message from a given cipher text thus providing complete deniability regarding a given message. Expand

Fully Bideniable Public-Key Encryption

- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2013

This paper shows that fully-deniable schemes in the bideniable case has a aw, and provides a xed scheme, and relies on a deterministic subset matching algorithm that assigns to each nonempty subset of a nite set its proper subset reduced by exactly one element. Expand

How to use indistinguishability obfuscation: deniable encryption, and more

- Computer Science, Mathematics
- IACR Cryptol. ePrint Arch.
- 2013

The 16-year-old open question of Deniable Encryption is resolved by giving the first construction of deniable encryption that does not require any pre-planning by the party that must later issue a denial. Expand

#### References

SHOWING 1-10 OF 31 REFERENCES

Bi-Deniable Public-Key Encryption

- Computer Science
- CRYPTO
- 2011

This work constructs bi-deniable public-key cryptosystems, in which both the sender and receiver can simultaneously equivocate, and argues that it is meaningful and useful because it provides credible coercion resistance in certain settings, and suffices for all of the related properties mentioned above. Expand

Improved Non-committing Encryption with Applications to Adaptively Secure Protocols

- Computer Science
- ASIACRYPT
- 2009

A new construction of non-committing public-key encryption schemes under hardness of factoring and worst-case lattice assumptions is presented, and protocols for multi-party computation secure against a malicious adversary that may adaptively corrupt an arbitrary number of parties under weaker assumptions than were previously known are obtained. Expand

Improved Non-committing Encryption Schemes Based on a General Complexity Assumption

- Computer Science, Mathematics
- CRYPTO
- 2000

A construction of non-committing encryption that can be based on any public-key system which is secure in the ordinary sense and which has an extra property the authors call simulatability is proposed, which generalises an earlier scheme proposed by Beaver based on the Diffie-Hellman problem and proposes another implementation based on RSA. Expand

Deniable Encryption

- Computer Science
- IACR Cryptol. ePrint Arch.
- 1996

Simple constructions that transform sender-deniable schemes into receiver-deniability schemes and vice-versa are described, with respect to schemes that encrypt only one bit at a time. Expand

Probabilistic encryption & how to play mental poker keeping secret all partial information

- Computer Science
- STOC '82
- 1982

This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the… Expand

Trapdoors for hard lattices and new cryptographic constructions

- Computer Science, Mathematics
- IACR Cryptol. ePrint Arch.
- 2007

A new notion of trapdoor function with preimage sampling, simple and efficient "hash-and-sign" digital signature schemes, and identity-based encryption are included. Expand

Adaptively secure multi-party computation

- Computer Science
- STOC '96
- 1996

This work proposes a novel property of encryption protocols and shows that if an encryption protocol enjoying this property is used, instead of a standard encryption scheme, then known constructions become adaptively secure. Expand

Probabilistic Encryption

- Computer Science
- J. Comput. Syst. Sci.
- 1984

It is proved that extracting any information about the cleartext from the cyphertext is hard on the average for an adversary with polynomially bounded computational resources. Expand

Plausible Deniability Using Automated Linguistic Stegonagraphy

- Computer Science
- InfraSec
- 2002

The Nicetext protocol is extended to enable deniable cryptography/ messaging using the concepts of plausible deniability, derived from the fact that even if one is forced to reveal a key to the random string that "nice text" reverts to, the real cryptographic/ plaintext messages may be stored within additional required sources of "randomness" in the extended protocol. Expand

Plug and Play Encryption

- Computer Science
- CRYPTO
- 1997

This high degree of robustness enables larger, multiparty interactions to substitute the authors' protocol for secure private channels in a simple, plug-and-play fashion, without simultaneously limiting security analysis to attacks by static adversaries. Expand