Paper 2011/693 Original: eprint.iacr.org/2011/693 ↗
A non-interactive deniable authentication scheme in the standard model
Abstract
Deniable authentication protocols enable a sender to authenticate a message to a receiver such that the receiver is unable to prove the identity of the sender to a third party. In contrast to interactive schemes, non-interactive deniable authentication schemes improve communication efficiency. Currently, several non-interactive deniable authentication schemes have been proposed with provable security in the random oracle model. In this paper, we study the problem of constructing non-interactive deniable authentication scheme secure in the standard model without bilinear groups. An efficient non-interactive deniable authentication scheme is presented by combining the Diffie-Hellman key exchange protocol with authenticated encryption schemes. We prove the security of our scheme by sequences of games and show that the computational cost of our construction can be dramatically reduced by applying pre-computation technique.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2011-12-23: last updated
- 2011-12-23: published
- Short URL
- https://ia.cr/2011/693
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/693,
author = {Bin Wang and Qing Zhao and Ke Dai},
title = {A non-interactive deniable authentication scheme in the standard model},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/693},
year = {2011},
url = {https://eprint.iacr.org/2011/693}
}