Provably secure fair mutual private set intersection cardinality utilizing Bloom filter (Q2980879)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6711787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Provably secure fair mutual private set intersection cardinality utilizing Bloom filter |
scientific article; zbMATH DE number 6711787 |
Statements
Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter (English)
0 references
5 May 2017
0 references
mPSI-CA
0 references
malicious adversary
0 references
fairness
0 references
semi-trusted arbiter
0 references
Bloom filter
0 references
0 references
0 references
0.8666731119155884
0 references
0.8395542502403259
0 references
0.826941192150116
0 references
0.7932634353637695
0 references
0.7928748726844788
0 references
