共 50 条
- [42] Efficient Quantum Protocol for Private Set Intersection Cardinality [J]. IEEE ACCESS, 2018, 6 : 73102 - 73109
- [43] A Feasible Quantum Protocol for Private Set Intersection Cardinality [J]. IEEE ACCESS, 2019, 7 : 72105 - 72112
- [44] Cryptanalysis and improvement of a quantum private set intersection protocol [J]. Quantum Information Processing, 2017, 16
- [46] MULTIPARTY COMMUNICATION COMPLEXITY [J]. 30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 428 - 433
- [48] The Communication Complexity of Set Intersection and Multiple Equality Testing [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 [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 [J]. WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2021, PT III, 2021, 12939 : 108 - 116