2021
DOI: 10.1038/s41598-021-96770-1
|View full text |Cite
|
Sign up to set email alerts
|

Quantum private set intersection cardinality based on bloom filter

Abstract: Private Set Intersection Cardinality that enable Multi-party to privately compute the cardinality of the set intersection without disclosing their own information. It is equivalent to a secure, distributed database query and has many practical applications in privacy preserving and data sharing. In this paper, we propose a novel quantum private set intersection cardinality based on Bloom filter, which can resist the quantum attack. It is a completely novel constructive protocol for computing the intersection c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 36 publications
0
4
0
Order By: Relevance
“…Furthermore, SP and the client have the same count Bloom filter parameters, i.e., hash functions {h 1 , h 2 , ..., h λ } and the length τ of the count Bloom filter [34,39].…”
Section: Proposed Protocolmentioning
confidence: 99%
“…Furthermore, SP and the client have the same count Bloom filter parameters, i.e., hash functions {h 1 , h 2 , ..., h λ } and the length τ of the count Bloom filter [34,39].…”
Section: Proposed Protocolmentioning
confidence: 99%
“…QSMC has garnered considerable interest among researchers for its ability to provide quantum-level security. Presently, there exist various branches of research within the field, encompassing topics such as quantum private set intersection cardinality, [9][10][11] quantum private comparison, [12][13][14] quantum secure multiparty summation, [15][16][17][18][19] and more.…”
Section: Introductionmentioning
confidence: 99%
“…It is mostly known by now, that quantum bloom filters [73,74] and quantum gauge graphs[? ] can be implemented using Grover Algorithm, Bernstein-Vazirani Algorithm [?…”
Section: Introductionmentioning
confidence: 99%