A new protocol of dual deniability encryption techniques based on asymmetric secret sharing method / Mohsen Mohamad Hata

Computer networks are ever-changing technologies that embodied secure communication protocol offerings security towards the digital communications. Secure Communication most often uses cryptographic primitives as the methods or techniques to protect the confidentiality of data being communicated. The main components of cryptography are the algorithm and the key management. However, an adversary could use coercion method where both components can no longer be reliable. In a Public Key Infrastructure network, Deniable Encryption techniques have been introduced to achieve incoercible communication. This technique uses Fake Keys and/or Fake Messages to be presented for the Coercer in order to hide the Real Keys and/or Real Messages. For this technique to succeed, the Fake Keys must be indistinguishable from the Real Keys. Past works have proposed numerous techniques of Deniable Encryption in achieving incoercible communication. However they were often easily been compromise if the coercer already suspect Deniable Encryption is applied. For achieving plausible deniability this research proposed a new protocol that embeds two layers of techniques. This new approach of constructing two layers of deniability techniques is done in a manner of defining a protocol to embed and implementing them. The protocol defines the procedures which engage two layers of deniability techniques; namely Secret Sharing and Valid Fake Messages. Secret Sharing technique is used to generate Fake Asymmetric Keys by using LaGrange Polynomial Interpolation formula and RSA algorithm. Secured communication is achieved where the notion of plausible deniability is successfully implemented by fusing the processes of theorem's verification and data's validation in the protocol construction methodology.