Secure publicly verifiable computation with polynomial commitment in cloud computing

4Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Computation outsourcing is a vital cloud service that can be provided for users. Using the cloud to address complex computations is crucial to users with lightweight devices. However, computations may not be correctly executed by the cloud due to monetary reasons. In this paper, we propose a secure publicly verifiable computation scheme in cloud computing, which is designed based on the polynomial commitment. Owing to the public key de-commitment of the polynomial commitment, our scheme can provide public verifiability for computation results. Security analysis shows that the proposed scheme is correct and can support public verifiability. Comparison and simulation results reveal that our scheme can be performed with low computational cost compared to previous schemes.

Cite

CITATION STYLE

APA

Shen, J., Liu, D., Chen, X., Huang, X., Chen, J., & Zhang, M. (2018). Secure publicly verifiable computation with polynomial commitment in cloud computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10946 LNCS, pp. 417–430). Springer Verlag. https://doi.org/10.1007/978-3-319-93638-3_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free