Secure fuzzy retrieval protocol for multiple datasets

被引:0
作者
Zhou, Jie [1 ]
Deng, Jiao [1 ]
Zeng, Shengke [1 ]
He, Mingxing [1 ,2 ]
Liu, Xingwei
机构
[1] Xihua Univ, Sch Comp & Software Engn, Chengdu 610039, Peoples R China
[2] Gingko Coll Hospitality Management, Dept Informat Engn, Chengdu 611743, Peoples R China
基金
中国国家自然科学基金;
关键词
Secure multi-party computation; Private set intersection; Secure retrieval; Fuzzy retrieval; Data fusion;
D O I
10.1016/j.comnet.2024.110891
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 insecure 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.
引用
收藏
页数:11
相关论文
共 50 条
[41]   A Comparative Study on the Combination of Multiple Retrieval Systems [J].
Liu, Chun Yi ;
Tang, Chuan Yi ;
Hsu, D. Frank .
PROCEEDINGS OF THE 2012 12TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (I-SPAN 2012), 2012, :169-181
[42]   Fuzzy retrieval in case-based decision support systems [J].
Dempe, S ;
Schulz, R .
OR SPEKTRUM, 1998, 20 (03) :189-198
[43]   Improvement of a secure convex hull two-party computation protocol [J].
Wenjie Z. ;
Mingxing H. .
Journal of Convergence Information Technology, 2010, 5 (03) :24-30
[44]   A Private Lookup Protocol with Low Online Complexity for Secure Multiparty Computation [J].
Laud, Peeter .
INFORMATION AND COMMUNICATIONS SECURITY, ICICS 2014, 2015, 8958 :143-157
[45]   Quantum verifiable protocol for secure modulo zero-sum randomness [J].
Masahito Hayashi ;
Takeshi Koshiba .
Quantum Information Processing, 21
[46]   A Generalization of Secure Comparison Protocol with Encrypted Output and Its Efficiency Estimation [J].
Kobayashi, Takumi ;
Hakuta, Keisuke .
PROCEEDINGS OF SIXTH INTERNATIONAL CONGRESS ON INFORMATION AND COMMUNICATION TECHNOLOGY (ICICT 2021), VOL 2, 2022, 236 :377-389
[47]   Research on Protocol of Secure Decision Tree Construction for Arbitrarily Partitioned Data [J].
Liu Wen ;
Luo Shou-shan ;
Wang Yong-bin ;
Jiang Zhen-tao .
2ND INTERNATIONAL SYMPOSIUM ON COMPUTER NETWORK AND MULTIMEDIA TECHNOLOGY (CNMT 2010), VOLS 1 AND 2, 2010, :465-469
[48]   Quantum verifiable protocol for secure modulo zero-sum randomness [J].
Hayashi, Masahito ;
Koshiba, Takeshi .
QUANTUM INFORMATION PROCESSING, 2022, 21 (08)
[49]   Blockchain-Based Fair and Secure Electronic Double Auction Protocol [J].
Liu, Lietong ;
Du, Mingxiao ;
Ma, Xiaofeng .
IEEE INTELLIGENT SYSTEMS, 2020, 35 (03) :31-40
[50]   Secure principal component analysis in multiple distributed nodes [J].
Won, Hee-Sun ;
Kim, Sang-Pil ;
Lee, Sanghun ;
Choi, Mi-Jung ;
Moon, Yang-Sae .
SECURITY AND COMMUNICATION NETWORKS, 2016, 9 (14) :2348-2358