Privacy-Preserving Decentralised Singular Value Decomposition

With the proliferation of data and emerging data-driven applications, how to perform data analytical operations while respecting privacy concerns has become a very interesting research topic. With the advancement of communication and computing technologies, e.g. the FoG computing concept and its associated Edge computing technologies, it is now appealing to deploy decentralized data-driven applications. Following this trend, in this paper, we investigate privacy-preserving singular value decomposition (SVD) solutions tailored for these new computing environments. We first analyse a privacy-preserving SVD solution by Chen et al., which is based on the Paillier encryption scheme and some heuristic randomization method. We show that (1) their solution leaks statistical information to an individual player in the system; (2) their solution leaks much more information when more than one players collude. Based on the analysis, we present a new solution, which distributes the SVD results into two different players in a privacy-preserving manner. In comparison, our solution minimizes the information leakage to both individual player and colluded ones, via randomization and threshold homomorphic encryption techniques.

[1]  Xiaolei Dong,et al.  Security and privacy in cloud-assisted wireless wearable communications: Challenges, solutions, and future directions , 2015, IEEE Wireless Communications.

[2]  Jianfeng Ma,et al.  New Algorithms for Secure Outsourcing of Modular Exponentiations , 2014, IEEE Trans. Parallel Distributed Syst..

[3]  Shanhe Wu,et al.  Various Proofs of the Cauchy-Schwarz Inequality , 2009 .

[4]  Jonathan Bar-Magen,et al.  Fog Computing: introduction to a New Cloud Evolution , 2013 .

[5]  Ming Li,et al.  Privacy-preserving verifiable data aggregation and analysis for cloud-assisted mobile crowdsourcing , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[6]  Stratis Ioannidis,et al.  Privacy-preserving matrix factorization , 2013, CCS.

[7]  A. Barbour,et al.  A law of large numbers approximation for Markov population processes with countably many types , 2009, 1001.0044.

[8]  Philip S. Yu,et al.  Privacy-Preserving Singular Value Decomposition , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[9]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[10]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[11]  Hyunsoo Yoon,et al.  Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption , 2016, IACR Cryptol. ePrint Arch..

[12]  Ivan Damgård,et al.  A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System , 2001, Public Key Cryptography.

[13]  Rongxing Lu,et al.  A Flexible Privacy-Preserving Framework for Singular Value Decomposition Under Internet of Things Environment , 2017, IFIPTM.

[14]  Hyunsoo Yoon,et al.  Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption: Extended Abstract , 2016, IACR Cryptol. ePrint Arch..

[15]  Sugata Sanyal,et al.  Survey of Security and Privacy Issues of Internet of Things , 2015, ArXiv.