Bo Yang;Liquan Chen;Jiaorui Shen;Huaqun Wang;Yang Ma
{"title":"FHE-Based Publicly Verifiable Sealed-Bid Auction Protocol Atop Cross-Blockchain","authors":"Bo Yang;Liquan Chen;Jiaorui Shen;Huaqun Wang;Yang Ma","doi":"10.1109/TNSM.2024.3488090","DOIUrl":null,"url":null,"abstract":"Online auctions, which are widely used on Internet advertising platforms, reduce the participation costs for buyers and sellers, and promote the flow of tens of billions of dollars in the global economy. However, Internet advertising platforms tend to be monopolistic and adopt a sealed bidding model. Therefore, when price is the sole determinant of the winner, how to publicly verify the correctness of auction results without disclosing bidding information has become a challenge. To address these issues, we propose a fully homomorphic encryption (FHE)-based sealed-bid auction protocol with public verifiability atop cross-blockchain. Through an approximate comparison algorithm, the proof of the winner consists of <inline-formula> <tex-math>${m} \\,\\, -1$ </tex-math></inline-formula> (or 1) homomorphic ciphertexts, significantly reducing communication costs, where m represents the number of bidders. Thus, anyone can check the winner’s proof and complete the public verification of correctness. Moreover, this paper designs a cross-blockchain auction system model, breaking the monopoly of platforms, and proposes a distributed private key sharing method, which realizes the auditing function of the relay chain. Finally, we formalize the security model, and verify the correctness, public verifiability and privacy of our scheme. The off-chain time overhead and on-chain gas consumption demonstrate the strong practicability of our protocol in large-scale auctions.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 1","pages":"832-845"},"PeriodicalIF":4.7000,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10738449/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Online auctions, which are widely used on Internet advertising platforms, reduce the participation costs for buyers and sellers, and promote the flow of tens of billions of dollars in the global economy. However, Internet advertising platforms tend to be monopolistic and adopt a sealed bidding model. Therefore, when price is the sole determinant of the winner, how to publicly verify the correctness of auction results without disclosing bidding information has become a challenge. To address these issues, we propose a fully homomorphic encryption (FHE)-based sealed-bid auction protocol with public verifiability atop cross-blockchain. Through an approximate comparison algorithm, the proof of the winner consists of ${m} \,\, -1$ (or 1) homomorphic ciphertexts, significantly reducing communication costs, where m represents the number of bidders. Thus, anyone can check the winner’s proof and complete the public verification of correctness. Moreover, this paper designs a cross-blockchain auction system model, breaking the monopoly of platforms, and proposes a distributed private key sharing method, which realizes the auditing function of the relay chain. Finally, we formalize the security model, and verify the correctness, public verifiability and privacy of our scheme. The off-chain time overhead and on-chain gas consumption demonstrate the strong practicability of our protocol in large-scale auctions.
期刊介绍:
IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.