Abstract
When sensitive data is stored on publicly available areas, privacy of that data becomes a concern. Organizations may wish to move data to public servers so the data is more accessible by their employees or consumers. It is important that this data be encrypted to ensure it remains confidential and secure. When this data is encrypted, it becomes difficult or impossible to perform calculations on a publicly stored database. A solution to this is homomorphic encryption, which allows an unlimited number of computations on encrypted data. This project analyzes an N-tier rotation scheme which allows an unlimited number of addition and subtractions of encrypted data, along with an unlimited number of scalar multiplications and divisions. This scheme is inspired by a combination lock and features multiple levels of security depth. The result of the proposed algorithm is a fast encryption scheme which allows data to be manipulated post encryption.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Barthelemy, L.: A brief survey of fully homomorphic encryption, computing on encrypted data, Quarkslab’s blog (2016). http://blog.quarkslab.com/a-brief-survey-of-fully-homomorphic-encryption-computing-on-encrypted-data.html
CIA, the world factbook, world (2016). https://www.cia.gov/library/publications/the-world-factbook/geos/xx.html
Gentry, C.: A fully homomorphic encryption scheme, Ph.D. Dissertation, Department of Computer Science, Stanford University, September 2009a
Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009, Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 169–178 (2009b)
Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Cryptography ePrint Archives, Report 2012/099 (2012)
Howard, R: Parallel processing of fully homomorphic encryption for a cloud environment. In: A thesis Submitted to the Graduate School of University of Arkansas at Little Rock, p. 38, May 2013
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Proceedings of the 18th EUROCRYPT, pp. 223–238, Prague, Czech Republic, May 1999
Pfleeger, C., Pfleeger, S.: Security in Computing. Prentice Hall PTR, Upper Saddle River (2006)
Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, pp. 113–124 (2011)
Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphism. Found. Secure Comput. 4(11), 169–180 (1978)
Warren, L.V.: AddSubMulDivia: Volume 5 – Homomorphic Shape Encryption, Kindkle edn. Amazon Digital Services LLC, Seattle (2016)
Wooldridge, Nivens, Chiang: Securing databases with a combination of encryption and information hiding. Computer Science Department at the University of Arkansas at Little Rock (2016)
Acknowledgments
We would like to make a special thanks to the Arkansas Department of Higher Education for providing funding for this research via the Student Undergraduate Research Fellowship. We would also like to thank the University of Arkansas at Little Rock for providing resources and a location for working.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Røset, C., Warren, V., Chiang, CC. (2017). Enhanced Database Security Using Homomorphic Encryption. In: Kim, K., Joukov, N. (eds) Information Science and Applications 2017. ICISA 2017. Lecture Notes in Electrical Engineering, vol 424. Springer, Singapore. https://doi.org/10.1007/978-981-10-4154-9_44
Download citation
DOI: https://doi.org/10.1007/978-981-10-4154-9_44
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-4153-2
Online ISBN: 978-981-10-4154-9
eBook Packages: EngineeringEngineering (R0)