Efficient identification and signatures for smart cards
CRYPTO '89 Proceedings on Advances in cryptology
Efficient verifiable encryption (and fair exchange) of digital signatures
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A novel deniable authentication protocol using generalized ElGamal signature scheme
Information Sciences: an International Journal
A non-interactive deniable authentication scheme based on designated verifier proofs
Information Sciences: an International Journal
New Approaches for Deniable Authentication
Journal of Cryptology
Asymmetric concurrent signatures
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
New directions in cryptography
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In a deniable authentication protocol, a receiver is convinced that a received message is indeed from a particular sender, but cannot prove this to any third party. Deniable authentication protocols satisfy deniability and intended receiver properties. Among the proposed deniable authentication protocols, non-interactive protocols are more efficient than interactive protocols by reducing communication cost. The Hwang and Ma, and the Hwang and Chao non-interactive protocols provide sender anonymity. Recently some interactive protocols provide confidentiality while no non-interactive protocols do. However, the transferred data may damage sender or receiver anonymity. To provide confidentiality and anonymity efficiently, the first promised signcryption scheme is proposed. Using our promised signcryption scheme, we propose the first efficient non-interactive deniable authentication protocol with confidentiality, sender anonymity, and sender protection.