|
|||||
|
|
| 判断集合包含关系的安全计算协议 | |
| 引用本文： | 李荣花,武传坤,张玉清.判断集合包含关系的安全计算协议[J].计算机学报,2009,32(7). |
| 作者姓名： | 李荣花 武传坤 张玉清 |
| 作者单位： | 1. 中国科学院研究生院,北京,100049;国家计算机网络入侵防范中心,北京,100049 2. 中国科学院软件研究所信息安全国家重点实验室,北京,100080 3. 国家计算机网络入侵防范中心,北京,100049 |
| 摘 要： | 研究了安全计算中关于集合的问题:A拥有一个秘密的集合SA,B拥有一个秘密的集合SB(SA和SB来自一个全集),双方希望知道SA是否包含SB,但是不希望泄漏关于集合SA和SB的其它有用信息.针对此问题,提出了3个具有不同效率和安全性的安全计算协议.设集合SB的大小为NB.第1个协议基于叠加密(或者支持门限解密的加法同态加密方案),需要NB轮通信.另外两个协议基于普通的加法同态加密方案,仅需一轮通信.与同类成果比,前两个协议使用了新的集合表示法,第3个协议在输出结果阶段不需要门限解密,通信效率较好. |
| 关 键 词： | 安全计算 集合包含 叠加密 同态加密 |
Secure Computation Protocol for Testing the Inclusion Relation of Sets |
|
| LI Rong-Hua,WU Chuan-Kun,ZHANG Yu-Qing.Secure Computation Protocol for Testing the Inclusion Relation of Sets[J].Chinese Journal of Computers,2009,32(7). | |
| Authors: | LI Rong-Hua WU Chuan-Kun ZHANG Yu-Qing |
| Affiliation: | Graduate University of Chinese Academy of Sciences;Beijing 100049;National Computer Network Intrusion Protection Center;Beijing 100049;State Key Laboratory of Information Security;Institute of Software;Chinese Academy of Sciences;Beijing 100080 |
| Abstract: | A set operation problem is considered in the secure computation setting. Player A has a secret set SA and player B has a secret set SB,where SA and SB belong to a universe. They want to know if SA includes SB without leaking anything else about their secret sets. Three protocols of different levels of security and efficiency are proposed for this problem. The first protocol can be based on the so-called Superposed Encryption scheme or threshold encryption scheme. Let NB be the size of set SB,the first proto... |
| Keywords: | secure computation set-inclusion superposed encryption homomorphic encryption |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |