Secure publicly verifiable computation with polynomial commitment in cloud computing (Q1784473)
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: Secure publicly verifiable computation with polynomial commitment in cloud computing |
scientific article; zbMATH DE number 6944257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Secure publicly verifiable computation with polynomial commitment in cloud computing |
scientific article; zbMATH DE number 6944257 |
Statements
Secure publicly verifiable computation with polynomial commitment in cloud computing (English)
0 references
26 September 2018
0 references
computation outsourcing
0 references
verifiable computation
0 references
polynomial commitment
0 references
public verifiability
0 references
0.8009453415870667
0 references
0.8004363775253296
0 references
0.7991605997085571
0 references
0.7977219820022583
0 references
