Multiparty Threshold Private Set Intersection Protocol with Low Communication Complexity

被引:0
|
作者
Yu, Xiaopeng [1 ]
Li, Fagen [2 ]
Zhao, Wei [1 ]
Dai, Zhengyi [3 ]
Tang, Dianhua [1 ,2 ]
机构
[1] Science and Technology on Communication Security Laboratory, Chengdu,610041, China
[2] School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu,611731, China
[3] College of Computer, National University of Defense Technology, Changsha,410073, China
关键词
Compendex;
D O I
暂无
中图分类号
学科分类号
摘要
Computational complexity
引用
收藏
相关论文
共 50 条
  • [41] Cryptanalysis and improvement of a quantum private set intersection protocol
    Cheng, Xiaogang
    Guo, Ren
    Chen, Yonghong
    [J]. QUANTUM INFORMATION PROCESSING, 2017, 16 (02)
  • [42] Efficient Quantum Protocol for Private Set Intersection Cardinality
    Shi, Run-Hua
    [J]. IEEE ACCESS, 2018, 6 : 73102 - 73109
  • [43] A Feasible Quantum Protocol for Private Set Intersection Cardinality
    Shi, Run-Hua
    Zhang, Mingwu
    [J]. IEEE ACCESS, 2019, 7 : 72105 - 72112
  • [44] Cryptanalysis and improvement of a quantum private set intersection protocol
    Xiaogang Cheng
    Ren Guo
    Yonghong Chen
    [J]. Quantum Information Processing, 2017, 16
  • [45] A lightweight delegated private set intersection cardinality protocol
    Yang, Xiaoyi
    Zhao, Yanqi
    Zhou, Sufang
    Wang, Lianhai
    [J]. COMPUTER STANDARDS & INTERFACES, 2024, 87
  • [46] MULTIPARTY COMMUNICATION COMPLEXITY
    DOLEV, D
    FEDER, T
    [J]. 30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 428 - 433
  • [47] THE COMMUNICATION COMPLEXITY OF SET INTERSECTION AND MULTIPLE EQUALITY TESTING
    Huang, Dawei
    Pettie, Seth
    Zhang, Yixiang
    Zhang, Zhijun
    [J]. SIAM JOURNAL ON COMPUTING, 2021, 50 (02) : 674 - 717
  • [48] The Communication Complexity of Set Intersection and Multiple Equality Testing
    Huang, Dawei
    Pettie, Seth
    Zhang, Yixiang
    Zhang, Zhijun
    [J]. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1715 - 1732
  • [49] Beyond Set Disjointness: The Communication Complexity of Finding the Intersection
    Brody, Joshua
    Chakrabarti, Amit
    Kondapally, Ranganath
    Woodruff, David P.
    Yaroslavtsev, Grigory
    [J]. PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14), 2014, : 106 - 113
  • [50] Lightweight Threshold Private Set Intersection via Oblivious Transfer
    Zhao, Shengnan
    Ma, Ming
    Song, Xiangfu
    Jiang, Han
    Yan, Yunxue
    Xu, Qiuliang
    [J]. WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2021, PT III, 2021, 12939 : 108 - 116