集合相交问题的双方保密计算_李顺东.pdfVIP

40 10 西 安 交 通 大 学 学 报 Vol. 40 10 2006 10 JOU RNAL OF XIAN JIAOTONG U NIV ERSITY Oct. 2006 1 2 3 , , ( 1. , 10087 , ; 2. , 100044, ; 3. , 710049, ) : 用公开密钥加密算法解决了集合相交的多方保密计算问题, 并提出了3 解决方案, 它们均 基于参与保密比较的双方都是半诚实的. 所提方案既可以使双方知道集合的交集, 也可以使双方只 知道交集的势, 而不知道具体的交集, 同时运用模拟范例证明了解决方案的保密性. 该方案适用于 不暴露交集的元素向一方暴露交集的元素向双方暴露交集的元素等3 场合, 且计算复杂度较 低, 可以容易地推广到保密计算的多 个集合相交的问题, 在网络隐私保护方面具有重要的应用价 值. : 多方保密计算; 交集; 保密性 : TN918 : A : 02 3987X( 2006) Secure Two-Party Computation for Set Intersection Problem 1 2 3 Li Shundong , Dou Jiaw ei , Jia Xiaolin ( 1. Department of Com puter Science and T echnology, Beijing Normal U niver sity, Beijing 10087 , China; 2. Foundational Courses Department, Beijing Institute of Civil Engineering and Ar chitecture, Beijing 100044, China; 3. Department of Computer Science and Technology, Xian Jiaotong University, Xian 710049, China) Abstract: Applying public key cryptography to the secure mult-i party computation for set inter- section problem, three solutions are proposed based on the assumption that both parties partici- pating the secure mult-i party computation are sem-i honest. By these solutions, both parties are a- ble to know the intersection set or the cardinality of it w ithout know ing the concrete intersection set. T he privacy preserving property of these solutions is proved by simulation paradigm. These solutions are suitable for the cases in w hich the elements of the intersecti