Efficient English Auction Scheme without a Secure Channel

Tzong-Chen Wu¹, Tzuoh-Yi Lin¹, Tzong-Sun Wu^2,*, and Han-Yu Lin²

¹Department of Information Management, National Taiwan University of Science and Technology, Taiwan

²Department of Computer Science and Engineering, National Taiwan Ocean University, Taiwan

Abstract: English auctions become tremendously popular on the Internet today. This paper presents a new English auction scheme that can be realized in the public network environments without any additional secure channel. Our scheme not only satisfies security requirements of anonymity, traceability, no framing, fairness, public verifiability, unlinkability among different rounds of auction, and linkability in an auction round, but also provides one-time registration and easy revocation. Furthermore, as compared with the pervious works, the proposed scheme has a better performance in terms of the computation and the size of bidding information.

Keywords: English auction, bilinear pairings, bilinear diffie-hellman problem, hash function.