On the round complexity of covert computation (Q2875145)
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: On the round complexity of covert computation |
scientific article; zbMATH DE number 6330058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the round complexity of covert computation |
scientific article; zbMATH DE number 6330058 |
Statements
On the round complexity of covert computation (English)
0 references
13 August 2014
0 references
covert computation
0 references
cryptography
0 references
round complexity
0 references
0.8779811263084412
0 references
0.8175463676452637
0 references
0.8160362839698792
0 references
0.807197093963623
0 references
0.796695351600647
0 references
