密码学报（中英文）2024，Vol.11Issue(5)：1029-1043,15.DOI:10.13868/j.cnki.jcr.000724
集合相似问题的保密计算
A Secure Computing Protocol for Set Similarity Problems
摘要
Abstract
The secure computation of set similarity is one of the common problems in secure multi-party computation,which can be used in various applications such as data matching,information retrieval,pattern recognition,etc.This paper utilizes encryption selection and the homomorphism of Paillier cryptosystem when the range of set elements is known,and designs a secure protocol for computing the most similar set when the set similarity value is in ciphertext.Then,using random numbers to confuse real data,and using the homomorphism of Paillier cryptosystem,a confidentiality computation protocol for similarity threshold set is designed.The protocol in this paper is based on homomorphic encryption rather than building a B+tree,so that it solves the problem existing in most literatures that inserting new data will lead to changes in the structure of the tree and cannot protect the number of new data.Meanwhile,the security of the protocol is strictly demonstrated by using simulation paradigm.Finally,based on the secure computation of the most similar sets,the problem of database secure search for the most similar documents is solved.Compared with existing schemes,this protocol is more efficient.关键词
密码学/安全多方计算/集合相似性/同态加密/模拟范例Key words
cryptography/secure multi-party computation/set similarity/homomorphic encryption/simulation paradigm分类
信息技术与安全科学引用本文复制引用
马秀莲,段雨薇,李顺东..集合相似问题的保密计算[J].密码学报（中英文）,2024,11(5):1029-1043,15.基金项目
国家重点研发计划(2022YFB2703001)National Key Research and Development Program of China(2022YFB2703001) （2022YFB2703001）
