Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-84242-0_5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3187028412 / rank | |||
Normal rank | |||
Revision as of 14:31, 19 March 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
