Sub-linear, secure comparison with two non-colluding parties (Q3084347)
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: Sub-linear, secure comparison with two non-colluding parties |
scientific article; zbMATH DE number 5866315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sub-linear, secure comparison with two non-colluding parties |
scientific article; zbMATH DE number 5866315 |
Statements
Sub-linear, Secure Comparison with Two Non-colluding Parties (English)
0 references
15 March 2011
0 references
secure computation
0 references
Yao's millionaires' problem
0 references
0.863926351070404
0 references
0.8301241397857666
0 references
0.8246938586235046
0 references
0.8066229224205017
0 references
0.7973918914794922
0 references
