DocumentCode
1498101
Title
Deniable authentication protocols
Author
Deng, X. ; Lee, C.H. ; Zhu, H.
Author_Institution
Dept. of Comput. Sci., City Univ. of Hong Kong, China
Volume
148
Issue
2
fYear
2001
fDate
3/1/2001 12:00:00 AM
Firstpage
101
Lastpage
104
Abstract
Two deniable authentication schemes have been developed. One is based on the intractability of the factoring problem, and the other is based on the intractability of the discrete logarithm problem. The computation cost of the first scheme is about (t+2)/2s. The second scheme requires about (2t+3)/4s of a previous scheme; s is the length of a message block and t is the cost of multiplication mod N operations. It is shown that both protocols reserve all cryptographic characterisations of the previous scheme
Keywords
message authentication; protocols; computation cost; deniable authentication protocols; discrete logarithm problem; factoring problem; intractability; message block;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings -
Publisher
iet
ISSN
1350-2387
Type
jour
DOI
10.1049/ip-cdt:20010207
Filename
926406
Link To Document