A single shuffle is enough for secure card-based computation of any Boolean circuit (Q2217477): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2020.10.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2020.10.013 / rank | |||
Normal rank | |||
Latest revision as of 13:01, 17 December 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
0 references
