A single shuffle is enough for secure card-based computation of any Boolean circuit (Q2217477): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:38, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A single shuffle is enough for secure card-based computation of any Boolean circuit |
scientific article |
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
