Secure and efficient private set intersection cardinality using Bloom filter (Q1799244)
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 6958285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Secure and efficient private set intersection cardinality using Bloom filter |
scientific article; zbMATH DE number 6958285 |
Statements
Secure and efficient private set intersection cardinality using Bloom filter (English)
0 references
18 October 2018
0 references
(A)PSI-CA
0 references
(A)PSI
0 references
semi-honest adversary
0 references
malicious adversary
0 references
privacy
0 references
Bloom filter
0 references
0.8821019530296326
0 references
0.8575114607810974
0 references
0.8507834672927856
0 references
0.8395542502403259
0 references
0.8336620926856995
0 references
