Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 983862, 12 pages
http://dx.doi.org/10.1155/2014/983862
Research Article

A Regev-Type Fully Homomorphic Encryption Scheme Using Modulus Switching

1College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
2College of Computer and Information, Zhejiang Wanli University, Ningbo, Zhejiang 315100, China
3Information Security Group, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK
4HP Labs, Bristol BS34 8QZ, UK
5College of Junior, Zhejiang Wanli University, Ningbo, Zhejiang 315101, China

Received 9 March 2014; Accepted 14 May 2014; Published 25 June 2014

Academic Editor: Tianjie Cao

Copyright © 2014 Zhigang Chen 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. 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, ACM, Bethesda, Md, USA, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. C. Gentry and S. Halevi, “Fully homomorphic encryption without squashing using depth-3 arithmetic circuits,” in Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS '11), pp. 107–109, IEEE Computer Society, October 2011. View at Scopus
  3. C. Gentry and S. Halevi, “Implementing Gentry's fully-homomorphic encryption scheme,” in Advances in Cryptology—Eurocrypt 2011, K. Paterson, Ed., pp. 129–148, Springer, Berlin, Germany, 2011. View at Google Scholar
  4. C. Gentry, S. Halevi, and N. P. Smart, “Homomorphic evaluation of the AES circuit,” in Advances in Cryptology—Crypto 2012, R. Safavi-Naini and R. Canetti, Eds., pp. 850–867, Springer, Berlin, Germany, 2012. View at Google Scholar
  5. C. Gentry, S. Halevi, C. Peikert, and N. P. Smart, “Ring switching in BGV-style homomorphic encryption,” in Security and Cryptography for Networks, I. Visconti and R. Prisco, Eds., pp. 19–37, Springer, Berlin, Germany, 2012. View at Google Scholar
  6. C. Gentry, S. Halevi, and N. P. Smart, “Better bootstrapping in fully homomorphic encryption,” in Public Key Cryptography—Pkc 2012, M. Fischlin, J. Buchmann, and M. Manulis, Eds., pp. 1–16, Springer, Berlin, Germany, 2012. View at Google Scholar
  7. N. P. Smart and F. Vercauteren, “Fully homomorphic encryption with relatively small key and ciphertext sizes,” in Public Key Cryptography—Pkc 2010, P. Nguyen and D. Pointcheval, Eds., pp. 420–443, Springer, Berlin, Germany, 2010. View at Google Scholar
  8. D. Stehlé and R. Steinfeld, “Faster fully homomorphic encryption,” in Advances in Cryptology—Asiacrypt 2010, M. Abe, Ed., pp. 377–394, Springer, Berlin, Germany, 2010. View at Google Scholar
  9. Z. Brakerski and V. Vaikuntanathan, “Fully homomorphic encryption from ring-LWE and security for key dependent messages,” in Advances in Cryptology—Crypto 2011, P. Rogaway, Ed., pp. 505–524, Springer, Berlin, Germany, 2011. View at Google Scholar
  10. Z. Brakerski and V. Vaikuntanathan, “Efficient fully homomorphic encryption from (standard) LWE,” in Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS '11), pp. 97–106, IEEE Computer Society, October 2011. View at Publisher · View at Google Scholar · View at Scopus
  11. Z. Brakerski, C. Gentry, and V. Vaikuntanathan, “(Leveled) fully homomorphic encryption without bootstrapping,” in Proceedings of the 3rd Conference on Innovations in Theoretical Computer Science, pp. 309–325, ACM, Cambridge, Mass, USA, January 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. Z. Brakerski, “Fully homomorphic encryption without modulus switching from classical GapSVP,” in Advances in Cryptology—Crypto 2012, R. Safavi-Naini and R. Canetti, Eds., pp. 868–886, Springer, Berlin, Germany, 2012. View at Google Scholar
  13. Z. Brakerski, C. Gentry, and S. Halevi, “Packed ciphertexts in LWE-based homomorphic encryption,” in Public-Key Cryptography—Pkc 2013, K. Kurosawa and G. Hanaoka, Eds., pp. 1–13, Springer, Berlin, Germany, 2013. View at Google Scholar
  14. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, “Fully Homomorphic Encryption over the Integers,” in Advances in Cryptology—Eurocrypt 2010, H. Gilbert, Ed., pp. 24–43, Springer, Berlin, Germany, 2010. View at Google Scholar
  15. J. Coron, A. Mandal, D. Naccache, and M. Tibouchi, “Fully homomorphic encryption over the integers with shorter public keys,” in Advances in Cryptology—Crypto 2011, P. Rogaway, Ed., pp. 487–504, Springer, Berlin, Germany, 2011. View at Google Scholar
  16. J. Coron, D. Naccache, and M. Tibouchi, “Public key compression and modulus switching for fully homomorphic encryption over the integers,” in Advances in Cryptology—Eurocrypt 2012, D. Pointvheval and T. Johansson, Eds., pp. 446–464, Springer, Berlin, Germany, 2012. View at Google Scholar
  17. A. López-Alt, E. Tromer, and V. Vaikuntanathan, “On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption,” in Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC '12), pp. 1219–1234, ACM, New York, NY, USA, May 2012. View at Publisher · View at Google Scholar · View at Scopus
  18. J. Alperin-Sheriff and C. Peikert, “Practical bootstrapping in quasilinear time,” in Advances in Cryptology—Crypto 2013, R. Canetti and J. Garay, Eds., pp. 1–20, Springer, Berlin, Germany, 2013. View at Google Scholar
  19. C. Gentry, A. Sahai, and B. Waters, “Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based,” in Advances in Cryptology—Crypto 2013, R. Canetti and J. Garay, Eds., pp. 75–92, Springer, Berlin, Germany, 2013. View at Google Scholar
  20. O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 84–93, ACM, Baltimore, Md, USA, November 2005.
  21. V. Lyubashevsky, C. Peikert, and O. Regev, “On ideal lattices and learning with errors over rings,” in Advances in Cryptology—Eurocrypt 2010, H. Gilbert, Ed., pp. 1–23, Springer, Berlin, Germany, 2010. View at Google Scholar
  22. C. Peikert, “Public-key cryptosystems from the worst-case shortest vector problem: extended abstract,” in Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC '09), pp. 333–342, ACM, Bethesda, Md, USA, June 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé, “Classical hardness of learning with errors,” in Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC '13), pp. 575–584, ACM, June 2013. View at Publisher · View at Google Scholar · View at Scopus
  24. D. Micciancio and P. Mol, “Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions,” in Advances in Cryptology—Crypto 2011, P. Rogaway, Ed., pp. 465–484, Springer, Berlin, Germany, 2011. View at Google Scholar
  25. D. Micciancio and C. Peikert, “Trapdoors for lattices: simpler, tighter, faster, smaller,” in Advances in Cryptology—Eurocrypt 2012, D. Pointcheval and T. Johansson, Eds., pp. 700–718, Springer, Berlin, Germany, 2012. View at Google Scholar
  26. R. Lindner and C. Peikert, “Better key sizes (and Attacks) for LWE-based encryption,” in Topics in Cryptology—Ct-Rsa 2011, A. Kiayias, Ed., pp. 319–339, Springer, Berlin, Germany, 2011. View at Google Scholar
  27. N. Gama and P. Q. Nguyen, “Predicting lattice reduction,” in Advances in Cryptology—Eurocrypt 2008, N. Smart, Ed., pp. 31–51, Springer, Berlin, Germany, 2008. View at Google Scholar
  28. D. Micciancio and O. Regev, “Lattice-based cryptography,” in Post-Quantum Cryptography, D. Bernstein, J. Buchmann, and E. Dahmen, Eds., pp. 147–191, Springer, Berlin, Germany, 2009. View at Google Scholar
  29. C. Zhigang, W. Jian, C. Liqun, and S. Xinxia, “Review of how to construct a fully homomorphic encryption scheme,” International Journal of Security and Its Applications, vol. 8, no. 2, pp. 221–230, 2014. View at Google Scholar