skip to main content
research-article

Secure Nonlocal Denoising in Outsourced Images

Authors Info & Claims
Published:08 March 2016Publication History
Skip Abstract Section

Abstract

Signal processing in the encrypted domain becomes a desired technique to protect privacy of outsourced data in cloud. In this article, we propose a double-cipher scheme to implement nonlocal means (NLM) denoising in encrypted images. In this scheme, one ciphertext is generated by the Paillier scheme, which enables the mean filter, and the other is obtained by a privacy-preserving transform, which enables the nonlocal search. By the privacy-preserving transform, the cloud server can search the similar pixel blocks in the ciphertexts with the same speed as in the plaintexts; thus, the proposed method can be executed fast. To enhance the security, we randomly permutate both ciphertexts. To reduce the denoising complexity caused by random permutation, a random NLM method is exploited in the encrypted domain. The experimental results show that the quality of denoised images in the encrypted domain is comparable to that obtained in the plain domain.

References

  1. Carlos Aguilar-Melchor, Simon Fau, Caroline Fontaine, Guy Gogniat, and Renaud Sirdey. 2013. Recent advances in homomorphic encryption: A possible future for signal processing in the encrypted domain. IEEE Signal Processing Magazine 30, 2, 108--117.Google ScholarGoogle ScholarCross RefCross Ref
  2. Josh Cohen Benaloh. 1987. Secret sharing homomorphisms: Keeping shares of a secret secret. In Advances in Cryptology (CRYPTO’86). Springer, 251--260. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Tiziano Bianchi, Alessandro Piva, and Mauro Barni. 2009a. Encrypted domain DCT based on homomorphic cryptosystems. EURASIP Journal on Information Security, 1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Tiziano Bianchi, Alessandro Piva, and Mauro Barni. 2009b. On the implementation of the discrete Fourier transform in the encrypted domain. IEEE Transactions on Information Forensics and Security 4, 1, 86--97. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Tiziano Bianchi, Alessandro Piva, and Mauro Barni. 2010. Composite signal representation for fast and storage-efficient processing of encrypted signals. IEEE Transactions on Information Forensics and Security 5, 1, 180--187. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. George Robert Blakley and others. 1979. Safeguarding cryptographic keys. In Proceedings of the National Computer Conference, Vol. 48. 313--317.Google ScholarGoogle Scholar
  7. Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2012. (Leveled) fully homomorphic encryption without bootstrapping. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. ACM, New York, NY, 309--325. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Antoni Buades, Bartomeu Coll, and Jean Michel Morel. 2004. On image denoising methods. CMLA Preprint 5.Google ScholarGoogle Scholar
  9. Antoni Buades, Bartomeu Coll, and Jean-Michel Morel. 2005. A review of image denoising algorithms, with a new one. Multiscale Modeling & Simulation 4, 2, 490--530.Google ScholarGoogle ScholarCross RefCross Ref
  10. Stanley H. Chan, Todd Zickler, and Yue M. Lu. 2014. Monte Carlo non-local means: Random sampling for large-scale image filtering. IEEE Transactions on Image Processing 23, 8, 3711--3725.Google ScholarGoogle ScholarCross RefCross Ref
  11. Ronald Cramer, Ivan Damgård, and Jesper B. Nielsen. 2001. Multiparty Computation from Threshold Homomorphic Encryption. Springer, New York, NY.Google ScholarGoogle Scholar
  12. Ivan Damgård and Mads Jurik. 2001. A generalisation, a simplication and some applications of Paillier’s probabilistic public-key system. In Public Key Cryptography, Hideki Imai and Yuliang Zheng (Eds.). Springer, 119--136. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Robert Huijie Deng, Xuhua Ding, Yongdong Wu, and Zhuo Wei. 2014. Efficient block-based transparent encryption for H. 264/SVC bitstreams. Multimedia Systems 20, 2, 165--178. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Cunsheng Ding. 1996. Chinese Remainder Theorem. World Scientific, Singapore.Google ScholarGoogle Scholar
  15. Taher ElGamal. 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 4, 469--472. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Craig Gentry. 2009. A Fully Homomorphic Encryption Scheme. Ph.D. Dissertation. Stanford University, Stanford, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to play any mental game. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing. ACM, New York, NY, 218--229. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Shafi Goldwasser and Silvio Micali. 1984. Probabilistic encryption. Journal of Computer and System Sciences 28, 2, 270--299.Google ScholarGoogle ScholarCross RefCross Ref
  19. Xianjun Hu, Weiming Zhang, Honggang Hu, and Nenghai Yu. 2014. Non-local denoising in encrypted images. In Internet of Vehicles--Technologies and Services. Springer, New York, NY, 386--395.Google ScholarGoogle Scholar
  20. Piotr Indyk and Rajeev Motwani. 1998. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM, New York, NY, 604--613. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. William B. Johnson and Joram Lindenstrauss. 1984. Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics 26, 1, 189--206.Google ScholarGoogle ScholarCross RefCross Ref
  22. Christine Jost, Ha Lam, Alexander Maximov, and Ben Smeets. 2015. Encryption performance improvements of the Paillier cryptosystem. Retrieved February 8, 2016 from https://eprint.iacr.org/2015/864.pdf.Google ScholarGoogle Scholar
  23. Jonathan Katz and Yehuda Lindell. 2007. Introduction to Modern Cryptography. Chapman & Hall/CRC Cryptography and Network Security Series, Boca Raton, FL. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Krishnaram Kenthapadi, Aleksandra Korolova, Ilya Mironov, and Nina Mishra. 2012. Privacy via the Johnson-Lindenstrauss transform. arXiv preprint arXiv:1204.2606.Google ScholarGoogle Scholar
  25. Reginald L. Lagendijk, Zekeriya Erkin, and Mauro Barni. 2013. Encrypted signal processing for privacy protection: Conveying the utility of homomorphic encryption and multiparty computation. IEEE Signal Processing Magazine 30, 1, 82--105.Google ScholarGoogle ScholarCross RefCross Ref
  26. Ankita Lathey and Pradeep K. Atrey. 2015. Image enhancement in encrypted domain over cloud. ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM’15) 11, 3, 38. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Ankita Lathey, Pradeep K. Atrey, and Nishant Joshi. 2013. Homomorphic low pass filtering on encrypted multimedia over cloud. In Proceedings of the IEEE 7th International Conference on Semantic Computing (ICSC’13). IEEE, 310--313. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Peter Mell and Tim Grance. 2009. Draft NIST working definition of cloud computing. Referenced on June. 3rd, 2009 Online at http://csrc.nist.gov/groups/SNS/cloud-computing/index.html.Google ScholarGoogle Scholar
  29. Claudio Orlandi. 2011. Is multiparty computation any good in practice? In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP’11). IEEE, 5848--5851.Google ScholarGoogle ScholarCross RefCross Ref
  30. Pascal Paillier. 1999. Public-key cryptosystems based on composite degree residuosity classes. In Advances in cryptology (EUROCRYPT’99). Springer, 223--238. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Kui Ren, Cong Wang, Qian Wang, and others. 2012. Security challenges for the public cloud. IEEE Internet Computing 16, 1, 69--73. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Ronald L. Rivest, Len Adleman, and Michael L. Dertouzos. 1978. On data banks and privacy homomorphisms. Foundations of Secure Computation 32, 4, 169--178.Google ScholarGoogle Scholar
  33. Sayed M. Saghaian, Nejad Esfahani, Ying Luo, and S.-C. S. Cheung. 2012. Privacy protected image denoising with secret shares. In Proceedings of the 2012 19th IEEE International Conference on Image Processing (ICIP’12). IEEE, 253--256.Google ScholarGoogle Scholar
  34. Adi Shamir. 1979. How to share a secret. Communications of the ACM 22, 11, 612--613. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Andrew Chi-Chih Yao. 1982. Protocols for secure computations. In FOCS, Vol. 82. 160--164.Google ScholarGoogle Scholar
  36. Peijia Zheng and Jiwu Huang. 2011. Implementation of the discrete wavelet transform and multiresolution analysis in the encrypted domain. In Proceedings of the 19th ACM International Conference on Multimedia. ACM, New York, NY, 413--422. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Peijia Zheng and Jiwu Huang. 2013a. Discrete wavelet transform and data expansion reduction in homomorphic encrypted domain. IEEE Transactions on Image Processing 22, 6, 2455--2468. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Peijia Zheng and Jiwu Huang. 2013b. Walsh-Hadamard transform in the homomorphic encrypted domain and its application in image watermarking. In Information Hiding, Jessica Fridrich (Ed.). Springer, 240--254. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Hongchao Zhou and Gregory Wornell. 2014. Efficient homomorphic encryption on integer vectors and its applications. In Proceedings of the Information Theory and Applications Workshop (ITA’14). IEEE, 1--9.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Secure Nonlocal Denoising in Outsourced Images

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!