Skip to main content

2018 | OriginalPaper | Buchkapitel

Fully Homomorphic Encryption Scheme with Probabilistic Encryption Based on Euler’s Theorem and Application in Cloud Computing

verfasst von : Vinod Kumar, Rajendra Kumar, Santosh Kumar Pandey, Mansaf Alam

Erschienen in: Big Data Analytics

Verlag: Springer Singapore

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Homomorphic encryption is an encryption scheme that allows different operations on encrypted data and produces the same result as well that the operations performed on the plaintext. Homomorphic encryption can be used to enhance the security measure of un-trusted systems which manipulates and stores sensitive data. Therefore, homomorphic encryption can be used in cloud computing environment for ensuring the confidentiality of processed data. In this paper, we propose a fully Homomorphic Encryption Scheme with probabilistic encryption for better security in cloud computing.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Chen, L., Gao, C.M.: Public key homomorphism based on modified ElGamal in real domain. In: 2008 International Conference on Computer Science and Software Engineering. IEEE Computer Society, Wuhan, Hubei, China, pp. 802–805 (2008) Chen, L., Gao, C.M.: Public key homomorphism based on modified ElGamal in real domain. In: 2008 International Conference on Computer Science and Software Engineering. IEEE Computer Society, Wuhan, Hubei, China, pp. 802–805 (2008)
2.
Zurück zum Zitat Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Public Key Cryptography—PKC’10, vol. 6056 of Lecture Notes in Computer Science, pp. 420–443. Springer, 2010 Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Public Key Cryptography—PKC’10, vol. 6056 of Lecture Notes in Computer Science, pp. 420–443. Springer, 2010
3.
Zurück zum Zitat Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Symposium on the Theory of Computing (STOC), pp. 169–178 (2009) Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Symposium on the Theory of Computing (STOC), pp. 169–178 (2009)
4.
Zurück zum Zitat Gentry, C., Halevi, S.: Implementing gentry’s fully-homomorphic encryption scheme. Adv. Cryptol EUROCRYPT 2011, pp. 129–148 (2011) Gentry, C., Halevi, S.: Implementing gentry’s fully-homomorphic encryption scheme. Adv. Cryptol EUROCRYPT 2011, pp. 129–148 (2011)
5.
Zurück zum Zitat Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, submitted to the department of computer science and the committee on graduate Stanford University, September (2009) Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, submitted to the department of computer science and the committee on graduate Stanford University, September (2009)
6.
Zurück zum Zitat Van Dijk, M., Gentry, C., et al.: Fully homomorphic encryption over the integers. In: Advances in Cryptology EUROCRYPT 2010 Van Dijk, M., Gentry, C., et al.: Fully homomorphic encryption over the integers. In: Advances in Cryptology EUROCRYPT 2010
7.
Zurück zum Zitat Xiang, G., Cui, Z.: The algebra homomorphic encryption scheme based on Fermat’s little theorem. In: International Conference on Communication Systems and Network Technologies (CSNT), pp. 978–981, 11–13 May 2012 (2012) Xiang, G., Cui, Z.: The algebra homomorphic encryption scheme based on Fermat’s little theorem. In: International Conference on Communication Systems and Network Technologies (CSNT), pp. 978–981, 11–13 May 2012 (2012)
8.
Zurück zum Zitat Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: Proceedings of the 14th ACM Symposium on the Theory of Computing (STOC ’82), pp. 365–377, New York, NY, USA (1982) Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: Proceedings of the 14th ACM Symposium on the Theory of Computing (STOC ’82), pp. 365–377, New York, NY, USA (1982)
9.
Zurück zum Zitat Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Advances in Cryptology (EUROCRYPT ’98), vol. 1403 of Lecture Notes in Computer Science, pp. 308–318. Springer, New York (1998) Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Advances in Cryptology (EUROCRYPT ’98), vol. 1403 of Lecture Notes in Computer Science, pp. 308–318. Springer, New York (1998)
10.
Zurück zum Zitat Van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Advances in Cryptology EUROCRYPT 2010, p. 24-4 (2010) Van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Advances in Cryptology EUROCRYPT 2010, p. 24-4 (2010)
11.
Zurück zum Zitat Yu, Y., Leiwo, J., Premkumar, B.: A study on the security of privacy homomorphism‖, Nanyang Technological University, School of Computer Engineering. In: Proceedings of the Third International Conference on Information Technology: New Generations (ITNG’06), IEEE (2006) Yu, Y., Leiwo, J., Premkumar, B.: A study on the security of privacy homomorphism‖, Nanyang Technological University, School of Computer Engineering. In: Proceedings of the Third International Conference on Information Technology: New Generations (ITNG’06), IEEE (2006)
Metadaten
Titel
Fully Homomorphic Encryption Scheme with Probabilistic Encryption Based on Euler’s Theorem and Application in Cloud Computing
verfasst von
Vinod Kumar
Rajendra Kumar
Santosh Kumar Pandey
Mansaf Alam
Copyright-Jahr
2018
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-6620-7_58

Premium Partner