Paper 2007/082
Deniable Authentication on the Internet
Shaoquan Jiang
Abstract
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.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unpublished
- Keywords
- Deniable AuthenticationPrivacy
- Contact author(s)
- jiangshq @ math ucalgary ca
- History
- 2007-03-05: received
- Short URL
- https://ia.cr/2007/082
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/082,
author = {Shaoquan Jiang},
title = {Deniable Authentication on the Internet},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/082},
year = {2007},
url = {https://eprint.iacr.org/2007/082}
}
