Secure Computation of Two Set-Relationships with the Unencrypted Method

被引：0
作者：
Chen Z.-H. [1 ,2 ,3 ]
Li S.-D. [4 ]
Huang Q. [5 ]
Ding Y. [6 ]
Liu Y.-R. [1 ]
机构：
[1] School of Computer Science and Technology, Xi'an University of Science and Technology, Xi'an
[2] State Key Laboratory of Information Security, Institute of Information Engineering, The Chinese Academy of Sciences, Beijing
[3] Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin
[4] School of Computer Science, Shaanxi Normal University, Xi'an
[5] College of Mathematics and Informatics, South China Agricultural University, Guangzhou
[6] Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, Guilin
来源：
Chen, Zhen-Hua (chenzhenhua@snnu.edu.cn) | 2018年 / Chinese Academy of Sciences卷 / 29期
基金：
中国国家自然科学基金;
关键词：
Secret sharing; Secure multi-party computation; Set-inclusion; Set-intersection;
D O I：
10.13328/j.cnki.jos.005262
中图分类号：
学科分类号：
摘要：
Most of existing protocols for secure computation of set-relationship are based on public-key encryption algorithms, and therefore can hardly be embedded into the public encryption or the searchable encryption. To address this problem, two protocols are presented in this paper for secure computation of set-inclusion and set-intersection with unencrypted method. First, the two original problems are transformed into the set-equality problem by using the technique of (n, n) secret sharing. Then, using discrete logarithms, the Protocol 1 is constructed for secure computation of set-inclusion, and the Protocol 2 is constructed for secure computation of set-intersection. The final analysis shows that neither of the proposed protocols employs any public-key encryption algorithm. This makes the two protocols available for being embedded into the public encryption or the searchable encryption as a building block, which can extend the function of these cryptosystem while keeping the communication complexity efficient. © Copyright 2018, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：473 / 482
页数：9
相关论文
共 21 条
  • [11] Li R.H., Wu C.K., Zhang Y.Q., Secure computation protocols for testing the inclusion relation of sets, Chinese Journal of Computers, 32, 7, pp. 1337-1346, (2009)
  • [12] Freedman M.J., Nissim K., Pinkas B., Efficient private matching and set intersection, Proc. of the EuroCrypt 2004, pp. 1-19, (2004)
  • [13] Paillier P., Public-Key cryptosystems based on composite degree residue classes, Proc. of the EuroCrypt'99, pp. 223-238, (1999)
  • [14] Xia F., Yang B., Zhang M., Ma S., Lei T., Secure two-party computation for set intersection and set equality problems based on LWE, Journal of Electronics & Information Technology, 34, 2, pp. 462-467, (2012)
  • [15] Kissner L., Song D., Privacy-Preserving set operations, Proc. of the Crypt 2005, pp. 241-257, (2005)
  • [16] Li S.D., Zhou S.F., Guo Y.M., Dou J.W., Wang D.S., Secure set computing on cloud computing, Ruan Jian Xue Bao/Journal of Software, 27, 6, (2016)
  • [17] Elgamal T., A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. on Information Theory, 31, 4, pp. 469-472, (1985)
  • [18] Goldwasser S., Micali S., Probabilistic encryption, Journal of Computer and Systems Science, 28, 2, pp. 270-299, (1984)
  • [19] Shamir A., How to share a secret, Communications of the ACM, 22, 11, pp. 612-613, (1979)
  • [20] Goldreich O., Foundations of Cryptography: Baisc Applications, 2, pp. 599-729, (2004)
123