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 this page instead for the normal view: Lower and upper bounds on the randomness complexity of private computations of AND |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower and upper bounds on the randomness complexity of private computations of AND |
scientific article |
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
