Skip navigation

Confidentiality-preserving publicly verifiable computation schemes for polynomial evaluation and matrix-vector multiplication

Confidentiality-preserving publicly verifiable computation schemes for polynomial evaluation and matrix-vector multiplication

Sun, Jiameng ORCID: 0000-0003-3153-7698, Zhu, Binrui, Qin, Jing ORCID: 0000-0003-2380-0396, Hu, Jiankun ORCID: 0000-0003-0230-1432 and Ma, Jixin (2018) Confidentiality-preserving publicly verifiable computation schemes for polynomial evaluation and matrix-vector multiplication. Security and Communication Networks, 2018:5275132. ISSN 1939-0114 (Print), 1939-0122 (Online) (doi:https://doi.org/10.1155/2018/5275132)

[img]
Preview
PDF (Open Access Article)
24385 MA_Confidentiality-preserving_Publicly_Verifiable_Computation_Schemes_For_Polynomial_Evaluation_(OA)_2018.pdf - Published Version
Available under License Creative Commons Attribution.

Download (1MB) | Preview

Abstract

With the development of cloud services, outsourcing computation tasks to a commercial cloud server has drawn attention of various communities, especially in the Big Data era. Public verifiability offers a flexible functionality in real circumstance where the cloud service provider (CSP) may be untrusted or some malicious users may slander the CSP on purpose. However, sometimes the computational result is sensitive and is supposed to remain undisclosed in the public verification phase, while existing works on publicly verifiable computation (PVC) fail to achieve this requirement. In this paper, we highlight the property of result confidentiality in publicly verifiable computation and present confidentiality-preserving public verifiable computation (CPPVC) schemes for multivariate polynomial evaluation and matrix-vector multiplication, respectively. The proposed schemes work efficiently under the amortized model and, compared with previous PVC schemes for these computations, achieve confidentiality of computational results, while maintaining the property of public verifiability. The proposed schemes proved to be secure, efficient, and result-confidential. In addition, we provide the algorithms and experimental simulation to show the performance of the proposed schemes, which indicates that our proposal is also acceptable in practice.

Item Type: Article
Uncontrolled Keywords: public verifiability, confidentiality-preserving public verifiable computation (CPPVC), multivariate polynomial evaluation, matrix-vector multiplication
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / Department / Research Group: Faculty of Liberal Arts & Sciences
Faculty of Liberal Arts & Sciences > Centre for Computer & Computational Science
Faculty of Liberal Arts & Sciences > Department of Computing & Information Systems
Last Modified: 24 Feb 2020 09:56
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
Selected for GREAT 2019: None
URI: http://gala.gre.ac.uk/id/eprint/24385

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics