Summary: | 碩士 === 銘傳大學 === 資訊管理研究所 === 87 === A new protocol for the auction problem in electronic commerce is proposed. In 1996, Franklin and Reiter propose a sealed-bidding process for the auction problem. The bidder can secretly send a bid to center during a pre-defined period, after which one who bids the most high price is declared to be the winner. Since bidding secretly is important to the proper operation of the process, the security problem has been seriously studied.
In this paper, we modify their protocol into the competitive-auction protocol, which is close the real-world auction. In our protocol, the bidder bids a price to the center in a pre-defined period, during which another one who bids a higher price becomes a new winner. Hence, the winner is updated and the price arises, and new results are broadcast to every bidder. A temporary winner becomes the final winner, if the results are reported to every bidder three times, without receiving new bids with higher price.
We propose a new protocol, design the protocol using the Extended Finite State Machine model, and analyze the protocol using the interoperability testing techniques. Unlike Franklin and Reiter''s process where the bids must be kept secret, bidding price needs to be opened to every bidder in our protocol, and hence the security analysis is out of our research scope.
|