Efficient multiparty computation for arithmetic circuits against a covert majority (Q4924688)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6172058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient multiparty computation for arithmetic circuits against a covert majority |
scientific article; zbMATH DE number 6172058 |
Statements
Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority (English)
0 references
7 June 2013
0 references
multiparty computation
0 references
covert adversary
0 references
dishonest majority
0 references
arithmetic circuit
0 references
homomorphic encryption
0 references
lossy encryption
0 references
0.8356618881225586
0 references
0.8306677937507629
0 references
0.8230906128883362
0 references
0.8225441575050354
0 references
0.8007803559303284
0 references
