Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion (Q2369247)
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 5021862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion |
scientific article; zbMATH DE number 5021862 |
Statements
Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion (English)
0 references
3 May 2006
0 references
secure multi-party computation
0 references
Yao's millionaries' problem
0 references
1-out-of-\(m\) oblivious transfer
0 references
set-inclusion problem
0 references
0.9048216342926024
0 references
0.8394830226898193
0 references
0.8166555762290955
0 references
0.8102394938468933
0 references
