Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead (Q4910290)
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: Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead |
scientific article; zbMATH DE number 6145746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead |
scientific article; zbMATH DE number 6145746 |
Statements
Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead (English)
0 references
18 March 2013
0 references
fully homomorphic encryption
0 references
threshold encryption
0 references
secure multi-party computation
0 references
communication and round complexity
0 references
proof of knowledge
0 references
0.7976788878440857
0 references
0.7884067296981812
0 references
0.773874819278717
0 references
0.7705129384994507
0 references
0.7649304270744324
0 references
