Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2017, Article ID 7695751, 11 pages
https://doi.org/10.1155/2017/7695751
Research Article

An Efficient Secret Key Homomorphic Encryption Used in Image Processing Service

School of Electronics and Information Engineering, Xi’an Jiaotong University, Xi’an 710049, China

Correspondence should be addressed to Xiaolin Gui; nc.ude.utjx.liam@iuglx

Received 30 April 2016; Revised 26 January 2017; Accepted 26 March 2017; Published 14 May 2017

Academic Editor: Zonghua Zhang

Copyright © 2017 Pan Yang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the Association for Computing Machinery, vol. 21, no. 2, pp. 120–126, 1978. View at Publisher · View at Google Scholar · View at MathSciNet
  2. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,” Institute of Electrical and Electronics Engineers. Transactions on Information Theory, vol. 31, no. 4, pp. 469–472, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. S. Goldwasser and S. Micali, “Probabilistic encryption,” Journal of Computer and System Sciences, vol. 28, no. 2, pp. 270–299, 1984. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. P. Paillier, “Public-key cryptosystems based on composite degree residuosity classes,” in Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '99), vol. 1592 of Lecture Notes in Computer Science, pp. 223–238, Springer, Prague, Czech Republic. View at Publisher · View at Google Scholar · View at MathSciNet
  5. C. Gentry, “Fully Homomorphic Encryption Using Ideal Lattices,” in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC '09, pp. 169–178, Bethesda, Md, USA, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Fridrich, “Image encryption based on chaotic maps,” in Proceedings of the IEEE International Conference on Systems, vol. 2, pp. 1105–1110, Orlando, Fla, USA, 1997. View at Publisher · View at Google Scholar
  7. N. K. Pareek, V. Patidar, and K. K. Sud, “Image encryption using chaotic logistic map,” Image and Vision Computing, vol. 24, no. 9, pp. 926–934, 2006. View at Publisher · View at Google Scholar · View at Scopus
  8. J. B. Shen, X. G. Jin, and C. A. Zhou, “A color image encryption algorithm based on magic cube transformation and modular arithmetic operation,” in Proceedings of the Advances in Multimedia Information Processing, vol. 3768, pp. 270–280, Jeju Island, Korea. View at Google Scholar
  9. C. Gentry and S. Halevi, “Implementing Gentry's fully-homomorphic encryption scheme,” in Proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic (EUROCRYPT '11), vol. 6632 of Lecture Notes in Computer Science, pp. 129–148, Springer, Tallinn, Estonia. View at Publisher · View at Google Scholar · View at MathSciNet
  10. J.-S. Coron, A. Mandal, D. Naccache, and M. Tibouchi, “Fully homomorphic encryption over the integers with shorter public keys,” in Proceedings of the 31st Annual International Cryptology Conference (CRYPTO '11), vol. 6841 of Lecture Notes in Computer Science, pp. 487–504, Springer, Santa Barbara, Calif, USA. View at Publisher · View at Google Scholar · View at MathSciNet
  11. M. Hojsík and V. Půlpánová, “A fully homomorphic cryptosystem with approximate perfect secrecy,” in Proceedings of the 13th international conference on Topics in Cryptology (CT-RSA '13), pp. 375–388, San Francisco, Calif, USA, 2013.
  12. P. J. Davis, Circulant Matrices, John Wiley & Sons, New York, NY, USA, 1979. View at MathSciNet
  13. Using a Color Matrix to Transform a Single Color, 2014, http://msdn.microsoft.com/en-us/library/windows/desktop/ms533875(v=vs.85).aspx.
  14. J. Hoffstein, J. Pipher, and J. H. Silverman, “NTRU: a ring-based public key cryptosystem,” in Proceedings of the International Algorithmic Number Theory Symposium (ANTS '98), vol. 1423 of Lecture Notes in Computer Science, pp. 267–288, Springer, Portland, Ore, USA. View at Publisher · View at Google Scholar · View at MathSciNet
  15. D. Micciancio, “Generalized compact knapsacks, cyclic lattices, and efficient one-way functions,” Computational Complexity, vol. 16, no. 4, pp. 365–411, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus