On expected polynomial runtime in cryptography (Q2695649)
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 expected polynomial runtime in cryptography |
scientific article; zbMATH DE number 7671181
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On expected polynomial runtime in cryptography |
scientific article; zbMATH DE number 7671181 |
Statements
On expected polynomial runtime in cryptography (English)
0 references
31 March 2023
0 references
black-box zero-knowledge
0 references
uniform complexity
0 references
0 references
0.8356967568397522
0 references
0.8347176313400269
0 references
0.8006918430328369
0 references
