PFE: linear active security, double-shuffle proofs, and low-complexity communication (Q6573663)
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 7882042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PFE: linear active security, double-shuffle proofs, and low-complexity communication |
scientific article; zbMATH DE number 7882042 |
Statements
PFE: linear active security, double-shuffle proofs, and low-complexity communication (English)
0 references
17 July 2024
0 references
private function evaluation
0 references
active security
0 references
zero-knowledge proof
0 references
extended permutation
0 references
shuffle
0 references
0.895166277885437
0 references
0.8274635672569275
0 references
0.8153365850448608
0 references
0.8016560673713684
0 references
0.79900062084198
0 references
