西华大学学报（自然科学版）2026，Vol.45Issue(2)：84-94,11.DOI:10.12198/j.issn.1673-159X.5555
基于隐私交集和的交友匹配方案
A Friend Matching Scheme Based on Private Intersection Sum
摘要
Abstract
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.关键词
隐私交集和/同态加密/隐私计算/交友匹配Key words
private intersection sum/homomorphic encryption/privacy computing/friend matching分类
信息技术与安全科学引用本文复制引用
邓娇,周洁,苏代钊..基于隐私交集和的交友匹配方案[J].西华大学学报（自然科学版）,2026,45(2):84-94,11.基金项目
国家自然科学基金项目(12401663). （12401663）
