FACT: Sealed-Bid Auction With Full Privacy via Threshold Fully Homomorphic Encryption
IEEE Transactions on Services Computing · 2024-11 · 17 (6) · 3627-3639
DOI: 10.1109/tsc.2024.3439995 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Services Computing, 2024-11. Verfasst von Erjun Zhou und 6 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 37 Literaturangaben. Gefördert von: National Key R&D Program of China, Fundamental Research Funds for the Central Universities, National Natural Science Foundation of China.
Abstract (Originalsprache)
Sealed-bid auction is a common mechanism for selling and buying commodities. However, existing auction schemes to protect bids require at least squared computation and communication complexity for the bidders or rely on trusted auctioneers or third parties. To address the above problems, we propose a secure and efficient sealed-bid auction framework, called FACT. We design a lightweight threshold fully homomorphic encryption scheme as the building block. Our framework does not rely on any trusted auctioneer and fulfills a stronger security guarantee, called full privacy, i.e., only the seller and the winning bidder can determine the auction result. While our framework applies to first-price sealed-bid, it can easily be extended to support second-price sealed-bid (i.e., Vickrey auction) with the same security guaranteed. Our framework also supports the dynamic joining and exiting of sellers and bidders. Meanwhile, our framework reduces the bidders’ overhead and the number of interactions to a constant level. We formally prove the security of our framework in the semi-honest adversary model. We implement FACT and run experiments comparing its performance against existing schemes. We find that our framework not only achieves a stronger security guarantee but also shows significant performance improvement compared to existing schemes.
Förderung
- National Key R&D Program of China
- Fundamental Research Funds for the Central Universities
- National Natural Science Foundation of China
- Key R&D Program of Hubei Province
- Key R&D Program of Shandong Province
- Wuhan Scientific and Technical Key Project
Zitieren
APA
Zhou, E., Chen, J., He, K., Jia, M., Du, R., Wang, M., & Yao, Y. (2024). FACT: Sealed-Bid Auction With Full Privacy via Threshold Fully Homomorphic Encryption. IEEE Transactions on Services Computing, 17(6), 3627-3639. https://doi.org/10.1109/tsc.2024.3439995
Vancouver
Zhou E, Chen J, He K, Jia M, Du R, Wang M, et al. FACT: Sealed-Bid Auction With Full Privacy via Threshold Fully Homomorphic Encryption. IEEE Transactions on Services Computing. 2024;17(6):3627-3639. doi:10.1109/tsc.2024.3439995
BibTeX
@article{Zhou2024,
author = {Zhou, Erjun and Chen, Jing and He, Kun and Jia, Meng and Du, Ruiying and Wang, Mei and Yao, Yunyu},
title = {FACT: Sealed-Bid Auction With Full Privacy via Threshold Fully Homomorphic Encryption},
journal = {IEEE Transactions on Services Computing},
year = {2024},
volume = {17},
number = {6},
pages = {3627--3639},
doi = {10.1109/tsc.2024.3439995}
}
EUVIMED