Just process me, without knowing me: a secure encrypted domain processing based on Shamir secret sharing and POB number system

High end computational and storage resources provided by the cloud based paradigm are attracting the global infrastructure. However, the wide attacking surface of the public cloud may pose threat to security if outsourcing of the multimedia content is done without obscuring. Employing the traditional encryption schemes may serve as a feasible solution. However, processing in the encrypted domain to fetch the same services as plaintext domain may not be possible due to limitations of the encryption schemes. In this article, a secured scheme based on Shamir’s secret sharing and permutation ordered binary (POB) number system for processing of image in encrypted domain itself over the cloud severs has been proposed. Obfuscated shares are obtained by distributing the image information into multiple shares that can be sent and processed in frequency domain over the cloud servers. The performance of various image operations such as denoising, dehazing, edge sharpening, unsharp masking, contrast enhancement, etc has been validated on these encrypted shares in the frequency domain along with the comparative results in the plaintext domain. The processed image can be obtained from these processed shares only by the authentic entity possessing the secret keys.

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

[2]  Bin Zhao,et al.  Secret Sharing in the Encrypted Domain with Secure Comparison , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

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

[4]  Athanasios V. Vasilakos,et al.  Security in cloud computing: Opportunities and challenges , 2015, Inf. Sci..

[5]  Craig Gentry,et al.  (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.

[6]  Pradeep K. Atrey,et al.  Image Enhancement in Encrypted Domain over Cloud , 2015, ACM Trans. Multim. Comput. Commun. Appl..

[7]  Guy Gogniat,et al.  Recent Advances in Homomorphic Encryption: A Possible Future for Signal Processing in the Encrypted Domain , 2013, IEEE Signal Processing Magazine.

[8]  John Bloom,et al.  A modular approach to key safeguarding , 1983, IEEE Trans. Inf. Theory.

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

[10]  Maurice Mignotte,et al.  How to Share a Secret? , 1982, EUROCRYPT.

[11]  Gaurav Bhatnagar,et al.  Robust gray-scale logo watermarking in wavelet domain , 2012, Comput. Electr. Eng..

[12]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[13]  Ying Luo,et al.  Privacy protected image denoising with secret shares , 2012, 2012 19th IEEE International Conference on Image Processing.

[14]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[15]  Josh Benaloh,et al.  Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

[16]  Pradeep K. Atrey,et al.  An improved scheme for secret image sharing , 2010, 2010 IEEE International Conference on Multimedia and Expo.

[17]  Balasubramanian Raman,et al.  A chaotic system based fragile watermarking scheme for image tamper detection , 2011 .

[18]  Rajkumar Buyya,et al.  Cloud Computing Principles and Paradigms , 2011 .

[19]  P DeepikaM,et al.  A Novel Secret Sharing Scheme Using POB Number System and CRT , 2016 .

[20]  K. Srinathan,et al.  Efficient privacy preserving video surveillance , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[21]  Ja-Chen Lin,et al.  Secret image sharing , 2002, Comput. Graph..

[22]  Pradeep K. Atrey,et al.  Secure cloud-based medical data visualization , 2012, ACM Multimedia.

[23]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

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

[25]  Pradeep K. Atrey,et al.  Scale me, crop me, knowme not: Supporting scaling and cropping in secret image sharing , 2013, 2013 IEEE International Conference on Multimedia and Expo (ICME).

[26]  Josh Benaloh,et al.  Secret Sharing Homomorphisms: Keeping Shares of A Secret Sharing , 1986, CRYPTO.

[27]  Pradeep K. Atrey,et al.  Further improvements on secret image sharing scheme , 2010, MiFor '10.