基于隐私交集和的交友匹配方案OA
A Friend Matching Scheme Based on Private Intersection Sum
为保证交友匹配过程的公平性、数据安全性以及匹配功能的精确性,提出一种基于隐私交集和的交友匹配方案.在该方案中:双方数据集的元素均具有对应数值,通过哈希函数将数据集元素处理为固定长度,并结合 Diffie-Hellman 密钥交换协议思想进行比较,获取集合交集的基数,从而消除数据集元素对应数值的不对称性,确保交集和计算的公平性;采用同态加密算法处理元素对应数值,实现对数值的隐私保护,从而在保障用户隐私的同时,能够有效地实现交友匹配功能的准确性和安全性.
This article proposes a friend matching scheme based on private intersection sum.The solu-tion is designed to ensure fairness in the friend matching process,data security,and the accuracy of the matching function through private intersection sum technology.In this scheme,elements of both data sets have corresponding values.The data set elements are processed into fixed lengths through the hash func-tion,and compared with the idea of Diffie-Hellman key exchange protocol to obtain the cardinality of the set intersection,thereby eliminating the asymmetry of the corresponding values of the data set elements and ensuring the intersection sum computational fairness.At the same time,the homomorphic encryption al-gorithm is used to process the corresponding values of the elements,achieving privacy protection for the values.This enables the solution to effectively achieve the accuracy and security of the dating matching function while protecting user privacy.
邓娇;周洁;苏代钊
西华大学计算机与软件工程学院,四川 成都 610039西华大学计算机与软件工程学院,四川 成都 610039西华大学计算机与软件工程学院,四川 成都 610039
信息技术与安全科学
隐私交集和同态加密隐私计算交友匹配
private intersection sumhomomorphic encryptionprivacy computingfriend matching
《西华大学学报(自然科学版)》 2026 (2)
84-94,11
国家自然科学基金项目(12401663).
评论