How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802): 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-662-53890-6_32 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2554094111 / rank | |||
Normal rank | |||
Revision as of 19:37, 19 March 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
