A single shuffle is enough for secure card-based computation of any Boolean circuit (Q2217477)
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: A single shuffle is enough for secure card-based computation of any Boolean circuit |
scientific article; zbMATH DE number 7289386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A single shuffle is enough for secure card-based computation of any Boolean circuit |
scientific article; zbMATH DE number 7289386 |
Statements
A single shuffle is enough for secure card-based computation of any Boolean circuit (English)
0 references
29 December 2020
0 references
card-based protocols
0 references
secure computations
0 references
garbled circuits
0 references
0 references
0.8678688406944275
0 references
0.865681529045105
0 references
0.8631818890571594
0 references
0.8593388199806213
0 references
0.8425165414810181
0 references
