Design and verification of a secure electronic auction protocol

被引:27
作者
Subramanian, S [1 ]
机构
[1] Ohio State Univ, Dept Comp & Informat Sci, Columbus, OH 43210 USA
来源
SEVENTEENTH IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS | 1998年
关键词
D O I
10.1109/RELDIS.1998.740497
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Auctions are an important and common form of commerce today. A difficult aspect of auctions is that the bidder must be present at the site of the auction. This reduces the appeal of auction and restricts the number of people who would otherwise participate in if. An auction over an electronic network is, therefore, an attractive way of conducting : business. In this paper the author proposes a protocol for electronic auctions. This protocol ensures: (a) anonymity of the customer, (b) security from passive attacks, active attack, message corruption, and loss of messages, (c) customer's privacy, and (d) atomicity (i.e., under all circumstances, the transaction is either completed or aborted). A logic is developed based on the semantics of BAN-style [4] logic. Using this logic, the properties of anonymity, security, privacy, and atomicity are proved for the proposed protocol.
引用
收藏
页码:204 / 210
页数:7
相关论文
共 21 条
[1]  
Anderson R. J., 1994, COMMUNICATIONS ACM, V37
[2]  
BEAM C, 1996, 96WP1016 CITM HAAS S
[3]  
BLEEKER A, 1997, DIMACS WORKSH DES FO
[4]  
BURROWS M, 1990, ACM T COMPUTER SYSTE
[5]  
FRANKLIN MK, 1995, P IEEE S SEC PRIV
[6]  
GABBER E, 1996, 2 USENIX WORKSH EL C
[7]  
GERMEAU F, 1997, DIMACS WORKSH DES FO
[8]  
Gong L., 1990, P IEEE S RES SEC PRI
[9]  
KETCHPEL S, 1995, DAGS9K ELECT PUBLISH
[10]  
KETCHPEL SP, 1996, P 16 ICDCS