Optimizing LWE-based FHE for better security and privacy protection of smart city

Journal of Information Science and Engineering

Volumn 33, Issue 4, 2017, Pages 939-952

  Song, Wei Tao ^a   Hu, Bin ^a   Zhao, Xiu Feng ^a  

^a ZHENGZHOU INFORMATION SCIENCE AND TECHNOLOGY INSTITUTE   (China)

Author keywords

Bootstrapping; Fully homomorphic encryption; Learning with error; Noise reduction; Re linearization technique

Indexed keywords

CLOUD COMPUTING; EFFICIENCY; LINEARIZATION; NOISE ABATEMENT; SECURITY OF DATA; SMART CITY;

BINARY DECOMPOSITIONS; BOOTSTRAPPING; FULLY HOMOMORPHIC ENCRYPTION; INFORMATION TECHNIQUES; LEARNING WITH ERRORS; LINEARIZATION TECHNIQUE; PROCESSING METHOD; SECURITY AND PRIVACY PROTECTION;

CRYPTOGRAPHY;

EID: 85049878396     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: 10.6688/JISE.2017.33.4.5     Document Type: Article

References (34)

1. T. Nam and T. A. Pardo, “Conceptualizing smart city with dimensions of technology, people, and institutions,” in Proceedings of the 12th Annual International Digital Government Research Conference on Digital Government Innovation in Challenging Times, 2011, pp. 282-291.
2. J. A. C. Soto, O. Werner-Kytölä, and M. Jahn et al., “Towards a federation of smart city services,” in Proceedings of International Conference on Recent Advances in Computer Systems, 2015, pp. 163-168.
3. Z. Liu, and X. Huang, Z. Hu, M. K. Khan, H. Seo, and L. Zhou, “On emerging family of elliptic curves to secure internet of things: ECC comes of age,” IEEE Transactions on Dependable and Secure Computing, Vol. 99, 2016, pp. 3301-3310.
4. A. Krylovskiy, M. Jahn, and E. Patti, “Designing a smart city internet of things platform with microservice architecture,” in Proceedings of the 3rd Future Internet of Things and Cloud, 2015, pp. 25-30.
5. Z. Fu, X. Sun, Q. Liu, L. Zhou, and J. Shu, “Achieving efficient cloud search services: Multi-keyword ranked search over encrypted cloud data supporting parallel computing,” IEICE Transactions on Communications, Vol. E98-B, 2015, pp. 190-200.
6. Y. Ren, J. Shen, J. Wang, J. Han, and S. Lee, “Mutual verifiable provable data auditing in public cloud storage,” Journal of Internet Technology, Vol. 16, 2015, pp. 317-323.
7. Z. Xia, X. Wang, X. Sun, and Q. Wang, “A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data,” IEEE Transactions on Parallel and Distributed Systems, Vol. 27, 2015, pp. 340-352.
8. Z. Fu, K. Ren, J. Shu, X. Sun, and F. Huang, “Enabling personalized search over encrypted outsourced data with efficiency improvement,” IEEE Transactions on Parallel and Distributed Systems, DOI: 10.1109/TPDS.2015.2506573, 2015.
9. A. Bouti and J. Keller, “Towards practical homomorphic encryption in cloud computing,” in Proceedings of the 4th Network Cloud Computing and Applications, 2015, pp. 67-74.
10. O. Kocabas and T. Soyata, “Utilizing homomorphic encryption to implement secure and private medical cloud computing,” in Proceedings of the 8th International Conference on Cloud Computing, 2015, pp. 540-547.
11. R. L. Rivest, L. Adlman, and M. L. Dertouzos, “On data banks and privacy homomorphisms,” Foundations of Secure Computation, Vol. 4, 1978, pp. 169-180.
12. C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009, pp. 169-178.
13. C. Gentry, “Computing on arbitrary functions of encrypted data,” Communications of the ACM, Vol. 53, 2010, pp. 97-105.
14. M. van Dijk, C. Gentry, S. Halevi, et al., “Fully homomorphic encryption over the integers,” in Proceedings of the 29th International Conference on Theory and Application of Cryptographic Techniques, 2010, pp. 24-43.
15. N. P. Smart and F. Vercautern, “Fully homomorphic encryption with relatively small key and ciphertext sizes,” in Proceedings of the 13th International Conference on Pronctice and Theory in Public Key Cryptography, 2010, pp. 420-443.
16. D. Stehl and R. Steinfeld, “Faster fully homomorphic encryption,” in Proceedings of the 16th International Conference on Theory and Application of Cryptographic and Information Security, 2010, pp. 377-394.
17. T. Plantard, W. Susilo, and Z. Zhang, “Fully homomorphic encryption using hidden ideal lattice,” IEEE Transactions on Information Forensics and Security, Vol. 8, 2013, pp. 2127-2137.
18. J. Cheon, J. S. Coron, J. Kim, et al., “Batch fully homomorphic encryption over the integers,” in Proceedings of the 32nd International Conference on Theory and Application of Cryptographic, 2013, pp. 315-335.
19. J. S. Coron, T. Lepoint, and M. Tibouchi, “Scale-invariant fully homomorphic encryption over the integers,” in Proceedings of the 17th International Conference on Practice and Theory in Public Key Cryptography, 2014, pp. 311-328.
20. J. H. Cheon, J. Kim, M. S. Lee, and A. Yun, “CRT-based fully homomorphic encryption over the integers,” Information Sciences, 2015, pp. 149-162.
21. Z. Liu, H. Seo, J. Groschl, and H. Kim, “Efficient implementation of NIST-com-pliant elliptic curve cryptography for 8-bit AVR-based sensor nodes,” IEEE Transactions on Information Forensics and Security, Vol. 11, 2016, pp. 1385-1397.
22. Z. Brakerski and V. Vaikuntanathan, “Efficient fully homomorphic encryption from (standard) LWE,” in Proceedings of the 52nd Annual Symposium on Foundations of Computer Science, 2011, pp. 97-106.
23. O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” Journal of the ACM, Vol. 56, 2009, p. 34.
24. Z. Liu, H. Seo, S. S. Roy, J. Groschl, H. Kim, and I. Verbauwhede, “Efficient ring-LWE Encryption on 8-bit AVR processors,” in Proceedings of the 17th Workshop on Cryptographic Hardware and Embedded Systems, Vol. 9293, 2015, pp. 663-682.
25. Z. Brakerski and V. Vaikuntanathan, “Fully homomorphic encryption from ring-LWE and security for key dependent messages,” in Proceedings of the 31st Annual Conference on Advances in Cryptology, 2011, pp. 505-524.
26. Z. Brakerski, C. Gentry, and V. Vaikuntanathan, “(Leveled) fully homomorphic encryption without bootstrapping,” in Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, 2012, pp. 309-325.
27. Z. Brakerski, “Fully homomorphic encryption without modulus switching from classical GapSVP,” in Proceedings of the 32nd Cryptology Conference, 2012, pp. 868-886.
28. C. Gentry, S. Halevi, C. Peikert, et al., “Ring switching in BGV-style homomorphic encryption,” in Proceedings of the 8th International Security and Cryptography for Networks, 2012, pp. 19-37.
29. J. Alperin-Sheriff and C. Peikert, “Practical bootstrapping in quasilinear time,” in Proceedings of the 33rd Annual Cryptology Conference, 2013, pp. 1-20.
30. C. Gentry, S. Halevi, and N. Smart, “Better bootstrapping in fully homomorphic encryption,” in Proceedings of the 15th International Conference on Practice and Theory in Public Key Cryptography, 2012, pp. 1-16.
31. C. Gentry, A. Sahai, and B. Waters, “Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based,” in Proceedings of the 33rd Annual Cryptology Conference, 2013, pp. 75-92.
32. J. Alperin-Sheriff and C. Peikert, “Faster bootstrapping with polynomial error,” Lecture Notes in Computer Science, 2014, pp. 297-314.
33. L. Ducas and D. Micciancio, “FHEW: Bootstrapping homomorphic encryption in less than a second,” in Proceedings of EUROCRYPT, LNCS, 2015, pp. 617-640.
34. R. Hiromasa, M. Abe, and T. Okamoto, “Packing messages and optimizing bootstrapping in GSW-FHE,” in Proceedings of the 18th International Conference on Practice and Theory in Public-Key Cryptography, 2015, pp. 699-715.