Title: Secure and verifiable outsourcing protocol for non-negative matrix factorisation

Authors: Zhenhua Liu; Bin Li; Qi Han

Addresses: School of Mathematics and Statistics, Xidian University, Xi'an, 710071, Shaanxi, China ' School of Mathematics and Statistics, Xidian University, Xi'an, 710071, Shaanxi, China ' School of Telecommunications Engineering, Xidian University, Xi'an, 710071, Shaanxi, China

Abstract: With the rapid development of cloud computing services, resource-constrained clients can outsource their expensive computation tasks, such as scientific computations, to untrusted cloud servers. Furthermore, it is essential for these clients to protect their sensitive data and verify the validity of the returned computation results. In this paper, we focus on outsourcing protocol of non-negative matrix factorisation, which is an expensive computation task and has been widely applied to image processing, face recognition, text analysis, and so on. The permutation technique is employed to transform the original problem into a new one in our proposed protocol so as to protect the privacy, and the matrix 1-norm technique is utilised to verify the result returned from the cloud server in order to reduce the verification cost. Based on these two techniques, we construct a secure and verifiable outsourcing protocol for non-negative matrix factorisation. Moreover, the theoretical analysis and the experimental results show that our proposed protocol brings great computation savings for resource-constrained clients and fulfills the goals of correctness, security, verifiability and high efficiency.

Keywords: cloud computing; permutation; outsourcing; cloud security; verifiability; matrix factorisation.

DOI: 10.1504/IJHPCN.2018.088875

International Journal of High Performance Computing and Networking, 2018 Vol.11 No.1, pp.14 - 23

Received: 28 Aug 2015
Accepted: 30 Dec 2015
Published online: 22 Dec 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article