Skip to main content

Homomorphic Encryption Scheme for Data Security in Cloud Using Compression Technique

  • Conference paper
  • First Online:
Soft Computing and Signal Processing

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 900))

  • 819 Accesses

Abstract

Data generation and consumption are becoming a main part of daily life. Huge volume of data is available over the Internet; preprocessing of these data is a challenging task. The data preprocessing is used to process the raw data into precise data and store in the cloud. Providing security to this data is another challenging issue. Earlier, data owners were not ready to send their data to centralized sites because of the privacy issue. Nowadays, two types of encryption techniques are applied to data stored in the cloud and data is more secured. In this paper, we proposed compressed homomorphic encryption technique (CHET) which combines the compression technique to encrypt the data so it reduces the file transfer time and encrypt time, and it provides security. Data owner can decrypt the data when required. The homomorphic function is allowed to compute encryption time. Our experiment results show that CHET outperforms 10% in compression and encryption time and provides high security than RSA and BGV.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in International Conference on the Theory and Applications of Cryp- tographic Techniques (Springer, Berlin, 1999), pp. 223–238

    Google Scholar 

  2. T. Elgamal, A public key cryptosystem and a signature scheme based on dis-crete logarithms. IEEE Trans. Inf. Theor. 31(4), 469–472 (1985). IEEE

    Article  MathSciNet  Google Scholar 

  3. E.F. Brickell, T. Yacobi, On privacy homomorphisms, in Workshop on the Theory and Application of of Cryptographic Techniques (Springer, Berlin, 1987), pp. 117–125

    Google Scholar 

  4. S. Fau, R. Sirdey, C. Fontaine, C. Aguilar-Melchor, G. Gogniat, Towards practical program execution over fully homomorphic encryption schemes, in Eighth International Conference P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC) (IEEE Press, 2003), pp. 284–290

    Google Scholar 

  5. G.V.S. Rao, G. Uma, An efficient secure message transmission in mobile ad hoc networks using enhanced homomorphic encryption scheme. Global J. Comput. Sci. Technol., 543–552 (2013)

    Google Scholar 

  6. M.J. Zaki, Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372–390 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. K. Chandrashekar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chandrashekar, D.K., Srikantaiah, K.C., Venugopal, K.R. (2019). Homomorphic Encryption Scheme for Data Security in Cloud Using Compression Technique. In: Wang, J., Reddy, G., Prasad, V., Reddy, V. (eds) Soft Computing and Signal Processing . Advances in Intelligent Systems and Computing, vol 900. Springer, Singapore. https://doi.org/10.1007/978-981-13-3600-3_24

Download citation

Publish with us

Policies and ethics