Cloak: Hiding Retrieval Information in Blockchain Systems via Distributed Query Requests

IF 5.8 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Services Computing Pub Date : 2024-06-07 DOI:10.1109/TSC.2024.3411450
Jiang Xiao;Jian Chang;Licheng Lin;Binhong Li;Xiaohai Dai;Zehui Xiong;Kim-Kwang Raymond Choo;Keke Gai;Hai Jin
{"title":"Cloak: Hiding Retrieval Information in Blockchain Systems via Distributed Query Requests","authors":"Jiang Xiao;Jian Chang;Licheng Lin;Binhong Li;Xiaohai Dai;Zehui Xiong;Kim-Kwang Raymond Choo;Keke Gai;Hai Jin","doi":"10.1109/TSC.2024.3411450","DOIUrl":null,"url":null,"abstract":"The privacy-preserving query is critical for modern blockchain systems, especially when supporting many crucial applications such as finance and healthcare. Recent advances in blockchain query schemes mainly focus on enhancing the traceability efficiency of integrity authentication. Despite these efforts, we argue that the exposure of retrieval information may result in privacy leakage, which inevitably poses an important yet unresolved challenge. In this paper, we introduce Cloak, a novel privacy-preserving blockchain query scheme with two notable features. First, it utilizes a two-phase distributed query requests technique, i.e., division and aggregation, to hide retrieval information based on the natural independent characteristic of blockchain. Second, we add noise to the sub-request set to avoid malicious attacks during transmission and adopt smart contract-based asymmetric encryption to guarantee the correctness of query results. Experimental results demonstrate that Cloak improves the query performance by up to 4× and reduces the storage overhead by 50% compared with the state-of-the-art Spiral.","PeriodicalId":13255,"journal":{"name":"IEEE Transactions on Services Computing","volume":"17 6","pages":"3213-3226"},"PeriodicalIF":5.8000,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10552108","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Services Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10552108/","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

The privacy-preserving query is critical for modern blockchain systems, especially when supporting many crucial applications such as finance and healthcare. Recent advances in blockchain query schemes mainly focus on enhancing the traceability efficiency of integrity authentication. Despite these efforts, we argue that the exposure of retrieval information may result in privacy leakage, which inevitably poses an important yet unresolved challenge. In this paper, we introduce Cloak, a novel privacy-preserving blockchain query scheme with two notable features. First, it utilizes a two-phase distributed query requests technique, i.e., division and aggregation, to hide retrieval information based on the natural independent characteristic of blockchain. Second, we add noise to the sub-request set to avoid malicious attacks during transmission and adopt smart contract-based asymmetric encryption to guarantee the correctness of query results. Experimental results demonstrate that Cloak improves the query performance by up to 4× and reduces the storage overhead by 50% compared with the state-of-the-art Spiral.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
斗篷:通过分布式查询请求在区块链系统中隐藏检索信息
隐私保护查询对于现代区块链系统至关重要,特别是在支持许多关键应用程序(如金融和医疗保健)时。区块链查询方案的最新进展主要集中在提高完整性认证的可追溯性效率上。尽管有这些努力,我们认为检索信息的暴露可能导致隐私泄露,这不可避免地提出了一个重要但尚未解决的挑战。该文介绍了一种新的隐私保护区块链查询方案Cloak,该方案具有两个显著的特点。首先,利用区块链的自然独立特性,利用分割和聚合两阶段分布式查询请求技术隐藏检索信息。其次,我们在子请求集中加入噪声以避免传输过程中的恶意攻击,并采用基于智能合约的非对称加密来保证查询结果的正确性。实验结果表明,与最先进的螺旋相比,Cloak将查询性能提高了4倍,并将存储开销降低了50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Services Computing
IEEE Transactions on Services Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
11.50
自引率
6.20%
发文量
278
审稿时长
>12 weeks
期刊介绍: IEEE Transactions on Services Computing encompasses the computing and software aspects of the science and technology of services innovation research and development. It places emphasis on algorithmic, mathematical, statistical, and computational methods central to services computing. Topics covered include Service Oriented Architecture, Web Services, Business Process Integration, Solution Performance Management, and Services Operations and Management. The transactions address mathematical foundations, security, privacy, agreement, contract, discovery, negotiation, collaboration, and quality of service for web services. It also covers areas like composite web service creation, business and scientific applications, standards, utility models, business process modeling, integration, collaboration, and more in the realm of Services Computing.
期刊最新文献
AdaFUN: Enhancing Federated Unlearning with Adaptive Local Step in Edge Computing FedAtlas: a Privacy-Enhanced Federated Multi-Task Learning Framework Driven by Semantic Communication for Dual Heterogeneity HSSCOA: Constant-Round Secure Collaborative Analytics on Secret-Shared Database PAHPA: Revolutionizing Kubernetes Autoscaling with Integrated Predictive Analytics and Real-Time Monitoring PrivTI: Efficient End-to-End Privacy-Preserving Inference for Transformer-based Models in MLaaS
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1