FHE-Based Publicly Verifiable Sealed-Bid Auction Protocol Atop Cross-Blockchain

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
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.
在互联网广告平台上广泛应用的在线拍卖,降低了买卖双方的参与成本,促进了全球经济中数百亿美元的流动。然而,互联网广告平台往往具有垄断性,采用密封竞价模式。因此,当价格成为决定胜负的唯一因素时,如何在不泄露竞价信息的情况下公开验证拍卖结果的正确性就成了一个难题。为了解决这些问题,我们提出了一种基于全同态加密(FHE)的密封竞价拍卖协议,该协议具有跨区块链的公开可验证性。通过近似比较算法,获胜者的证明包括 ${m}\,\,-1$(或1)个同态密码文本,大大降低了通信成本,其中m代表投标人的数量。因此,任何人都可以检查获胜者的证明并完成正确性的公开验证。此外,本文还设计了跨区块链拍卖系统模型,打破了平台垄断,并提出了分布式私钥共享方法,实现了中继链的审计功能。最后,我们形式化了安全模型,并验证了我们方案的正确性、公开可验证性和隐私性。链外时间开销和链上气体消耗证明了我们的协议在大规模拍卖中的强大实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信