集合之间基本操作的保密计算协议  

Private-preserving Computational Protocol of Basic Operation Between Sets

作　　者：王 罗文俊[2] 

机构地区：[1]山西职业技术学院,山西太原030006 [2]重庆邮电大学计算机科学与技术学院,重庆400065

出　　处：《计算机安全》2014年第2期2-6,共5页Network & Computer Security

基　　金：国家自然科学基金资助项目(No.60963023);重庆市自然科学基金资助项目(No.2010BB2402)

摘　　要：保密集合操作是特殊安全多方计算中的一个重要研究内容。考虑了集合操作问题的保密计算,基于一些基础的密码学方案和协议为集合相交、集合相并、集合包含这几个基本的集合操作问题提出了相应的保密计算协议,并对其性能做了分析与讨论。它们作为重要的密码学基本协议对解决保密计算几何,保密数据挖掘等其他相关安全多方计算问题有着重要的应用价值。Private-preserving set operation is an important topic of specific secure multi-party computation. In this paper, we consider the private-preserving computation of set operation problems and propose relevant privacy-preserving computational protocol based on some basic cryptographic schemes and protocols for several basic set operation problems, set intersection, set union, set inclusion, analyzing and discussing the capability of these protocols. As the fundamental cryptographic building blocks, these protocols have important applications in the solution of privacy-preserving computational geometric and privacy-preserving data mining as well as other correlative secure multiparty computation problems.

关 键 词：安全多方计算 集合操作 同态加密 可交换加密 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]