Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds (Q5176015): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/380752.380852 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064545345 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:04, 9 July 2024
scientific article; zbMATH DE number 6409755
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds |
scientific article; zbMATH DE number 6409755 |
Statements
Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds (English)
0 references
27 February 2015
0 references
