How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes |
scientific article |
Statements
How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (English)
0 references
6 January 2017
0 references
garbled circuits
0 references
lower bound on linear garbling schemes
0 references
semi-private function evaluation
0 references
0 references
0 references
