How to meet big data when private set intersection realizes constant communication complexity (Q1989531)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to meet big data when private set intersection realizes constant communication complexity |
scientific article; zbMATH DE number 6966775
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to meet big data when private set intersection realizes constant communication complexity |
scientific article; zbMATH DE number 6966775 |
Statements
How to meet big data when private set intersection realizes constant communication complexity (English)
0 references
26 October 2018
0 references
PSI
0 references
SSB hash
0 references
iO
0 references
Bloom filter
0 references
0.8828577
0 references
0.87425315
0 references
0.8672661
0 references
0.8593171
0 references
0.85720164
0 references
