Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing (Q5402969)
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: Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing |
scientific article; zbMATH DE number 6273695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing |
scientific article; zbMATH DE number 6273695 |
Statements
Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing (English)
0 references
25 March 2014
0 references
verifiable computation
0 references
delegatable computation
0 references
input/output privacy
0 references
garbled circuits
0 references
0.8683523535728455
0 references
0.8676628470420837
0 references
0.8367708325386047
0 references
0.8350013494491577
0 references
0.834995448589325
0 references
