The Research for Secure and Fair On-line Auctions

• Main Authors: Lin Po-Chou, 林柏舟
• Other Authors: Juang Wen-Shenq
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/4k863w

碩士 === 世新大學 === 資訊管理學系 === 90 === The Internet and wireless communications are growing exponentially recently. The plentiful and varied contents of the web sites, the diversified and popular Internet services are expanded speedily. The progress of the computer and Internet technology influences and changes everyone''s life and habits. From the Forrester Research, the amount of money in the B2B electronic commerce will be 2.7 billion dollars in 2004, and it enlarges unceasingly. Electronic markets will be the motive for fast growth of B2B electronic commerce. Among various services in electronic markets, on-line auctions are growing quickly and they will play an important role in electronic commerce. The purpose of this research is to design a secure and fair on-line auction scheme by cryptography mechanisms. Our proposed scheme can resolve the security problems in Internet environments and make the on-line auctions become a complete, secure, fair and available model for commercial transactions. From the literature, we discover that many on-line auction schemes need one or more trusted third parties. They store the identifications of bidders, keep the confidentiality of bid prices, or are the arbitrators in auctions. We find out that if the trusted third party with too much power is not trustworthy, he would make the auction unfair. It is hard to find that kind of trusted third party in real world environments. In our thesis, we propose a secure and fair on-line auction scheme. We use secret sharing without a mutually trusted authority, and get rid of the trusted third party in our proposed scheme. By using the mechanisms of fair blind signatures and verifiable secret sharing, our proposed on-line auction scheme is really fair, just and secure.