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

Generalized Bootstrapping Technique Based on Block Equality Test Algorithm

Department of Information Research and Security, Zhengzhou Information Science Technology Institute, Zhengzhou, 450001, China

Correspondence should be addressed to Xiufeng Zhao; moc.361@gnef_uix_oahz

Received 29 September 2018; Revised 19 November 2018; Accepted 9 December 2018; Published 24 December 2018

Guest Editor: Pelin Angin

Copyright © 2018 Xiufeng Zhao and Ailan Wang. 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 Proc of the 41th Annual ACM Symp on Theory of Computing (STOC),” pp. 169–178, ACM, New York, NY, USA, 2009. View at Google Scholar
  2. C. Gentry, A fully homomophic encryption scheme [Ph.D. thesis], Stanford University, 2009, http://crypto.stanford.edu/craig.
  3. 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, Palm Springs, Calif, USA, October 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. Z. Brakerski and V. Vaikuntanathan, “Fully homomorphic encryption from ring-LWE and security for key dependent messages,” in Advances in Cryptology—CRYPTO 2011, R. Phillip, Ed., vol. 6841, pp. 505–524, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  5. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, “Fully homomorphic encryption over the integers,” in Advances in cryptology (EUROCRYPT), vol. 6110, pp. 24–43, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  6. Fucai Luo, Fuqun Wang, Kunpeng Wang, Jie Li, and Kefei Chen, “LWR-Based Fully Homomorphic Encryption, Revisited,” Security and Communication Networks, vol. 2018, Article ID 5967635, 12 pages, 2018. View at Publisher · View at Google Scholar
  7. N. P. Smart and F. Vercauteren, “Fully homomorphic SIMD operations,” Designs, Codes and Cryptography, vol. 71, no. 1, pp. 57–81, 2014. View at Publisher · View at Google Scholar · View at Scopus
  8. C. Gentry, A. Sahai, and B. Waters, “Homomorphic encryption from learning with errors: conceputally-simpler, asymptotically-faster, attribute-based,” in CRYPTO, LNCS, R. Canetti and J. A. Garay, Eds., vol. 8042, pp. 75–92, Springer, Heidelberg, Germany, 2013. View at Google Scholar
  9. C. Gentry, S. Halevi, and N. P. Smart, “Better bootstrapping in fully homomorphic encryption,” in Public key cryptography (PKC), vol. 7293 of Lecture Notes in Comput. Sci., pp. 1–16, Springer, Heidelberg, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  10. J. Alperin-Sheriff and C. Peikert, “Practical bootstrapping in quasilinear time,” in Advances in Cryptology – CRYPTO, vol. 8042, pp. 1–20, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  11. J. Alperin-Sheriff and C. Peikert, “Faster bootstrapping with polynomial error,” in Proceedings of the International Cryptology Conference, J. A. Garay and R. Gennaro, Eds., pp. 297–314, Springer, Berlin, Germany, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  12. L. Ducas and D. Micciancio, “FHEW: Bootstrapping homomorphic encryption in less than a second,” in EUROCRYPT, Part I, LNCS, E. Oswald and M. Fischlin, Eds., vol. 9056, pp. 617–640, Springer, Heidelberg, Germany, 2015. View at Google Scholar
  13. I. Chillotti, N. Gama, M. Georgieva et al., “Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds,” in Advances in Cryptology - ASIACRYPT, pp. 3–33, Springer, Heidelberg, Germany, 2016. View at Publisher · View at Google Scholar
  14. I. Chillotti, N. Gama, M. Georgieva et al., “Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE,” in ASIACRYPT 2017. LNCS, T. Takagi and T. Peyrin, Eds., vol. 10624, pp. 377–408, Springer, Cham, UK, 2017. View at Google Scholar
  15. T. Zhou, X. Yang, L. Liu, W. Zhang, and N. Li, “Faster Bootstrapping With Multiple Addends,” IEEE Access, vol. 6, pp. 49868–49876, 2018. View at Publisher · View at Google Scholar