Skip to main content

A Survey of Various Cryptographic Techniques: From Traditional Cryptography to Fully Homomorphic Encryption

  • Conference paper
  • First Online:
Innovations in Computer Science and Engineering

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 74))

Abstract

With the advent in Internet and networking applications, security is a major concern in the current era of Information Technology. The huge amount of information exchanged over the Internet is vulnerable to security threats and attacks. Cryptography provides secure exchange of encrypted data by sharing a key. The major concern with this approach is data privacy as anybody with the key can access the data. Moreover, user loses control over data once it is uploaded to the cloud and must rely on cloud service provider. User must share a key with cloud service provider to perform any operations like searching, sorting, etc., or need to download and decrypt the data and then perform the operation. These approaches lead to privacy issue and repeated encryption decryption, even for small computation. These concerns are addressed by Homomorphic Encryption (HE), which enables the cloud service provider to carry out computations on ciphered data without decrypting it. With the advent of HE scheme, in 2009, the Fully Homomorphic Encryption (FHE) scheme was invented by C. Gentry, which allows any computational function to operate on encrypted data. But the practical implementation of FHE is still in research. This survey focuses on various traditional and modern cryptography techniques along with the different schemes of HE and FHE.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Kats J, Lindell Y (2014) Introduction to modern cryptography. In: Cryptography and network security. Chapman & Hall/CRC. ISBN:- 13: 978-1-58488-551-1

    Google Scholar 

  2. Stallings W Cryptography and network security: principles and practice, 5th edn, Pearson

    Google Scholar 

  3. Forouzan BA Cryptography and network security. Tata McGraw Hill

    Google Scholar 

  4. Katz J, Lindell Y Introduction to modern cryptography. In: Cryptography and network security. Chapman & Hall/CRC

    Google Scholar 

  5. Yi X, Paulet R, Bertino E (2014) Homomorphic encryption: chapter-2. In: Homomorphic Encryption and Applications. Springer briefs in computer science, pp 27–46

    Google Scholar 

  6. Goldwasser S, Micali S (1984) Probabilistic encryption. J Comput Syst Sci 28:270–299

    Article  MathSciNet  Google Scholar 

  7. ElGamal T (1985) A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31(4):469–472

    Google Scholar 

  8. Paillier P (1999) Public key cryptosystems based on composite degree residue classes. In: Proceedings of advances in cryptology, EUROCRYPT’99, pp 223–238

    Google Scholar 

  9. Okamoto T, Uchiyama S (1998) A new public-key cryptosystem as secure as factoring. In: Proceedings of advances in cryptology, EUROCRYPT’98, pp 308–318

    Google Scholar 

  10. Boneh D, Goh E, Nissim K (2005) Evaluating 2-DNF formulas on ciphertexts. In: Proceedings of theory of cryptography, TCC’05, pp 325–341

    Google Scholar 

  11. Acar A, Aksu H, Uluagac AS (2017) A survey on homomorphic encryption schemes: theory and implementation. ACM CSUR

    Google Scholar 

  12. Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of STOC’09, pp 169–178

    Google Scholar 

  13. Van Dijk M, Gentry C, Halevi S, Vaikuntanathan V (2010) Fully homomorphic encryption over the integers. In: Advances in cryptology–EUROCRYPT, pp 24–43. Springer

    Google Scholar 

  14. Galbraith SD, Gebregiyorgis SW, Murphy S (2016) Algorithms for the approximate common divisor problem. LMS J Comput Math 19:58–72

    Article  MathSciNet  Google Scholar 

  15. Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM (JACM) 56(6):34

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rashmi R. Salavi .

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

Salavi, R.R., Math, M.M., Kulkarni, U.P. (2019). A Survey of Various Cryptographic Techniques: From Traditional Cryptography to Fully Homomorphic Encryption. In: Saini, H., Sayal, R., Govardhan, A., Buyya, R. (eds) Innovations in Computer Science and Engineering. Lecture Notes in Networks and Systems, vol 74. Springer, Singapore. https://doi.org/10.1007/978-981-13-7082-3_34

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-7082-3_34

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-7081-6

  • Online ISBN: 978-981-13-7082-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics