[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13]

Journal of Information Science and Engineering, Vol. 37 No. 3, pp. 635-652

Efficient First-Price Sealed-Bid Auction Scheme

1School of Telecommunication Engineering
2School of Cyber Engineering
Xidian University
Xi'an, 710071 P.R. China

3State Key Laboratory of Cryptology
P. O. Box 5159, Beijing, 100878 P.R. China

4School of Science
Hangzhou Normal University
Hangzhou, 311121 P.R. China
E-mail: mengqian@stu.xidian.edu.cn; jfma@mail.xidian.edu.cn; kfchen@hznu.edu.cn;
ybmiao@xidian.edu.cn; yangtf@stu.xidian.edu.cn

Electronic auction has opened up a popular research topic in electronic commerce over the past few years. It can be widely utilized in various circumstances, as it provides a flexible way to improve the transaction rate and save the costs. Despite its advantages in transactions, current electronic auction protocols incur high communication rounds as well as storage and computational overhead among auctioneer(s) and multiple bidders, especially for resource-limited devices. In this paper, by leveraging Short Comparable Encryption scheme based on SlidingWindow method (SCESW) and multilinear maps, we construct an Efficient First-price Sealed-bid Auction scheme (EFSA) to address the aforementioned problem. The novelty lies in that we provide a more efficient construction in electronic auction system, which just needs one round communication and drastically decreases the computational and storage costs in the bidder side when compared with existing schemes. The formal security analysis proves that EFSA scheme can achieve weak indistinguishability in standard model. Moreover, simulation results show that EFSA scheme is efficient and feasible in practice.

Keywords: comparable encryption, sliding window method, auction system, efficient first-price sealed-bid auction, weak indistinguishability

  Retrieve PDF document (JISE_202103_09.pdf)