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

Privacy-Preserving Oriented Floating-Point Number Fully Homomorphic Encryption Scheme

1College of Computer Science, Nanjing University of Posts and Telecommunication, Nanjing 210003, China
2Key Laboratory of Broadband Wireless Communication & Sensor Networks Technology of Ministry of Education, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
3Jiangsu Key Laboratory of Big Data Security & Intelligent Processing, Nanjing, Jiangsu 210023, China

Correspondence should be addressed to Geng Yang; nc.ude.tpujn@ggnay

Received 29 January 2018; Revised 19 May 2018; Accepted 5 June 2018; Published 24 July 2018

Academic Editor: Roberto Di Pietro

Copyright © 2018 Shuangjie Bai 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. D. G. Feng, M. Zhang, Y. Zhang, and Z. Xu, “Study on cloud computing security,” Journal of Software, vol. 22, no. 1, pp. 71–83, 2011. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, “Fully homomorphic encryption over the integers,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 24–43, Springer, Berlin, Germany, 2010. View at Google Scholar
  3. J. H. Cheon, J. S. Coron, J. Kim et al., “Batch fully homomorphic encryption over the integers,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 7881 of Lecture Notes in Computer Science, pp. 315–335, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  4. J.-S. Coron, A. Mandal, D. Naccache, and M. Tibouchi, “Fully homomorphic encryption over the integers with shorter public keys,” in Annual Cryptology Conference, pp. 487–504, Springer, Heidelberg, Germany, 2011. View at Google Scholar
  5. J.-S. Coron, D. Naccache, and M. Tibouchi, “Public key compression and modulus switching for fully homomorphic encryption over the integers,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 446–464, Springer, Berlin, Germany, 2012. View at Google Scholar
  6. W. J. Xiong, Y. Z. Wei, and H. Y. Wang, “An improved fully homomorphic encryption scheme over the integers,” Journal of Cryptologic Research, vol. 3, no. 1, pp. 67–78, 2016. View at Google Scholar
  7. R. A. Popa, C. M. S. Redfield, N. Zeldovich, and H. Balakrishnan, “CryptDB: protecting confidentiality with encrypted query processing,” in Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSP '11), pp. 85–100, October 2011. View at Scopus
  8. R. A. Popa, C. M. S. Redfield, N. Zeldovich, and H. Balakrishnan, “CryptDB: Processing queries on an encrypted database,” Communications of the ACM, vol. 55, no. 9, pp. 103–111, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. W. K. Wong, B. Kao, D. W. L. Cheung, R. Li, and S. M. Yiu, “Secure query processing with data interoperability in a cloud database environment,” in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD '14), pp. 1395–1406, ACM, June 2014. View at Scopus
  10. K. Xue, S. Li, J. Hong, Y. Xue, N. Yu, and P. Hong, “Two-cloud secure database for numeric-related SQL range queries with privacy preserving,” IEEE Transactions on Information Forensics and Security, vol. 12, no. 7, pp. 1596–1608, 2017. View at Publisher · View at Google Scholar · View at Scopus
  11. P. Paillier, “Public-key cryptosystems based on composite degree residuosity classes,” in Proceedings of the 18th Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 547, pp. 223–238, Springer, 1999. View at Google Scholar
  12. N. P. Smart and F. Vercauteren, “Fully homomorphic encryption with relatively small key and ciphertext sizes,” in International Workshop on Public Key Cryptography, pp. 420–443, Springer, Berlin, Germany, 2010. View at Google Scholar
  13. C. Gentry, S. Halevi, and N. P. Smart, “Better bootstrapping in fully homomorphic encryption,” in International Workshop on Public Key Cryptography, pp. 1–16, Springer, Heidelberg, Germany, 2012. View at Google Scholar
  14. X. Liu, R. Lu, J. Ma, L. Chen, and B. Qin, “Privacy-preserving patient-centric clinical decision support system on Naïve Bayesian classification,” IEEE Journal of Biomedical and Health Informatics, vol. 20, no. 2, pp. 655–668, 2016. View at Publisher · View at Google Scholar · View at Scopus
  15. R. L. Rivest, A. Shamir, and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, ACM, 1983.
  16. C. Gentry, “Fully homomorphic encryption using ideal lattices,” Proceedings of the Annual ACM Symposium on Theory of Computing, vol. 9, no. 4, pp. 169–178, 2009. View at Google Scholar
  17. C. Gentry, A Fully Homomorphic Encryption Scheme, Stanford University, 2009. View at Publisher · View at Google Scholar
  18. Z. Brakerski, C. Gentry, and V. Vaikuntanathan, “(Leveled) fully homomorphic encryption without bootstrapping,” in Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 309–325, ACM, 2012. View at MathSciNet
  19. N. J. Higham, Accuracy and Stability of Numerical Algorithm, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 2nd edition, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  20. R. L. Rivest, L. Adleman, and M. L. Dertouzos, “On data banks and privacy homomorphisms,” Foundations of Secure Computation, vol. 4, no. 11, pp. 169–180, 1978. View at Google Scholar
  21. C. Gentry and S. Halevi, “Implementing Gentry’s fully-homomorphic encryption scheme,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 129–148, Springer, Heidelberg, Germany, 2011. View at Google Scholar
  22. J. W. Bos, K. Lauter, J. Loftus, and M. Naehrig, “Improved security for a ring-based fully homomorphic encryption scheme,” in IMA International Conference on Cryptography and Coding, pp. 45–64, Springer, Heidelberg, Germany, 2013. View at Google Scholar
  23. 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, pp. 75–92, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar · View at Scopus
  24. Z. Li, C. Ma, L. Zhang, and W. Zhang, “Two types LWE-based multi-bit lattice-based encryption schemes,” Netinfo Security, no. 10, pp. 1–17, 2017. View at Publisher · View at Google Scholar
  25. Z. G. wang, C. G. Ma, and X. Q. Shi, “Research on full homomorphic encryption scheme based on binary LWE,” Netinfo Security, no. 7, pp. 41–50, 2015. View at Google Scholar
  26. H. Wang, “Identity-based distributed provable data possession in multi-cloud storage,” IEEE Transactions on Services Computing, vol. 8, no. 2, pp. 328–340, 2015. View at Publisher · View at Google Scholar
  27. H. Wang, “Proxy provable data possession in public clouds,” IEEE Transactions on Services Computing, vol. 6, no. 4, pp. 551–559, 2013. View at Publisher · View at Google Scholar · View at Scopus
  28. H. Wang, D. He, and J. Han, “VOD-ADAC: anonymous distributed fine-grained access control protocol with verifiable outsourced decryption in public cloud,” IEEE Transactions on Services Computing, 2017. View at Publisher · View at Google Scholar
  29. H. Wang, D. He, J. Yu, and Z. Wang, “Incentive and unconditionally anonymous identity-based public provable data possession,” IEEE Transactions on Services Computing, 2016. View at Publisher · View at Google Scholar
  30. S. Arita and S. Nakasato, “Fully homomorphic encryption for point numbers,” Cryptology ePrint Archive Report 2016/402, 2016, http://eprint.iacr.org/2016/402. View at Google Scholar
  31. J. Fan and F. Vercauteren, “Somewhat practical fully homomorphic encryption,” Cryptology ePrint Archive Report 2012/144, 2012, http://eprint.iacr.org/2012/144. View at Google Scholar
  32. J. H. Cheon, A. Kim, M. Kim et al., “Floating-point homomorphic encryption,” Cryptology ePrint Archive Report 2016/421, Cryptology ePrint Archive, 2016, http://eprint.iacr.org/2016/421. View at Google Scholar
  33. A. Costache, N. P. Smart, S. Vivek et al., “Fixed point arithmetic in she schemes,” Cryptology ePrint Archive Report 2016/250, 2016, http://eprint.iacr.org/2016/250. View at Google Scholar
  34. X. Liu, R. H. Deng, W. Ding, R. Lu, and B. Qin, “Privacy-preserving outsourced calculation on floating point numbers,” IEEE Transactions on Information Forensics and Security, vol. 11, no. 11, pp. 2513–2527, 2016. View at Publisher · View at Google Scholar · View at Scopus
  35. Y. Chen and P. Q. Nguyen, “Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers,” in International Conference on the Theory and Applications of Cryptographic Techniques, pp. 502–519, Springer, Berlin, Germany, 2012. View at Google Scholar
  36. M. J. Coster, A. Joux, B. A. LaMacchia, A. M. Odlyzko, C.-P. Schnorr, and J. Stern, “Improved low-density subset sum algorithms,” Computational Complexity, vol. 2, no. 2, pp. 111–128, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus