Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q289906 |
||
| Property / author | |||
| Property / author: Adi Rosén / rank | |||
Revision as of 14:54, 12 February 2024
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
