Survey of Privacy Preserving Oriented Set Intersection Computation

被引:0
作者
Wei L. [1 ]
Liu J. [1 ]
Zhang L. [1 ]
Wang Q. [1 ]
He C. [1 ]
机构
[1] College of Information Technology, Shanghai Ocean University, Shanghai
来源
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2022年 / 59卷 / 08期
基金
中国国家自然科学基金; 上海市自然科学基金;
关键词
Garbled circuit; Oblivious transfer; Privacy preserving; Private set intersection; Secure multiparty computation (MPC);
D O I
10.7544/issn1000-1239.20210685
中图分类号
学科分类号
摘要
With the development of Internet of things and big data technology, increasing distributed applications are booming in the personal computers and mobile phones. However, the existing distributed data processing methods have not met the needs of privacy protection. As a typical privacy-preserving technology for distributed set computation, private set intersection (PSI) protocols allow the participants to input individual sets and jointly calculate the intersection of these sets without disclosing any information except the intersection. As an important application of secure multiparty computation, PSI protocols have been widely used in privacy-preserving computation, which has theoretical and practical significance. Many PSI protocols have been emerged, but due to the lack of related surveys on PSI, we have written this paper. This paper introduces the fundamentals of PSI protocols such as the cryptographic technology, adversary model, security proof and implementation framework. And then the paper systematically summarizes the cryptographic framework of traditional PSI protocol from three aspects: the framework based on public key cryptosystem, garbled circuit, and oblivious transfer. Some of the key technologies in the set element comparison are introduced such as oblivious pseudo-random function, oblivious polynomial evaluation, and Bloom filter. Furthermore, a few of emerging PSI application scenarios are described in detail such as cloud-based PSI, unbalanced PSI, threshold PSI, and multiparty PSI. Finally, the paper summarizes the problems to be solved and prospects some possible development directions of PSI. © 2022, Science Press. All right reserved.
引用
收藏
页码:1782 / 1799
页数:17
相关论文
共 110 条
[1]  
Yao A C., Protocols for secure computations, Proc of the 23rd Annual Symp on Foundations of Computer Science(SFCS 1982), pp. 160-164, (1982)
[2]  
Duong T, Phan D, Trieu N., Catalic: Delegated PSI cardinality with applications to contact tracing, Proc of the 26th Int Conf on the Theory and Application of Cryptology and Information Security, pp. 870-899, (2020)
[3]  
Demmler D, Rindal P, Rosulek M, Et al., PIR-PSI: Scaling private contact discovery, Proceedings on Privacy Enhancing Technologies, 2018, 4, pp. 159-178, (2018)
[4]  
Lv Siyi, Ye Jinhui, Yin Sijie, Et al., Unbalanced private set intersection cardinality protocol with low communication cost, Future Generation Computer Systems, 102, pp. 1054-1061, (2020)
[5]  
Shen Liyan, Chen Xiaojun, Wang Dakui, Et al., Efficient and private set intersection of human genomes, Proc of IEEE Int Conf on Bioinformatics and Biomedicine (BIBM'18), pp. 761-764, (2018)
[6]  
Meadows C., A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party, Proc of the 7th IEEE Symp on Security and Privacy, pp. 134-134, (1986)
[7]  
Huberman B, Franklin M, Hogg T., Enhancing privacy and trust in electronic communities, Proc of the 1st ACM Conf on Electronic Commerce, pp. 78-86, (1999)
[8]  
Freedman M, Nissim K, Pinkas B., Efficient private matching and set intersection, Proc of the 23rd Int Conf on the Theory and Applications of Cryptographic Techniques, (2004)
[9]  
Shen Liyan, Chen Xiaojun, Shi Jinqiao, Et al., Survey on private preserving set intersection technology, Journal of Computer Research and Development, 54, 10, pp. 2153-2169, (2017)
[10]  
Shamir A., How to share a secret, Communications of the ACM, 22, 11, pp. 612-613, (1979)