Non-interactive deniable authentication protocol based on factoring

被引：28

作者：

Lu, RX ^{[1
]}

Cao, ZF ^{[1
]}

机构：

[1] Shanghai Jiao Tong Univ, Dept Comp Sci, Shanghai 200030, Peoples R China

来源：

COMPUTER STANDARDS & INTERFACES | 2005年 / 27卷 / 04期

基金：

高等学校博士学科点专项科研基金; 中国国家自然科学基金;

关键词：

cryptography; deniable authentication; factoring;

D O I：

10.1016/j.csi.2004.09.007

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. (c) 2004 Elsevier B.V All rights reserved.

引用

页码：401 / 405

页数：5

共 8 条

[1]

Aumann Y, 1998, LECT NOTES COMPUT SC, V1462, P299, DOI 10.1007/BFb0055736

[2]

Aumann Y., 1998, INT C THEOR COMP SCI

[3] Deniable authentication protocols [J].

Deng, X ;

Lee, CH ;

Zhu, H .

IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2001, 148 (02) :101-104

[4]

Dwork C., 1998, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, P409, DOI 10.1145/276698.276853

[5] Deniable authentication protocol based on Deffie-Hellman algorithm [J].

Fan, L ;

Xu, CX ;

Li, JH .

ELECTRONICS LETTERS, 2002, 38 (14) :705-706

[6]

LU R, IN PRESS COMPUTER ST

[7]

Rabin M.O., 1979, DIGITALIZED SIGNATUR

[8] Efficient deniable authentication protocol based on generalized ElGamal signature scheme [J].

Shao, ZH .

COMPUTER STANDARDS & INTERFACES, 2004, 26 (05) :449-454

← 1 →