Non-interactive deniable authentication protocol based on factoring

Authors:
Rongxing Lu;Zhenfu Cao
Affiliations:
Department of Computer Science, Shanghai Jiao Tong University, 1954 Huashang Road, Shanghai 200030, Peoples Republic of China;Department of Computer Science, Shanghai Jiao Tong University, 1954 Huashang Road, Shanghai 200030, Peoples Republic of China
Venue:
Computer Standards & Interfaces
Year:
2005

Citing 3
Cited 4

Concurrent zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract)

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

Robust Deniable Authentication Protocol

Wireless Personal Communications: An International Journal
An efficient non-interactive deniable authentication scheme based on trapdoor commitment schemes

Computer Communications
Non-interactive deniable authentication protocols

Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Cryptanalysis and Improvement of Robust Deniable Authentication Protocol

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deniable authentication protocol is a new cryptographic authentication protocol that enables a specified receiver to identify the source of a given message, but not prove the identity of the sender to a third party. In recent years, many deniable authentication protocols have been proposed. However, most of these proposed schemes are interactive and less efficient. To our knowledge, only Shao has proposed an efficient non-interactive deniable authentication protocol based on generalized ElGamal signature scheme. Therefore, in this paper, we would like to propose another non-interactive deniable authentication protocol based on factoring. What's more, we also prove it is secure in the random oracle model.