DocumentCode :
2638246
Title :
Distributed auction servers resolving winner and winning bid without revealing privacy of bids
Author :
Kikuchi, Hiroaki ; Hotta, Shinji ; Abe, Kensuke ; Nakanishi, Shohachiro
Author_Institution :
Fac. of Eng., Tokai Univ., Kanagawa, Japan
fYear :
2000
fDate :
36800
Firstpage :
307
Lastpage :
312
Abstract :
We have developed an electronic auction system with a set of distributed servers that collaborate to resolve a winning bid without revealing the secrecy of bids. This paper describes the system architecture and shows the performance in terms of the round complexity and the bandwidth consumption for a message. Based on the actual measurements, the upper bound of number of bidding prices is identified. In addition, by adding some steps to the basic auction protocol in Kikuchi, Harkavy, and Tygar, 1998, we improve the security of protocol so that the second highest bid must not be known even by the winner
Keywords :
client-server systems; protocols; security of data; bandwidth consumption; distributed servers; electronic auction system; privacy of bids; round complexity; security of protocol; system architecture; Access protocols; Airplanes; Bandwidth; Collaboration; Costs; Internet; Privacy; Security; Upper bound; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Systems: Workshops, Seventh International Conference on, 2000
Conference_Location :
Iwate
Print_ISBN :
0-7695-0571-6
Type :
conf
DOI :
10.1109/PADSW.2000.884610
Filename :
884610
Link To Document :
بازگشت