Round-optimal black-box commit-and-prove with succinct communication (Q2096539)
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: Round-optimal black-box commit-and-prove with succinct communication |
scientific article; zbMATH DE number 7614579
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Round-optimal black-box commit-and-prove with succinct communication |
scientific article; zbMATH DE number 7614579 |
Statements
Round-optimal black-box commit-and-prove with succinct communication (English)
0 references
9 November 2022
0 references
sub-exponentially hard collision-resistant hash functions
0 references
two-round PIRs
0 references
two-round OTs
0 references
0 references
0 references
