Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947)
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 7195448
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower and upper bounds on the randomness complexity of private computations of AND |
scientific article; zbMATH DE number 7195448 |
Statements
Lower and upper bounds on the randomness complexity of private computations of AND (English)
0 references
30 April 2020
0 references
multi-party information-theoretic private protocols
0 references
0.9941328763961792
0 references
0.8764548897743225
0 references
0.8693943023681641
0 references
0.8693943023681641
0 references
0.8679764270782471
0 references
