Lightweight scheme of secure outsourcing SVD of a large matrix on cloud

被引:14
作者
Pramkaew, Chakan [1 ]
Ngamsuriyaroj, Sudsanguan [1 ]
机构
[1] Mahidol Univ, Fac Informat & Commun Technol, Nakhon Pathom, Thailand
关键词
SINGULAR-VALUE DECOMPOSITION; BEARING FAULT-DIAGNOSIS; RECOGNITION; COMPUTATION; IMAGE; COMPRESSION;
D O I
10.1016/j.jisa.2018.06.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
For efficiency and economic reasons, a cloud system would be the most attractive choice for high computation tasks. But, computation on cloud is mostly done on clear text. As a result, the risk of data leak would be very high. The singular value decomposition (SVD) is widely used in several scientific computation areas including computer science, engineering, bioinformatics and physics, and the computation of the SVD consumes high computing power especially for large matrices. Hence, it would be efficient to outsource such computation to a cloud. In addition, many matrices are sparse containing lots of zeroes, and may have no meaning, whereas some applications contain sensitive bitmap images which the positions of zeroes are very significant. In other words, knowing the positions of zeroes would clearly expose the whole image. This paper proposes a novel secure SVD computation on cloud, and the main idea is to locally encrypt a source matrix before sending it to a cloud. The cloud then computes the SVD in an encrypted matrix without requiring any special algorithm, and the outputs will be locally decrypted to obtain the final results. For the encryption, our approach adds a random matrix to the source matrix to ensure that no element including zeroes is exposed in a clear format on the cloud. Moreover, the encryption will preserve the equivalent SVD computation on cloud. The security analysis demonstrates that our proposed scheme gives secure and correct computation while all zeroes are kept hidden. In addition, our experimental results show that the entropy of our encrypted matrix is high; consequently, it would give high resistance to attacks. Furthermore, the performance analysis shows that the complexity of the local workload is O(n(2)) while the complexity of the cloud workload is O(n(3)). (c) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:92 / 102
页数:11
相关论文
共 41 条
[1]   An SVD audio watermarking approach using chaotic encrypted images [J].
Al-Nuaimy, Waleed ;
El-Bendary, Mohsen A. M. ;
Shafik, Amira ;
Shawki, Farid ;
Abou-El-azm, A. E. ;
El-Fishawy, N. A. ;
Elhalafawy, Said M. ;
Diab, Salaheldin M. ;
Sallam, Bassiouny M. ;
Abd El-Samie, Fathi E. ;
Kazemian, H. B. .
DIGITAL SIGNAL PROCESSING, 2011, 21 (06) :764-779
[2]   Singular value decomposition for genome-wide expression data processing and modeling [J].
Alter, O ;
Brown, PO ;
Botstein, D .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (18) :10101-10106
[3]  
[Anonymous], IEEE T CLOUD COMPUTI
[4]  
[Anonymous], 1978, FDN SEC COMPUT
[5]  
[Anonymous], 1987, 19 ACM STOC, DOI [DOI 10.1145/28395.28420, 10.1145/28395.28420]
[6]  
Atallah M.J., 2010, Proc. ACM Symp. on Information, P48, DOI DOI 10.1145/1755688.1755695
[7]  
Atallah MJ, 2001, ADV COMPUT, V54, P215
[8]   LARGE-SCALE SPARSE SINGULAR VALUE COMPUTATIONS [J].
BERRY, MW .
INTERNATIONAL JOURNAL OF SUPERCOMPUTER APPLICATIONS AND HIGH PERFORMANCE COMPUTING, 1992, 6 (01) :13-49
[9]   Using linear algebra for intelligent information retrieval [J].
Berry, MW ;
Dumais, ST ;
OBrien, GW .
SIAM REVIEW, 1995, 37 (04) :573-595
[10]  
Bringer J., 2012, 2012 5th IAPR International Conference on Biometrics (ICB), P257, DOI 10.1109/ICB.2012.6199817