Abstract
In the cloud storage service, according to the data on the cloud computing safety protection problem, the paper presents secure obfuscating homomorphism encryption scheme. Constructing a point function obfuscation that based on perfectly one way probability hash function in scheme, construction depends on hash function and the computational difficulty problems, then use the computational difficulty problems, to realize the encrypted homomorphism function, also guarantee the function of the point function obfuscator at the same time, the scheme raises the security of the encrypted data. This paper provides the security proof of the scheme, shows that the scheme is feasible.
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
Preview
Unable to display preview. Download preview PDF.
References
Rivest, R.L., Adleman, L., Dertouzos, M.L.: On Data Banks and Privacy Homeomorphisms. In: Foundations of Secure Computation, pp. 169–177 (1978)
Gentry, C.: Fully Homomrphic Encryption Using Ideal Lattices. In: ACM STOC 2009, pp. 169–178 (2009)
Gentry, C.: A Fully Homomorphic Encryption Scheme. Ph.D.Thesis, Stanford University (2009)
van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully Homomorphic Encryption over the Integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24–43. Springer, Heidelberg (2010)
Gentry, C., Halevi, S.: Implementing Gentry’s Fully-Homomorphic Encryption Scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129–148. Springer, Heidelberg (2011)
Canetti, R.: Towards Realizing Random Oracles: Hash Functions that Hide All Partial Information. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 455–469. Springer, Heidelberg (1997)
Canetti, R., Micciancio, D., Reingold, O.: Perfectly one-way probabilistic hash functions. In: 30th ACM Symposium on Theory of Computing, pp. 131–140. ACM Press (1998)
Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (Im)possibility of Obfuscating Programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1–18. Springer, Heidelberg (2001)
Zhou, Y.: Homomrphic cryptography research progress. China cryptography development report 2010, p. 169. Publishing House of Electronics Industry, Beijing (2010)
Bitansky, N., Canetti, R.: On Strong Simulation and Composable Point Obfuscation. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 520–537. Springer, Heidelberg (2010)
Lynn, B.Y.S., Prabhakaran, M., Sahai, A.: Positive Results and Techniques for Obfuscation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 20–39. Springer, Heidelberg (2004)
Wee, H.: On Obfuscation Point Funtions. In: Proceedings of the 37th ACM Symposium on Theory of Computing, pp. 523–532 (2005)
Canetti, R., Dakdouk, R.R.: Obfuscating Point Functions with Multibit Output. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 489–508. Springer, Heidelberg (2008)
Naor, M., Reingold, O.: The Brain can Compute Pseudo-Random Functions, Or Efficient Cryptographic Primitives Based on the Decisional Diffie-Hellman Assumption (manuscript)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao-xiang, G., Zheng, Y., Xiao, F. (2013). The Homomorphic Encryption Scheme of Security Obfuscation. In: Tan, T., Ruan, Q., Chen, X., Ma, H., Wang, L. (eds) Advances in Image and Graphics Technologies. IGTA 2013. Communications in Computer and Information Science, vol 363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37149-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-37149-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37148-6
Online ISBN: 978-3-642-37149-3
eBook Packages: Computer ScienceComputer Science (R0)