How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:17, 3 February 2024
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
