| 公平理性委托计算协议 |
| |
| 引用本文： | 尹鑫,田有亮,王海龙. 公平理性委托计算协议[J]. 软件学报, 2018, 29(2): 1953-1962 |
| |
| 作者姓名： | 尹鑫 田有亮 王海龙 |
| |
| 作者单位： | 西安科技大学计算机科学与技术学院, 西安 710054;信息安全国家重点实验室(中国科学院信息工程研究所), 北京 100093,陕西师范大学计算机科学学院, 西安 710062,华南农业大学数学与信息学院, 广州 510642,广西密码学与信息安全重点实验室(桂林电子科技大学), 广西 桂林 541004,西安科技大学计算机科学与技术学院, 西安 710054 |
| |
| 基金项目： | 国家自然科学基金（612724350，61472146）；信息安全国家重点实验室开放课题基金（2016-MS-19）；西安科技大学博士启动基金（2015QDJ008）；广西可信软件重点实验室研究课题资助（kx201614） |
| |
| 摘 要： | 已存在的安全计算集合关系的协议大多基于公钥加密算法，因此很难再嵌入到带有属性关系的公钥加密或密文搜索中.针对该问题，本文给出了非加密方法安全计算集合包含关系和集合交集的2个协议.我们首先利用（n，n）秘密共享的思想分别将原来2个问题转化为集合相等问题.在此基础上，结合离散对数，构造了安全计算集合包含关系的协议1和集合交集的协议2.最后的分析显示：我们的方案没有使用任何公钥加密方法，在保持了较优通信复杂性的同时，便于作为一种子模块嵌入到带有集合操作关系的公钥加密体制或者密文搜索体制中，从而丰富这些方案的功能.
|
| 关 键 词： | 集合包含 集合交集 安全多方计算 秘密共享 |
| 收稿时间： | 2016-10-08 |
| 修稿时间： | 2017-01-05 |
Fair and Rational Delegation Computation Protocol |
| |
| YIN Xin,TIAN You-Liang and WANG Hai-Long. Fair and Rational Delegation Computation Protocol[J]. Journal of Software, 2018, 29(2): 1953-1962 |
| |
| Authors: | YIN Xin TIAN You-Liang WANG Hai-Long |
| |
| Affiliation: | School of Computer Science and Technology, Xi''an University of Science and Technology, Xi''an 710054, China;State Key Laboratory of Information Security (Institute of Information Engineering, Chinese Academy of Sciences), Beijing 100093, China;Guangxi Key Laboratory of Trusted Software (Guilin University of Electronic Technology), Guilin 541004, China,School of Computer Science, Shaanxi Normal University, Xi''an 710062, China,College of Mathematics and Informatics, South China Agricultural University, Guangzhou 510642, China,Guangxi Key Laboratory of Cryptography and Information Security (Guilin University of Electronic Technology), Guilin 541004, China and School of Computer Science and Technology, Xi''an University of Science and Technology, Xi''an 710054, China |
| |
| Abstract: | The most existing protocols for secure computation of set-relationship are based on public-key encryption algorithms, which are hardly embedded into the public encryption or the searchable encryption. Aiming at this problem, we present two protocols for secure computation of set-inclusion and set-intersection with unencrypted method in this paper. We first transform the two original problems into the set-equality problem by using the technique of (n,n) secret sharing and then construct the protocol 1 for secure computation of set-inclusion and the protocol 2 for secure computation of set-intersection combining the discrete logarithms. The final analysis shows that neither of our protocols employs any public-key encryption algorithm. This makes our protocols available for being embedded into the public encryption or the searchable encryption as a building block so as to extend the function of these cryptosystem, meanwhile keeping the communication complexity efficient. |
| |
| Keywords: | set-inclusion set-intersection secure multi-party computation secret sharing |
|
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
