which enables users can economically and securely share and handle big datasets with low cost
was proposed. The framework studied data mining algorithms based on the matrix
whose focus was the secure Top-k feature vector algorithm. The algorithm used an iterative processing model and the authorized user interacted with the cloud to achieve the expected result. In this process
the interaction of source matrix and intermediate results were kept confidential. In addition
the security of this algorithm was guaranteed by using Paillier encryption and a random perturbation technique. Experimental results show that the proposed method is scalable to big matrices while requiring low client-side costs.
Deng W , Liu F M , Jin H , et al . Leveraging renewable energy in cloud computing data centers: state of the art and future research . Chinese Journal of Computers , 2013 , 36 ( 3 ): 582 ~ 596
Gennaro R , Gentry C , Parno B . Non -interactive verifiable computing: outsourcing computation to untrusted workers . Proceedings of the 30th Annual Cryptology Conference, , Santa Barbara,CA,USA , 2010 : 465 ~ 482
Gentry C . Fully homomorphic encryption using ideal lattices . Proceedings of the 41st ACM Symposium on Theory of Computing(STOC) , Washington,DC,USA , 2009 ( 9 ): 169 ~ 178
Naehrig M , Lauter K , Vaikuntanathan V . Can homomorphic encryption be practical . Proceedings of the 3rd ACM on Cloud Computing Security Workshop , New York,USA , 2011 : 113 ~ 124
Atallah M J , Frikken K B . Securely outsourcing linear algebra computations . Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security , Beijing,China , 2010 : 48 ~ 59
Ma Z . Sparse principal component analysis and iterative thresholding . The Annals of Statistics , 2013 , 41 ( 2 ): 772 ~ 801
Bai Z , Li R C . Minimization principles for the linear response eigenvalue problem Ⅱ: computation . SIAM Journal on Matrix Analysis and Applications , 2013 , 34 ( 2 ): 392 ~ 416
Al-Vahed A , Sahhavi H . An overview of modern cryptography . World Applied Programming , 2011 , 1 ( 1 ): 3 ~ 8
Regev O . On lattices, learning with errors, random linear codes, and cryptography . Journal of the ACM(JACM) , 2009 , 56 ( 6 ): 34 ~ 43
Lenstra A K , Verheul E R . Selecting cryptographic key sizes . Journal of Cryptology , 2001 , 14 ( 4 ): 255 ~ 293