Abstract
Cloud computing, a modern application that is very commonly utilized, has garnered considerable interest from researchers and developers. Data privacy security is the most urgent issue related to cloud computing. Studies have shown that fully homomorphic encryption (FHE) technology, which is related to traditional encryption and ciphertext evaluation, is an effective way of securing privacy in the cloud. This study proposes a policy-based, multi-user, FHE algorithm (PB-MUFHE) that accounts for user diversity in the cloud environment, in which, the encrypted data is set under an appropriate access policy, the key to which is a set attribute. Not only is homomorphic evaluation supported for ciphertexts among several users, but also fine-grained access control and sharing between users are supported. The security of the PB-MUFHE scheme was tested based on learning with errors (LWE) problems, and IND-CPA security analysis in the generic bilinear group random oracle model further verified the proposed algorithm’s effectiveness. Performance assessment demonstrated that, PB-MUFHE can efficiently implement fully homomorphic evaluation of ciphertext, and effectively support access control and shared multi-user capability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Wu, Y., Lin, N., Song, W., et al.: Adaptive authorization access method for medical cloud data based on attribute encryption. In: Ni, W., Wang, X., Song, W., Li, Y. (eds.) WISA 2019. LNCS, vol. 11817, pp. 361–367. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-30952-7_36
Craig, G.C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Syposium on Theory of Computing, pp. 169–178. ACM, New York (2009)
Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505–524. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22792-9_29
Coron, J.S., Lepoint, T., Tibouchi, M.: Batch fully homomorphic encryption over the integers. In: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 315–335, Springer Verlag, Athens (2013). https://doi.org/10.1007/978-3-642-38348-9_20
Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard)LWE. In: Proceedings of the 52nd Annual Symposium on Foundations of Computer Science, pp. 97–106, IEEE, Washington (2011)
Bos, J.W., Lauter, K., Loftus, J., Naehrig, M.: Improved security for a ring-based fully homomorphic encryption scheme. In: Stam, Martijn (ed.) IMACC 2013. LNCS, vol. 8308, pp. 45–64. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-45239-0_4
Feng, Y.S., Ma, H., Chen, X.F.: Efficient and verifiable outsourcing scheme of sequence comparisons. Intellig. Automat. Soft Comput. 21(1), 51–63 (2015)
Lin, H.X.: Leveled certificateless fully homomorphic encryption schemes from learning with errors. IEEE Access 8, 26749–26763 (2020)
Peikert, C., Shiehian, S.: Multi-key FHE from LWE, revisited. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 217–238. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53644-5_9
Li, Z., Ma, C., Zhou, H.: Multi-key FHE for multi-bit messages. Sci. China Inf. Sci. 61(2), 029101:1-029101:3 (2018)
Clear, M., McGoldrick, C.: Multi-identity and multi-key leveled FHE from learning with errors. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 630–656. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48000-7_31
Clear, M., McGoldrick, C.: Bootstrappable identity-based fully homomorphic encryption. cryptology and network security. In: 13th International Conference on Cryptology and Network Security, pp. 1–14, Springer Verlag, Heraklion (2014)
Wang, F., Wang, K., Li, B.: An Efficient Leveled Identity-Based FHE. LNCS, pp. 303–315. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25645-0_20
Hu, M., Ye, Q., Tang, Y.: Efficient batch identity-based fully homomorphic encryption scheme in the standard model. IET Inf. Secur. 12(6), 475–483 (2018)
Luo, F., Wang, K., Lin, C.: Leveled hierarchical identity-based fully homomorphic encryption from learning with rounding. In: 14th International Conference on Information Security Practice and Experience, pp. 101–115, Springer Verlag, Tokyo (2018)
Shen, T., Wang, F., Chen, K., et al.: Efficient leveled (multi) identity-based fully homomorphic encryption schemes. IEEE Access 7, 79299–79310 (2019)
Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75–92. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40041-4_5
Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology – CRYPTO 2012, pp. 868–886. Springer Berlin Heidelberg, Berlin, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32009-5_50
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, T., Liu, Q., Huang, R. (2021). Multi-user Fully Homomorphic Encryption Scheme Based on Policy for Cloud Computing. In: **ng, C., Fu, X., Zhang, Y., Zhang, G., Borjigin, C. (eds) Web Information Systems and Applications. WISA 2021. Lecture Notes in Computer Science(), vol 12999. Springer, Cham. https://doi.org/10.1007/978-3-030-87571-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-030-87571-8_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-87570-1
Online ISBN: 978-3-030-87571-8
eBook Packages: Computer ScienceComputer Science (R0)
