An intensive survey of fair non-repudiation protocols

被引:169
作者
Kremer, S
Markowitch, O
Zhou, JY
机构
[1] Free Univ Brussels, B-1050 Brussels, Belgium
[2] Informat Technol Lab, Singapore 119613, Singapore
关键词
network security; security protocols; exchange protocols; non-repudiation;
D O I
10.1016/S0140-3664(02)00049-X
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the phenomenal growth of the Internet and open networks in general, security services, such as non-repudiation, become crucial to many applications. Non-repudiation services must ensure that when Alice sends some information to Bob over a network, neither Alice nor Bob can deny having participated in a part or the whole of this communication. Therefore a fair non-repudiation protocol has to generate nonrepudiation of origin evidences intended to Bob, and non-repudiation of receipt evidences destined to Alice. In this paper, we clearly define the properties a fair non-repudiation protocol must respect, and give a survey of the most important non-repudiation protocols without and with trusted third party (TTP). For the later ones we discuss the evolution of the TTP's involvement and. between others, describe the most recent protocol using a transparent TTP. We also discuss some ad-hoc problems related to the management of non-repudiation evidences. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:1606 / 1621
页数:16
相关论文
共 44 条
[1]  
AKL SG, 1983, COMPUTER, V16, P15, DOI 10.1109/MC.1983.1654294
[2]  
Asokan N, 1998, LECT NOTES COMPUT SC, V1403, P591, DOI 10.1007/BFb0054156
[3]   Asynchronous protocols for optimistic fair exchange [J].
Asokan, N ;
Shoup, V ;
Waidner, M .
1998 IEEE SYMPOSIUM ON SECURITY AND PRIVACY - PROCEEDINGS, 1998, :86-99
[4]  
ASOKAN N, 1997, 4 ACM C COMP COMM SE, V6, P8
[5]  
BAHREMAN A, 1994, S NETW DISTR SYST SE, P3
[6]  
BAO F, 1998, IEEE S SEC PRIV
[7]   A FAIR PROTOCOL FOR SIGNING CONTRACTS [J].
BENOR, M ;
GOLDREICH, O ;
MICALI, S ;
RIVEST, RL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (01) :40-46
[8]   HOW TO EXCHANGE (SECRET) KEYS [J].
BLUM, M .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1983, 1 (02) :175-193
[9]   AUTHENTICATION OF SIGNATURES USING PUBLIC KEY ENCRYPTION [J].
BOOTH, KS .
COMMUNICATIONS OF THE ACM, 1981, 24 (11) :772-774
[10]  
Boyd C, 1998, LECT NOTES COMPUT SC, V1514, P271