Abstract
The possibility of outsourcing computation to the cloud offers businesses and individuals substantial cost-savings, flexibility, and availability of computable resources, but potentially sacrifices privacy. Homomorphic encryption can help address this problem by allowing the user to upload encrypted data to the cloud, on which the cloud can then operate without having the secret key. The cloud can return encrypted outputs of computations to the user without decrypting the data, thus providing data hosting and services without compromising privacy.
First, we present a general framework introduced in [3] which extends a group homomorphic encryption scheme with respect to one operation towards a cryptosystem having homomorphic properties on both operations (i.e. addition and multiplication). Second, we describe the main contribution of this paper by showing how this framework can be applied to a well known homomorphic encryption scheme, Goldwasser-Micali, analyzing the proposed cryptosystem security and its possible applications.
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
References
Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169–179. Springer, Academia Press (1978)
Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009). http://crypto.stanford.edu/craig
Barcău, M., Paşol, V.: Fully Homomorphic Encryption from Monoid Algebras (2016)
Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984). Massachusetts Institute of Technology, Cambridge
Fellows, M., Koblitz, N.: Combinatorial cryptosystems galore! In: Finite Fields: Theory, Applications, and Algorithms. Contemporary Mathematics, vol. 168, pp. 51–61. AMS (1994)
Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267–288. Springer, Heidelberg (1998)
Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully homomorphic encryption without bootstrapping. In: Innovations in Theoretical Computer Science Conference, pp. 309–325 (2012)
Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Canetti, R., Safavi-Naini, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850–867. Springer, Heidelberg (2012)
Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. Des. Codes Crypt. 71, 57–81 (2012)
Halevi, S., Shoup, V.: The HElib library (2015). https://github.com/shaih/HElib
Grigoriev, D., Ponomarenko, I.: Homomorphic public-key cryptosystems over groups and rings. Quad. di Math. 13, 305–325 (2004)
Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory, 2nd edn. Springer, New York (2000)
Richman, F.: http://math.fau.edu/richman/jacobi.htm
Shoup, V.: NTL: A library for doing number theory (2001)
Acknowledgments
This research was partially supported by the Romanian National Authority for Scientific Research (CNCS-UEFISCDI) under the project PN-II-PT-PCCA-2011-3 (ctr. 19/2012).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Pleşca, C., Togan, M., Lupaşcu, C. (2016). Homomorphic Encryption Based on Group Algebras and Goldwasser-Micali Scheme. In: Bica, I., Reyhanitabar, R. (eds) Innovative Security Solutions for Information Technology and Communications. SECITC 2016. Lecture Notes in Computer Science(), vol 10006. Springer, Cham. https://doi.org/10.1007/978-3-319-47238-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-47238-6_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47237-9
Online ISBN: 978-3-319-47238-6
eBook Packages: Computer ScienceComputer Science (R0)