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 the normal view instead:
scientific article; zbMATH DE number 7614579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9082059860229492
0 references
0.79899662733078
0 references
0.7980290055274963
0 references
0.7811132669448853
0 references
0.7685992121696472
0 references
