Efficient scalable multiparty private set-intersection via garbled Bloom filters (Q1796793)
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: Efficient scalable multiparty private set-intersection via garbled Bloom filters |
scientific article; zbMATH DE number 6957556
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient scalable multiparty private set-intersection via garbled Bloom filters |
scientific article; zbMATH DE number 6957556 |
Statements
Efficient scalable multiparty private set-intersection via garbled Bloom filters (English)
0 references
17 October 2018
0 references
multiparty computation
0 references
private set intersection
0 references
concrete efficiency
0 references
garbled Bloom filters
0 references
0.8672752380371094
0 references
0.8665241003036499
0 references
0.8583126068115234
0 references
0.8354048132896423
0 references
0.8327601552009583
0 references
