Affiliation:
1. Institute for Infocomm Research, Singapore
Abstract
In the Internet era electronic commerce is an important and popular industry. Electronic auctions provide a key function in e-commerce, enabling effective and fair distribution of electronic as well as non-electronic goods. Like other fields of e-commerce, e-auctions face serious security threats. Fraud can be committed by bidders or auctioneers. Most popular Internet auctions sites use an open-cry bidding process. This can add excitement to an auction in progress and possibly encourage new bidders to join an auction. However, there are serious difficulties in maintaining the security requirements often required in commercial auctions, particularly in terms of protecting bid confidentiality and bidder privacy. Additionally, some of the current auction techniques are interactive and require many rounds of communication before completion so that more time is required to determine the final winning price. Intensive communication over the insecure Internet is also a problem from the perspective of availability of service and network security. For these reasons most recent research in this area has concentrated on sealed-bid auctions. Sealed-bid auctions are the focus of this chapter. In this chapter, security requirements in e-auction including correctness, fairness, non-repudiation, robustness, public verifiability, bid privacy, and other desired properties like price flexibility and rule flexibility are introduced. The existing approaches to realize them are investigated. The authors show that the key requirement is bid privacy and the main challenge to the design of an e-auction is how to protect bid privacy without compromising other requirements and properties. Techniques to achieve bid privacy are presented in this chapter according to different application environments.
Reference54 articles.
1. Abe, M., & Suzuki, K. (2002). M+1-st price auction using homomorphic encryption. In Proceedings of Public Key Cryptology 2002, (Vol. 2288, pp. 115-124). Berlin, Germany: Springer-Verlag.
2. Aditya, R., Peng, K., Boyd, C., & Dawson, E. (2004). Batch verification for equality of discrete logarithms and threshold decryptions. In Proceedings of the Second Conference of Applied Cryptography and Network Security, ACNS 04, (Vol. 3089, pp. 494-508). Berlin, Germany: Springer-Verlag.
3. Minimal-latency secure function evaluation;D.Beaver;Proceedings of Eurocrypt ’00,2000
4. Fast batch verification for modular exponentiation and digital signatures
5. Cachin, C. (1999). Efficient private bidding and auctions with an oblivious third party. In Proceedings of the 6th ACM Conference on Computer and Communications Security. ACM.