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; zbMATH DE number 6671013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to circumvent the two-ciphertext lower bound for linear garbling schemes |
scientific article; zbMATH DE number 6671013 |
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.8568241000175476
0 references
0.8515977263450623
0 references
0.8174206614494324
0 references
0.8069788813591003
0 references
0.7971899509429932
0 references
