Loading…
Quantum Protocols for Private Set Intersection Cardinality and Union Cardinality Based on Entanglement Swapping
Quantum private set intersection cardinality (PSI-CA) and private set union cardinality (PSU-CA) are two specific primitives of classical secure multi-party computation. Because of the appearance of quantum algorithms such as Shor’s algorithm, the secure multi-party computation protocols based on cl...
Saved in:
Published in: | International journal of theoretical physics 2021, Vol.60 (9), p.3514-3528 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Quantum private set intersection cardinality (PSI-CA) and private set union cardinality (PSU-CA) are two specific primitives of classical secure multi-party computation. Because of the appearance of quantum algorithms such as Shor’s algorithm, the secure multi-party computation protocols based on classical mathematical problems such as large integer factorization and discrete logarithm have been threatened potentially. Thus, as one of the most powerful resources, quantum mechanics is widely used to construct various secure multi-party computation protocols for the reason that it can provide unconditional security. In this paper, based on entanglement swapping between
d
-level Bell states and
d
-level cat states, a quantum protocol is built to perform the calculations of private set intersection cardinality and private set union cardinality. With the help of a semi-honest third party who does not collude with any participant, the proposed protocol can simultaneously calculate intersection cardinality and union cardinality of the private sets held by multiple participants who do not trust each other without revealing the intersection, the union and the sets themselves. The protocol can resist attacks from external, semi-honest TP and participants, even though
m
− 1 participants collude together (
m
is the number of participants). In addition, the algorithm in the protocol is deterministic. |
---|---|
ISSN: | 0020-7748 1572-9575 |
DOI: | 10.1007/s10773-021-04925-7 |