Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7500824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three halves make a whole? Beating the half-gates lower bound for garbled circuits |
scientific article; zbMATH DE number 7500824 |
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
0.8998955488204956
0 references
0.8568241000175476
0 references
0.8132496476173401
0 references
0.8051910400390625
0 references
0.8028078079223633
0 references
