Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419)
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: Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier |
scientific article; zbMATH DE number 7728549
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier |
scientific article; zbMATH DE number 7728549 |
Statements
Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (English)
0 references
16 August 2023
0 references
\(O(N)\) computational complexity
0 references
decisional Diffie-Hellman assumption
0 references
0 references
0 references
0 references
0.9005582928657532
0 references
0.8309978246688843
0 references
0.8219034075737
0 references
0.8128018975257874
0 references
