Advertisement

Low-Size Cipher Text Homomorphic Encryption Scheme for Cloud Data

  • Manish M. PoteyEmail author
  • C. A. Dhote
  • Deepak H. Sharma
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 4)

Abstract

Data security is a major concern in cloud computing. It must satisfy three goals of security in computing—integrity, confidentiality, and availability. User or cloud service provider (CSP) can perform operations on cloud data without performing decryption by using homomorphic encryption. Many algorithms are available for homomorphic encryption. These algorithms are generating large size cipher text. In this chapter, small-size cipher text homomorphic encryption algorithm is proposed. This scheme is a modified scheme proposed by Dijk et al. The experimentation is performed on data stored on DynamoDB of Amazon Web Services (AWS) public cloud. All arithmetic computations are performed on low-size encrypted data. Data can be downloaded on users machine as per the requirement and then decrypt it.

Keywords

Data security Cloud computing Homomorphic encryption AWS DynamoDB CSP Security goals 

References

  1. 1.
    S. Kumaraswamy, Tim Mather, and Latif S., “Cloud security and privacy: an enterprise perspective on risks and compliance”. “ O’Reilly Media, Inc.”, 2009.Google Scholar
  2. 2.
    Gentry, Craig, and Shai Halevi. “Implementing Gentry’s fully-homomorphic encryption scheme.” Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer Berlin Heidelberg, 2011.Google Scholar
  3. 3.
    Gentry, C. (2009). “A fully homomorphic encryption scheme (Doctoral dissertation, Stanford University)”.Google Scholar
  4. 4.
    Ronald Rivest, Michael and Len Adleman. Dertouzos. “On data banks and privacy homomorphisms”, Foundations of secure computation 4, 1978.Google Scholar
  5. 5.
    Fontaine, Galand, and Caroline, “A survey of homomorphic encryption for nonspecialists.” EURASIP Journal on Information Security 2007 (2009).Google Scholar
  6. 6.
    Atayero, A. A., & Feyisetan, O. (2011). “Security issues in cloud computing: The potentials of homomorphic encryption”. Journal of Emerging Trends in Computing and Information Sciences, 2(10), 546–552.Google Scholar
  7. 7.
    Shafi Goldwasser & Silvio Micali (1984). “Probabilistic encryption”. Journal of computer and system sciences, 28(2), 270–299.Google Scholar
  8. 8.
    Van Dijk, Vaikuntanathan, Shai Halevi, and Gentry, “Fully homomorphic encryption over the integers.” In Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer Berlin Heidelberg, 2010.Google Scholar
  9. 9.
    Smart, N. P., & Vercauteren, F. (2010, May). “Fully homomorphic encryption with relatively small key and cipher text sizes”. In International Workshop on Public Key Cryptography Springer Berlin Heidelberg.Google Scholar
  10. 10.
    D. Stehlé & R. Steinfeld (2010, December). “Faster fully homomorphic encryption”. In International Conference on the Theory and Application of Cryptology and Information Security Springer Berlin Heidelberg.Google Scholar
  11. 11.
    J. S. Coron, A. Mandal, D. Naccache & M. Tibouchi (2011, August). Fully homomorphic encryption over the integers with shorter public keys. In Annual Cryptology Conference. Springer Berlin Heidelberg.Google Scholar
  12. 12.
    R. Y. Govinda, and K. Vijaya. “Efficient public key homomorphic encryption over integer plaintexts.” International Conference on Information Security and Intelligence Control (ISIC), 2012, IEEE, 2012.Google Scholar
  13. 13.
    M. Moayedfard and A. S. Molahosseini, “Parallel implementations of somewhat homomorphic encryption based on Open-MP and CUDA,” 2015 International Congress on Technology, Communication and Knowledge (ICTCK), Mashhad, 2015.Google Scholar
  14. 14.
    Hayward, Ryan, and Chia-Chu Chiang. “An Architecture for Parallelizing Fully Homomorphic Cryptography on Cloud.” Complex, Intelligent, and Software Intensive Systems (CISIS), 2013 Seventh International Conference on. IEEE, 2013.Google Scholar
  15. 15.
    Z. Brakerski & V. Vaikuntanathan (2011, August). Fully homomorphic encryption from ring-LWE and security for key dependent messages. In Proceedings of the 31st annual conference on Advances in cryptology (pp. 505–524). Springer-Verlag.Google Scholar
  16. 16.

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • Manish M. Potey
    • 1
    Email author
  • C. A. Dhote
    • 2
  • Deepak H. Sharma
    • 1
  1. 1.Department of Computer EngineeringK. J. Somaiya College of EngineeringMumbaiIndia
  2. 2.Department of Information TechnologyPRMIT&RAmravatiIndia

Personalised recommendations