Paper 2007/082

Deniable Authentication on the Internet

Shaoquan Jiang


Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, we first formalize a natural notion of deniable security and naturally extend the basic authenticator theorem by Bellare et al. \cite{bck98} to the setting of deniable authentication. Of independent interest, this extension is achieved by defining a deniable MT-authenticator via a game. This game is essentially borrowed from the notion of universal composition \cite{can01} although we do not assume any result or background about it. Then we construct two deniable MT-authenticators: uncontrollable random oracle based and the PKI based, both of which are just 3-round protocols. The second construction assumes the receiver owns a secret key. Such a setup assumption is very popular in the real world. (Without this assumption), all the previous protocols do not have a widely satisfiable performance when applied in the Internet-like environment. Finally, as our application, we obtain key exchange protocols that is deniably secure in the real world.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Unpublished
Deniable AuthenticationPrivacy
Contact author(s)
jiangshq @ math ucalgary ca
2007-03-05: received
Short URL
Creative Commons Attribution


      author = {Shaoquan Jiang},
      title = {Deniable Authentication on the Internet},
      howpublished = {Cryptology ePrint Archive, Paper 2007/082},
      year = {2007},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.