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 条
  • [1] Yao A.C., Protocols for secure computations, Proc. of the 23rd IEEE Symp. on Foundations of Computer Science, pp. 160-164, (1982)
  • [2] Freudiger J., Rane S., Brito A.E., Uzun E., Privacy preserving data quality assessment for high-fidelity data sharing, Proc. of the ACM Workshop on Information Sharing & Collaborative Security, pp. 21-29, (2014)
  • [3] Li X.Y., Jung T., Search me if you can: Privacy-Preserving location query service, Proc. of the IEEE INFOCOM 2013, pp. 2760-2768, (2013)
  • [4] Yang J., Zhao J.S., Zhang J.P., A privacy preservation method for high dimension data mining, Acta Electronica Sinica, 41, 11, pp. 2187-2192, (2013)
  • [5] Samanthula B.K., Elmehdwi Y., Howser G., Madria S., A secure data sharing and query processing framework via federation of cloud computing, Information Systems, 48, pp. 196-212, (2015)
  • [6] Kerschbaum F., Privacy-Preserving computation, Proc. of the Annual Privacy Forum, pp. 41-54, (2014)
  • [7] Boneh D., Waters B., Conjunctive, subset, and range queries on encrypted data, Proc. of the Theory of Cryptography, pp. 535-554, (2007)
  • [8] Guo F., Mu Y., Willy S., Subset membership encryption and its applications to oblivious transfer, IEEE Trans. on Information Forensics & Security, 9, 7, pp. 1098-1107, (2014)
  • [9] Sahai A., Waters B., Fuzzy identity-based encryption, Proc. of the Cryptology-EuroCrypt 2005, pp. 457-473, (2005)
  • [10] Li S.D., Si T.G., Dai Y.Q., Secure multi-party computation about set-inclusion graph-inclusion, Journal of Computation Research and Development, 42, 10, (2005)
123