Efran (O): "Efficient Scalar Homomorphic Scheme on MapReduce for Data Privacy Preserving"

Privacy protection is one of most concerned issues in big data and cloud applications in the last decade. Thereby, mapreduce which is a programming scheme with an associated parallel implementation for processing and generating large data sets on the heart of cloud applications needs to be securely implemented. Thus the security of map workers' data (intermediate data) of mapreduce model must be well protected. But the traditional operations on ciphertexts were not applicable at the reduce stage. So to provide a secure mapreduce scheme, there is a paramount need to protect the data, as well as to allow specific types of computations to be carried out on encrypted intermediate data. Therefore some homomorphic based models have been proposed to address this issue, which could compute over encrypted data without decrypting it. However those existing schemes have to send their private encryption key to untrusted server (DGHV model) or key's parameters (Gen10 scheme by Gentry) which drastically leaks either the plaintext or information about the cryptosystem. In this paper, we propose a secure homomorphic model (FHE_SHCR algorithm) which efficiently retrieves ciphertexts (R_c) at reduce phase without passing any parameters or private key to untrusted server. Also for the efficiency of our solution in terms of computation cost and security analysis, we use a scalar homomorphic approach rather than applying blinding algorithm (probabilistic, polynomial-time algorithm) which is computationally expensive. Doing so, we efficiently achieve a probabilistic and improved security level through our model which is proved feasible.

[1]  Xu Chen,et al.  The data protection of mapreduce using homomorphic encryption , 2013, 2013 IEEE 4th International Conference on Software Engineering and Service Science.

[2]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[3]  Caroline Fontaine,et al.  A Survey of Homomorphic Encryption for Nonspecialists , 2007, EURASIP J. Inf. Secur..

[4]  Craig Gentry,et al.  Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness , 2010, CRYPTO.

[5]  Xiaojiang Du,et al.  Efficiently secure data privacy on hybrid cloud , 2013, 2013 IEEE International Conference on Communications (ICC).

[6]  Rafail Ostrovsky,et al.  Searchable symmetric encryption: Improved definitions and efficient constructions , 2011, J. Comput. Secur..

[7]  Ronald L. Rivest,et al.  ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .

[8]  Jaydip Sen,et al.  Homomorphic Encryption — Theory and Application , 2013 .

[9]  Wenyong Wang,et al.  Aya: “An efficient access-controlled storage and processing for cloud-based sensed data” , 2015, 2015 12th International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP).

[10]  S. Halevi,et al.  Design and Implementation of a Homomorphic-Encryption Library , 2012 .

[11]  Amare Anagaw Ayele Dr. Vuda Sreenivasarao A Modified RSA Encryption Technique Basedon Multiple public keys , 2013 .

[12]  Jaydip Sen Theory And Practice Of Cryptography And Network Security Protocols And Technologies , 2014 .

[13]  Craig Gentry,et al.  Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.

[14]  Dima Grigoriev,et al.  Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits , 2003, Applicable Algebra in Engineering, Communication and Computing.

[15]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[16]  Brent Waters,et al.  Fuzzy Identity-Based Encryption , 2005, EUROCRYPT.

[17]  Craig Gentry,et al.  Implementing Gentry's Fully-Homomorphic Encryption Scheme , 2011, EUROCRYPT.

[18]  Klaus Wehrle,et al.  A Cloud design for user-controlled storage and processing of sensor data , 2012, 4th IEEE International Conference on Cloud Computing Technology and Science Proceedings.

[19]  Ian H. Witten,et al.  Managing Gigabytes: Compressing and Indexing Documents and Images , 1999 .

[20]  Craig Gentry,et al.  Computing arbitrary functions of encrypted data , 2010, CACM.

[21]  Oded Goldreich,et al.  Public-Key Cryptosystems from Lattice Reduction Problems , 1996, CRYPTO.

[22]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.