How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: FleXOR / rank | |||
Normal rank | |||
Revision as of 03:37, 28 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
