An improved scheme for outsourced computation with attribute‐based encryption. (15th October 2018)

• Record Type: Journal Article
• Authors: Yang, Haining; Sun, Jiameng; Qin, Jing; Ma, Jixin
• Other Names: Xiang Yang guestEditor.; Alam Bhuiyan Md Zakirul guestEditor.; Castiglione Aniello guestEditor.; Wang Yu guestEditor.; Shen Hong guestEditor.; Tian Hui guestEditor.; Sang Yingpeng guestEditor.; Acacio Manuel E. guestEditor.; Sahuquillo Julio guestEditor.
• Is Part Of: Concurrency and computation. Volume 31:Number 21(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-10-15
• Subjects: blind verifiability -- cloud computing -- KP‐ABE -- verifiable computation; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4833
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: With the wide deployment of cloud computing, outsourcing complicated computational tasks to cloud service providers has attracted much attention. An increasing number of clients with computationally constrained devices choose to outsource their heavy tasks to cloud servers to reduce the computational overhead in local. However, how to preserve the integrity of computational results becomes a challenge since commercial cloud servers are not trusted. Public verifiability is an effective mechanism to allow clients to verify the integrity of the results returned by the servers. Because the results are sensitive in many applications, it raises the problem of privacy leakage in the public verification process. In this paper, we propose an efficient verifiable computation scheme while keeping output privacy. The proposed scheme achieves blind verifiability such that the verifiers who have not the additional information (retrieve key) can verify the integrity of the result without learning the result. Furthermore, by combining with ( k, n )‐threshold sharing, our scheme allows the clients jointly learn the results.