• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Shen Liyan, Chen Xiaojun, Shi Jinqiao, Hu Lanlan. Survey on Private Preserving Set Intersection Technology[J]. Journal of Computer Research and Development, 2017, 54(10): 2153-2169. DOI: 10.7544/issn1000-1239.2017.20170461
Citation: Shen Liyan, Chen Xiaojun, Shi Jinqiao, Hu Lanlan. Survey on Private Preserving Set Intersection Technology[J]. Journal of Computer Research and Development, 2017, 54(10): 2153-2169. DOI: 10.7544/issn1000-1239.2017.20170461

Survey on Private Preserving Set Intersection Technology

More Information
  • Published Date: September 30, 2017
  • The private set intersection (PSI) is a specific application problem that belongs to the field of secure multi-party computation. It not only has important theoretical significance but also has many application scenarios. In the era of big data, the research on this problem is in accord with people’s increasing privacy preserving demands at the same time to enjoy a variety of services. This paper briefly introduces the basic theory of secure multi-party computation, and highlights the two categories of current mainstream research methods of PSI under the framework of secure multi-party computation: the traditional PSI protocols based on the public key encryption mechanism, garbled circuit, oblivious transfer and the outsourced PSI protocols based on the untrusted third party service provider. Besides, we have briefly summarized the characteristic, applicability and complexity of those protocols. At the same time, the application scenarios of privacy preserving set intersection problem are also explained in detail, which further reflects the practical research value of the problem. With the deep research on the PSI problem, researchers have designed a set of private protocols that can quickly complete set intersection of millions of elements in the semi-honest model.
  • Related Articles

    [1]Chen Zhiqiang, Zhou Hongwei, Feng Quanyou, Deng Rangyu. Design and Implementation of Configurable Cache Coherence Protocol for Multi-Core Processor[J]. Journal of Computer Research and Development, 2021, 58(6): 1166-1175. DOI: 10.7544/issn1000-1239.2021.20210174
    [2]Zhou Enqiang, Zhang Wei, Lu Yutong, Hou Hongjun, Dong Yong. A Cache Approach for Large Scale Data-Intensive Computing[J]. Journal of Computer Research and Development, 2015, 52(7): 1522-1530. DOI: 10.7544/issn1000-1239.2015.20148073
    [3]Wang Endong, Tang Shibin, Chen Jicheng, Wang Hongwei, Ni Fan, Zhao Yaqian. Directory Cache Design for Multi-Core Processor[J]. Journal of Computer Research and Development, 2015, 52(6): 1242-1253. DOI: 10.7544/issn1000-1239.2015.20150140
    [4]Zhang Suiyu, Han Jun, Lu Shiting, and Zeng Xiaoyang. Cache Based AES Attack Implementation and Its Theoretical Analysis[J]. Journal of Computer Research and Development, 2011, 48(6): 955-963.
    [5]Liu Yi, Zhang Xin, Li He, Qian Depei. A Heuristic Task Allocation Algorithm for Multi-Core Based Parallel Systems[J]. Journal of Computer Research and Development, 2009, 46(6): 1058-1064.
    [6]Chen Gang, Zhang Weiwen, and Wu Guoxin. Replacement Solutions for Streaming Cache on P2P Network[J]. Journal of Computer Research and Development, 2007, 44(11): 1857-1865.
    [7]Zhou Xuehai, Yu Jie, Li Xi, and Wand Zhigang. Research on Reliability Evaluation of Cache Based on Instruction Behavior[J]. Journal of Computer Research and Development, 2007, 44(4): 553-559.
    [8]Wu Jiajun, Feng Xiaobing, Zhang Zhaoqing. Data Prefetching Technique of Nonlinear Memory Access[J]. Journal of Computer Research and Development, 2007, 44(2): 355-360.
    [9]Huan Dandan, Li Zusong, Hu Weiwu, Liu Zhiyong. A Cache Adaptive Write Allocate Policy[J]. Journal of Computer Research and Development, 2007, 44(2): 348-354.
    [10]Yan Yuejin, Li Zhoujun, and Chen Huowang. A Depth-First Search Algorithm for Mining Maximal Frequent Itemsets[J]. Journal of Computer Research and Development, 2005, 42(3).

Catalog

    Article views PDF downloads Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return