Secure fuzzy retrieval protocol for multiple datasets

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2024-12-01 Epub Date: 2024-11-09 DOI:10.1016/j.comnet.2024.110891
Jie Zhou , Jiao Deng , Shengke Zeng , Mingxing He , Xingwei Liu
{"title":"Secure fuzzy retrieval protocol for multiple datasets","authors":"Jie Zhou ,&nbsp;Jiao Deng ,&nbsp;Shengke Zeng ,&nbsp;Mingxing He ,&nbsp;Xingwei Liu","doi":"10.1016/j.comnet.2024.110891","DOIUrl":null,"url":null,"abstract":"<div><div>With the diversification of data sources and the massive growth of datasets, data retrieval has become increasingly complex and time-consuming. In the traditional retrieval method, if a user wants to query multiple datasets, the general approach is to retrieve them one by one in order, which may lead to duplication of work and waste of resources. Private set intersection is a specific issue in secure multi-party computation. It allows several participants, each holding different sets, to jointly calculate the intersection of their sets without revealing any information other than the intersection. This method is naturally suitable for data fusion. In this work, we propose a secure fuzzy retrieval protocol for multiple datasets. First, we use private set intersection technology to fuse multiple datasets. Then, we perform secure retrieval based on this fused dataset, effectively avoiding the waste of resources caused by separate retrievals, thereby maximizing resource efficiency. It is worth mentioning that the protocol proposed in this paper can also be used for fuzzy retrieval to improve the user’s search experience. More importantly, the protocol can maximize privacy protection during the retrieval process, including strict protection of sensitive information such as retrieval keywords, ensuring that user data and query intentions will not be leaked during the entire retrieval process. Finally, we provide a rigorous security proof and demonstrate the effectiveness of the protocol through simulation experiments.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"255 ","pages":"Article 110891"},"PeriodicalIF":4.6000,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624007230","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/11/9 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

With the diversification of data sources and the massive growth of datasets, data retrieval has become increasingly complex and time-consuming. In the traditional retrieval method, if a user wants to query multiple datasets, the general approach is to retrieve them one by one in order, which may lead to duplication of work and waste of resources. Private set intersection is a specific issue in secure multi-party computation. It allows several participants, each holding different sets, to jointly calculate the intersection of their sets without revealing any information other than the intersection. This method is naturally suitable for data fusion. In this work, we propose a secure fuzzy retrieval protocol for multiple datasets. First, we use private set intersection technology to fuse multiple datasets. Then, we perform secure retrieval based on this fused dataset, effectively avoiding the waste of resources caused by separate retrievals, thereby maximizing resource efficiency. It is worth mentioning that the protocol proposed in this paper can also be used for fuzzy retrieval to improve the user’s search experience. More importantly, the protocol can maximize privacy protection during the retrieval process, including strict protection of sensitive information such as retrieval keywords, ensuring that user data and query intentions will not be leaked during the entire retrieval process. Finally, we provide a rigorous security proof and demonstrate the effectiveness of the protocol through simulation experiments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多数据集安全模糊检索协议
随着数据源的多样化和数据集的大量增加,数据检索变得越来越复杂和耗时。在传统的检索方法中,如果用户要查询多个数据集,一般的做法是按顺序逐个检索,这可能会导致重复劳动和资源浪费。私有集交集是安全多方计算中的一个特殊问题。它允许各自持有不同集合的多个参与者共同计算其集合的交集,而不泄露除交集以外的任何信息。这种方法自然适用于数据融合。在这项工作中,我们提出了一种安全的多数据集模糊检索协议。首先,我们使用私有集相交技术来融合多个数据集。然后,我们基于该融合数据集进行安全检索,有效避免了单独检索造成的资源浪费,从而最大限度地提高了资源效率。值得一提的是,本文提出的协议还可用于模糊检索,以改善用户的搜索体验。更重要的是,该协议可以在检索过程中最大限度地保护隐私,包括严格保护检索关键词等敏感信息,确保用户数据和查询意图在整个检索过程中不会泄露。最后,我们提供了严格的安全证明,并通过模拟实验证明了协议的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
期刊最新文献
A multimodal and perturbation-aware learning approach for robust traffic classification DACC: Discerning and adaptive offloading for coarse-grained content-aware video analytics Preemption-aware online AoI scheduling over two-state Markov channels Secure by design: Merging network and security bootstrapping for IoT systems through NDN Privacy-preserving multi-agent bitrate allocation for 360° video streaming
×
引用
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