Secure publicly verifiable computation with polynomial commitment in cloud computing

DOI10.1007/978-3-319-93638-3_24OpenAlexW2808590429MaRDI QIDQ1784473FDOQ1784473

Authors: J. Shen, Dengzhi Liu, Xiaofeng Chen, Jiageng Chen, Mingwu Zhang, Xinyi Huang 

Publication date: 26 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-93638-3_24

Recommendations

• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• Function-Dependent Commitments for Verifiable Multi-party Computation
• Confidentiality-preserving publicly verifiable computation
• Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations
• Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions

zbMATH Keywords

verifiable computationcomputation outsourcingpublic verifiabilitypolynomial commitment

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Internet topics (68M11)

Cited In (2)

• Confidentiality-preserving publicly verifiable computation
• Flexible access control over verifiable cloud computing services with provable security

This page was built for publication: Secure publicly verifiable computation with polynomial commitment in cloud computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784473)