How to garble mixed circuits that combine Boolean and arithmetic computations (Q6637574)
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 garble mixed circuits that combine Boolean and arithmetic computations |
scientific article; zbMATH DE number 7943486
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How to garble mixed circuits that combine Boolean and arithmetic computations |
scientific article; zbMATH DE number 7943486 |
Statements
How to garble mixed circuits that combine Boolean and arithmetic computations (English)
0 references
13 November 2024
0 references
mixed GC in the random oracle model
0 references
mixed GC based on computational assumptions
0 references
0.8555334210395813
0 references
0.832115650177002
0 references
0.8106947541236877
0 references
0.7933678030967712
0 references
0.7901576161384583
0 references
