Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: FleXOR / rank | |||
Normal rank | |||
Revision as of 20:58, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three halves make a whole? Beating the half-gates lower bound for garbled circuits |
scientific article |
Statements
Three halves make a whole? Beating the half-gates lower bound for garbled circuits (English)
0 references
31 March 2022
0 references
garbling scheme for Boolean circuits
0 references
