4.7 Article

Verifiable outsourced computation over encrypted data

期刊

INFORMATION SCIENCES
卷 479, 期 -, 页码 372-385

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2018.12.022

关键词

Outsourced computation; Verifiability; Privacy preservation; Fully homomorphic encryption; Polynomial factorization algorithm

资金

  1. NSFC [61672410, U1536202]
  2. Academy of Finland [308087]
  3. Natural Science Basic Research Plan in Shaanxi Province of China [2016ZDJC-06]
  4. Key Lab of Information Network Security, Ministry of Public Security [C18614]
  5. 111 project [B08038, B16037]
  6. China Scholarship Council

向作者/读者索取更多资源

In recent years, cloud computing has become the most popular and promising service platform. A cloud user can outsource its heavy computation overhead to a cloud service provider (CSP) and let the CSP make the computation instead. In order to guarantee the correctness of the outsourced processing (e.g., machine learning and data mining), a proof should be provided by the CSP in order to make sure that the processing is carried out properly. On the other hand, from the security and privacy points of view, users will always encrypt their sensitive data first before they are outsourced to the CSP rather than sending the raw data directly. However, processing and verifying of encrypted data computation has always been a challenging problem. Homomorphic Encryption (HE) has been proposed to tackle this task on computations over encrypted data and ensure the confidentiality of the data. However, original HE cannot provide an efficient approach to verify the correctness of computation over encrypted data that is processed by CSP. In this paper, we propose a verifiable outsourced computation scheme over encrypted data with the help of fully homomorphic encryption and polynomial factorization algorithm. Our scheme protects user data security in outsourced processing and allows public verification on the computation result processed by CSP with zero knowledge. We then prove the security of our scheme and analyze its performance by comparing it with some latest related works. Performances analysis shows that our scheme reduces the overload of both the cloud users and the verifier. (C) 2018 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据