Deniable Encryption using One Time Pads

Deniable Encryption allows a sender and receiver having already performed some encrypted communication, to produce a fake message from the cipher text, when coerced by any third party hence tricking the coercer to believing it to be legit, keeping the real message private. The main goal of deniable encryption is to ensure that the deniability of sender and receiver remains intact even after interception of the message by an adversary, thus providing an inherent utility to resist the coercion in an indirect way. In this paper we try 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, moreover the design using one time pad ensures that the privacy of the original message in not compromised due to the generation of the fake message.

[1]  Bo Meng,et al.  An Efficient Receiver Deniable Encryption Scheme and Its Applications , 2010, J. Networks.

[2]  Markus Dürmuth,et al.  Deniable Encryption with Negligible Detection Probability: An Interactive Construction , 2011, EUROCRYPT.

[3]  Marek Klonowski,et al.  Practical Deniable Encryption , 2008, SOFSEM.

[4]  Shin-Jia Hwang,et al.  Confidential deniable authentication using promised signcryption , 2011, J. Syst. Softw..

[5]  Salil P. Vadhan,et al.  Theory of Cryptography , 2016, Lecture Notes in Computer Science.

[6]  Saikat Basu,et al.  Sender-Side Public Key Deniable Encryption Scheme , 2009, 2009 International Conference on Advances in Recent Technologies in Communication and Computing.

[7]  Bo Meng,et al.  A Receiver Deniable Encryption Scheme , 2009 .

[8]  Frank Rubin,et al.  One-Time Pad Cryptography , 1996, Cryptologia.

[9]  Burton S. Kaliski.  Advances in Cryptology - CRYPTO '97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, Proceedings , 1997, CRYPTO 1997.

[10]  Dongqing Xie,et al.  Deniable Encryptions Secure against Adaptive Chosen Ciphertext Attack , 2012, ISPEC.

[11]  Claudio Orlandi,et al.  Lower and Upper Bounds for Deniable Public-Key Encryption , 2011, ASIACRYPT.

[12]  Maged Hamada Ibrahim,et al.  A Method for Obtaining Deniable Public-Key Encryption , 2009, Int. J. Netw. Secur..

[13]  A. N. Berezin,et al.  Stream deniable-encryption computationally indistinguishable from probabilistic ciphering , 2015, 2015 XVIII International Conference on Soft Computing and Measurements (SCM).

[14]  Dongqing Xie,et al.  Deniably Information-Hiding Encryptions Secure against Adaptive Chosen Ciphertext Attack , 2012, 2012 Fourth International Conference on Intelligent Networking and Collaborative Systems.

[15]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[16]  Brent Waters,et al.  Bi-Deniable Public-Key Encryption , 2011, CRYPTO.

[17]  Xiaotie Deng,et al.  Deniable authentication protocols , 2001 .

[18]  Yonatan Aumann,et al.  Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract) , 1998, CRYPTO.

[19]  Rafael Pass,et al.  On Constant-Round Concurrent Zero-Knowledge , 2008, TCC.

[20]  Hugo Krawczyk.  Advances in Cryptology - CRYPTO '98, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998, Proceedings , 1998, CRYPTO.

[21]  Phillip Rogaway.  Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings , 2011, CRYPTO.

[22]  Ran Canetti.  Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008 , 2008, TCC.