Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069): Difference between revisions
From MaRDI portal
Latest revision as of 12:08, 28 July 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