Skip to main content
Erschienen in: Soft Computing 24/2019

23.02.2019 | Methodologies and Application

An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment

verfasst von: Chandrashekhar Meshram, Cheng-Chi Lee, Sarita Gajbhiye Meshram, Muhammad Khurram Khan

Erschienen in: Soft Computing | Ausgabe 24/2019

Einloggen

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

search-config
loading …

Abstract

The advancement of the cloud storage technology opens up a wide range of possibilities for adaptable data sharing. When sharing data to an extensive number of users with fuzzy identities, the data proprietor must use an appropriate identity-based encryption technique that satisfies both efficiency and security prerequisites. Identity-based encryption is a promising possibility to ensure fuzzy user data sharing while meeting the security essentials; however, it may encounter efficiency trouble in multi-receiver settings. Recently, identity-based encryption has received much attention, and most of the research has aimed to apply the technique in real-world systems. A major concern about using identity-based encryption is the safety of the private keys, as disclosure of secret keys requires the reissuing of encryptions already doled out. The capability to minimize the risks associated with key disclosure is particularly important due to the increased use of mobile and unprotected devices. In this article, we shall propose a forward-secure identity-based encryption technique based on subtree for fuzzy user data sharing under cloud computing environment, and we shall demonstrate that the technique is semantically secure against a chosen subtree and chosen ciphertext attack (IND-CST–CCA). In addition, we will show the superiority of our new technique over the currently existing methods in terms of security and the length of public key. Then, we will also discuss the potential of our new technique to be deployed in pay TV systems and grid security.

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 "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!

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!

Literatur
Zurück zum Zitat Abe M, Cui Y, Imai H, Kiltz E (2010) Efficient hybrid encryption from ID-based encryption. Des Codes Cryptogr 54:205–240MathSciNetCrossRef Abe M, Cui Y, Imai H, Kiltz E (2010) Efficient hybrid encryption from ID-based encryption. Des Codes Cryptogr 54:205–240MathSciNetCrossRef
Zurück zum Zitat Benasser A, Samsudin A (2010) A new identity based encryption (IBE) scheme using extended Chebyshev polynomial over finite fields Z. Phys Lett A 374(46):4670–4674MathSciNetCrossRef Benasser A, Samsudin A (2010) A new identity based encryption (IBE) scheme using extended Chebyshev polynomial over finite fields Z. Phys Lett A 374(46):4670–4674MathSciNetCrossRef
Zurück zum Zitat Boneh D, Boyen X (2004) Efficient selective-id secure identity based encryption without random oracles. In: Advances in cryptology-EUROCRYPT 2004, Lecture Notes in Computer Science, vol 3027. Springer, Berlin, pp 223–238 Boneh D, Boyen X (2004) Efficient selective-id secure identity based encryption without random oracles. In: Advances in cryptology-EUROCRYPT 2004, Lecture Notes in Computer Science, vol 3027. Springer, Berlin, pp 223–238
Zurück zum Zitat Boneh D, Franklin MK (2001) Identity-based encryption from the weil pairing. In: Advances in cryptology-CRYPTO 2001, Lecture Notes in Computer Science, vol 2193. Springer, Berlin, pp 213–229 Boneh D, Franklin MK (2001) Identity-based encryption from the weil pairing. In: Advances in cryptology-CRYPTO 2001, Lecture Notes in Computer Science, vol 2193. Springer, Berlin, pp 213–229
Zurück zum Zitat Boneh D, Canetti R, Halevi S, Katz J (2003) Chosen-ciphertext security from identity-based encryption. SIAM J Comput 36(5):1301–1328MathSciNetCrossRef Boneh D, Canetti R, Halevi S, Katz J (2003) Chosen-ciphertext security from identity-based encryption. SIAM J Comput 36(5):1301–1328MathSciNetCrossRef
Zurück zum Zitat Boneh D, Gentry C, Hamburg M (2008) Space-efficient identity based encryption without pairings. In: Proceedings of the 49th annual IEEE symposium on foundations of computer science, pp 647–657 Boneh D, Gentry C, Hamburg M (2008) Space-efficient identity based encryption without pairings. In: Proceedings of the 49th annual IEEE symposium on foundations of computer science, pp 647–657
Zurück zum Zitat Cao N, Wang C, Li M, Ren K, Lou W (2014) Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans Parallel Distrib Syst 25(1):222–233CrossRef Cao N, Wang C, Li M, Ren K, Lou W (2014) Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans Parallel Distrib Syst 25(1):222–233CrossRef
Zurück zum Zitat Chen HC (2016) A trusted user-to-role and role-to-key access control scheme. Soft Comput 20(5):1721–1733CrossRef Chen HC (2016) A trusted user-to-role and role-to-key access control scheme. Soft Comput 20(5):1721–1733CrossRef
Zurück zum Zitat Chen R, Mu Y, Yang G, Guo F, Wang X (2015) A new general framework for secure public key encryption with keyword search. In: 20th Australasian conference on information security and privacy (ACISP 2015), Brisbane, QLD, Australia, LNCS, vol 9144. Springer, Berlin Chen R, Mu Y, Yang G, Guo F, Wang X (2015) A new general framework for secure public key encryption with keyword search. In: 20th Australasian conference on information security and privacy (ACISP 2015), Brisbane, QLD, Australia, LNCS, vol 9144. Springer, Berlin
Zurück zum Zitat Deng H, Wu Q, Qin B, Domingo-Ferrer J, Zhang L, Liu J, Shi W (2014) Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts. Inf Sci 275:370–384MathSciNetCrossRef Deng H, Wu Q, Qin B, Domingo-Ferrer J, Zhang L, Liu J, Shi W (2014) Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts. Inf Sci 275:370–384MathSciNetCrossRef
Zurück zum Zitat ElGmal T (1995) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31:469–472MathSciNetCrossRef ElGmal T (1995) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31:469–472MathSciNetCrossRef
Zurück zum Zitat Fang L, Susilo W, Ge C, Wang J (2013) Public key encryption with keyword search secure against keyword guessing attack without random oracle. Inf Sci 238:221–241MathSciNetCrossRef Fang L, Susilo W, Ge C, Wang J (2013) Public key encryption with keyword search secure against keyword guessing attack without random oracle. Inf Sci 238:221–241MathSciNetCrossRef
Zurück zum Zitat Fujisaki E, Okamoto T (1999) Secure integration of asymmetric and symmetric encryption schemes. In: Advances in Cryptology-Crypto’99, Lecture Notes in Computer Science, vol 1666. Springer, Berlin, pp 537–554 Fujisaki E, Okamoto T (1999) Secure integration of asymmetric and symmetric encryption schemes. In: Advances in Cryptology-Crypto’99, Lecture Notes in Computer Science, vol 1666. Springer, Berlin, pp 537–554
Zurück zum Zitat Galindo D (2015) Compact hierarchical identity-based encryption based on a harder decisional problem. Int J Comput Math 92(3):463–472MathSciNetCrossRef Galindo D (2015) Compact hierarchical identity-based encryption based on a harder decisional problem. Int J Comput Math 92(3):463–472MathSciNetCrossRef
Zurück zum Zitat Gentry C, Silverberg A (2002) Hierarchical id-based cryptography. In: ASIACRYPT 2002, LNCS, vol 2501. Springer, Berlin, pp 548–566 Gentry C, Silverberg A (2002) Hierarchical id-based cryptography. In: ASIACRYPT 2002, LNCS, vol 2501. Springer, Berlin, pp 548–566
Zurück zum Zitat Heng S, Kurosawa K (2004) k-Resilient identity-based encryption in the standard model. In: Topics in Cryptology- CT-RSA 2004, Lecture Notes in Computer Science, vol 2964. Springer, Berlin, pp 67–80 Heng S, Kurosawa K (2004) k-Resilient identity-based encryption in the standard model. In: Topics in Cryptology- CT-RSA 2004, Lecture Notes in Computer Science, vol 2964. Springer, Berlin, pp 67–80
Zurück zum Zitat Heng S, Kurosawa K (2006) k-Resilient identity-based encryption in the standard model. IEICE Trans Fundam E89CA(1):39–46CrossRef Heng S, Kurosawa K (2006) k-Resilient identity-based encryption in the standard model. IEICE Trans Fundam E89CA(1):39–46CrossRef
Zurück zum Zitat Huang X, Liu JK, Hua S, Xiang Y, Liang K, Zhou J (2015) Cost-effective authentic and anonymous data sharing with forward security. IEEE Trans Comput 64(4):971–983MathSciNetCrossRef Huang X, Liu JK, Hua S, Xiang Y, Liang K, Zhou J (2015) Cost-effective authentic and anonymous data sharing with forward security. IEEE Trans Comput 64(4):971–983MathSciNetCrossRef
Zurück zum Zitat Katz J, MacKenzie P, Taban G, Gligor V (2012) Two-server password-only authenticated key exchange. J Comput Syst Sci 78(2):651–669MathSciNetCrossRef Katz J, MacKenzie P, Taban G, Gligor V (2012) Two-server password-only authenticated key exchange. J Comput Syst Sci 78(2):651–669MathSciNetCrossRef
Zurück zum Zitat Liu C, Zhu L, Wang M, Tan Y (2014) Search pattern leakage in searchable encryption: attacks and new construction. Inf Sci 265:176–188CrossRef Liu C, Zhu L, Wang M, Tan Y (2014) Search pattern leakage in searchable encryption: attacks and new construction. Inf Sci 265:176–188CrossRef
Zurück zum Zitat Luo S, Shen Q, Jin Y, Chen Y (2011) A variant of Boyen–Waters anonymous IBE scheme. In: Lecture Notes in Computer Sciences, vol 7043, pp 42–56 Luo S, Shen Q, Jin Y, Chen Y (2011) A variant of Boyen–Waters anonymous IBE scheme. In: Lecture Notes in Computer Sciences, vol 7043, pp 42–56
Zurück zum Zitat Ma S (2016) Identity-based encryption with outsourced equality test in cloud computing. Inf Sci 328:389–402CrossRef Ma S (2016) Identity-based encryption with outsourced equality test in cloud computing. Inf Sci 328:389–402CrossRef
Zurück zum Zitat Mao Y, Li J, Chen MR, Liu J, Xie C, Zhan Y (2016) Fully secure fuzzy identity-based encryption for secure IoT communications. Comput Stand Interfaces 44:117–121CrossRef Mao Y, Li J, Chen MR, Liu J, Xie C, Zhan Y (2016) Fully secure fuzzy identity-based encryption for secure IoT communications. Comput Stand Interfaces 44:117–121CrossRef
Zurück zum Zitat Meshram C (2015) An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem. Inf Process Lett 115(2):351–358MathSciNetCrossRef Meshram C (2015) An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem. Inf Process Lett 115(2):351–358MathSciNetCrossRef
Zurück zum Zitat Meshram C, Meshram S (2011) An identity based beta cryptosystem. In: IEEE proceedings of 7th international conference on information assurance and security (IAS 2011) Dec 5–8, pp 298–303 Meshram C, Meshram S (2011) An identity based beta cryptosystem. In: IEEE proceedings of 7th international conference on information assurance and security (IAS 2011) Dec 5–8, pp 298–303
Zurück zum Zitat Meshram C, Meshram S (2013) An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem. Inf Process Lett 113(10–11):375–380MathSciNetCrossRef Meshram C, Meshram S (2013) An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem. Inf Process Lett 113(10–11):375–380MathSciNetCrossRef
Zurück zum Zitat Meshram C, Meshram SA (2017) Constructing new an ID-based cryptosystem for IFP and GDLP based cryptosystem. J Discrete Math Sci Cryptogr 20(5):1121–1134MathSciNetCrossRef Meshram C, Meshram SA (2017) Constructing new an ID-based cryptosystem for IFP and GDLP based cryptosystem. J Discrete Math Sci Cryptogr 20(5):1121–1134MathSciNetCrossRef
Zurück zum Zitat Meshram C, Obaidat MS (2015) An ID-based quadratic-exponentiation randomized cryptographic scheme. In: IEEE proceeding of international conference on computer, information and telecommunication systems, (2015), pp 1–5 Meshram C, Obaidat MS (2015) An ID-based quadratic-exponentiation randomized cryptographic scheme. In: IEEE proceeding of international conference on computer, information and telecommunication systems, (2015), pp 1–5
Zurück zum Zitat Meshram C, Powar PL (2016) An efficient identity-based QER cryptographic scheme. Complex Intell Syst 2(4):285–291CrossRef Meshram C, Powar PL (2016) An efficient identity-based QER cryptographic scheme. Complex Intell Syst 2(4):285–291CrossRef
Zurück zum Zitat Meshram C, Meshram S, Zhang M (2012a) An ID-based cryptographic mechanisms based on GDLP and IFP. Inf Process Lett 112(19):753–758MathSciNetCrossRef Meshram C, Meshram S, Zhang M (2012a) An ID-based cryptographic mechanisms based on GDLP and IFP. Inf Process Lett 112(19):753–758MathSciNetCrossRef
Zurück zum Zitat Meshram C, Huang X, Meshram S (2012b) New Identity-based cryptographic scheme for IFP and DLP based cryptosystem. Int J Pure Appl Math 81(1):65–79MATH Meshram C, Huang X, Meshram S (2012b) New Identity-based cryptographic scheme for IFP and DLP based cryptosystem. Int J Pure Appl Math 81(1):65–79MATH
Zurück zum Zitat Meshram C, Powar PL, Obaidat MS, Lee CC (2016) An IBE technique using partial discrete logarithm. Procedia Comput Sci 93:735–741CrossRef Meshram C, Powar PL, Obaidat MS, Lee CC (2016) An IBE technique using partial discrete logarithm. Procedia Comput Sci 93:735–741CrossRef
Zurück zum Zitat Meshram C, Tseng YM, Lee CC, Meshram SG (2017a) An IND-ID-CPA secure ID-based cryptographic protocol using GDLP and IFP. Informatica 28(3):471–484MathSciNetCrossRef Meshram C, Tseng YM, Lee CC, Meshram SG (2017a) An IND-ID-CPA secure ID-based cryptographic protocol using GDLP and IFP. Informatica 28(3):471–484MathSciNetCrossRef
Zurück zum Zitat Meshram C, Lee CC, Li CT, Chen CL (2017b) A secure key authentication scheme for cryptosystems based on GDLP and IFP. Soft Comput 21(24):7285–7291CrossRef Meshram C, Lee CC, Li CT, Chen CL (2017b) A secure key authentication scheme for cryptosystems based on GDLP and IFP. Soft Comput 21(24):7285–7291CrossRef
Zurück zum Zitat Meshram C, Obaidat MS, Meshram SG (2018c) Chebyshev chaotic maps based ID-based cryptographic model using subtree and fuzzy-entity data sharing for public key cryptography. Secur Priv 1(1):e12CrossRef Meshram C, Obaidat MS, Meshram SG (2018c) Chebyshev chaotic maps based ID-based cryptographic model using subtree and fuzzy-entity data sharing for public key cryptography. Secur Priv 1(1):e12CrossRef
Zurück zum Zitat Meshram C, Powar PL, Obaidat MS, Lee CC, Meshram SG (2018d) Efficient online/offline IBSS protocol using partial discrete logarithm for WSNs. IET Netw 7(6):363–367CrossRef Meshram C, Powar PL, Obaidat MS, Lee CC, Meshram SG (2018d) Efficient online/offline IBSS protocol using partial discrete logarithm for WSNs. IET Netw 7(6):363–367CrossRef
Zurück zum Zitat Orencik C, Selcuk A, Savas E, Kantarcioglu M (2016) Multi-keyword search over encrypted data with scoring and search pattern obfuscation. Int J Inf Secur 15(3):251–269CrossRef Orencik C, Selcuk A, Savas E, Kantarcioglu M (2016) Multi-keyword search over encrypted data with scoring and search pattern obfuscation. Int J Inf Secur 15(3):251–269CrossRef
Zurück zum Zitat Shamir A (1984) Identity-based cryptosystems and signature schemes. In: Proceedings of CRYPTO’84, Lecture Notes in Computer Science, vol 196, pp 47–53 Shamir A (1984) Identity-based cryptosystems and signature schemes. In: Proceedings of CRYPTO’84, Lecture Notes in Computer Science, vol 196, pp 47–53
Zurück zum Zitat Sun W, Lou W, Hou Y, Li H (2014) Privacy-preserving keyword search over encrypted data in cloud computing. Secur Cloud Comput (Springer, Berlin) 2014:189–212CrossRef Sun W, Lou W, Hou Y, Li H (2014) Privacy-preserving keyword search over encrypted data in cloud computing. Secur Cloud Comput (Springer, Berlin) 2014:189–212CrossRef
Zurück zum Zitat Tsujii S, Itoh T (1989) An ID-based cryptosystem based on the discrete logarithm problem. IEEE J Sel Areas Commun 7:467–473CrossRef Tsujii S, Itoh T (1989) An ID-based cryptosystem based on the discrete logarithm problem. IEEE J Sel Areas Commun 7:467–473CrossRef
Zurück zum Zitat Waters B (2005) Efficient identity-based encryption without random oracles. In: Advances in cryptology-CRYPTO 2005, Lecture Notes in Computer Science. Springer, Berlin, pp 114–127 Waters B (2005) Efficient identity-based encryption without random oracles. In: Advances in cryptology-CRYPTO 2005, Lecture Notes in Computer Science. Springer, Berlin, pp 114–127
Zurück zum Zitat Xu P, Cui G, Lei F (2008) An efficient and provably secure IBE scheme without bilinear map. J Comput Res Dev 45(10):1687–1695 Xu P, Cui G, Lei F (2008) An efficient and provably secure IBE scheme without bilinear map. J Comput Res Dev 45(10):1687–1695
Zurück zum Zitat Xu P, Cui G, Fu C, Tang X (2010) A more efficient accountable authority IBE scheme under the DL assumption. Sci China 53(3):581–592MathSciNetCrossRef Xu P, Cui G, Fu C, Tang X (2010) A more efficient accountable authority IBE scheme under the DL assumption. Sci China 53(3):581–592MathSciNetCrossRef
Zurück zum Zitat Xu P, Jin H, Wu Q, Wang W (2013) Public-key encryption with fuzzy keyword search: a provably secure scheme under keyword guessing attack. IEEE Trans Comput 62:2266–2277MathSciNetCrossRef Xu P, Jin H, Wu Q, Wang W (2013) Public-key encryption with fuzzy keyword search: a provably secure scheme under keyword guessing attack. IEEE Trans Comput 62:2266–2277MathSciNetCrossRef
Zurück zum Zitat Yang X, Wu L, Zhang M, Wei P, Wei L (2011) An ideal lattice based IBE scheme in the standard model. Wuhan Univ J Nat Sci 16(5):439–446MathSciNetCrossRef Yang X, Wu L, Zhang M, Wei P, Wei L (2011) An ideal lattice based IBE scheme in the standard model. Wuhan Univ J Nat Sci 16(5):439–446MathSciNetCrossRef
Zurück zum Zitat Yu Y, Ni J, Yang H, Mu Y, Susilo W (2014) Efficient public key encryption with revocable keyword search. Secur Commun Netw 7(2):466–472CrossRef Yu Y, Ni J, Yang H, Mu Y, Susilo W (2014) Efficient public key encryption with revocable keyword search. Secur Commun Netw 7(2):466–472CrossRef
Zurück zum Zitat Zhang L, Wu Q, Domingo-Ferrer J, Qin B, Zeng P (2014) Signatures in hierarchical certificateless cryptography: efficient constructions and provable security. Inf Sci 272:223–237MathSciNetCrossRef Zhang L, Wu Q, Domingo-Ferrer J, Qin B, Zeng P (2014) Signatures in hierarchical certificateless cryptography: efficient constructions and provable security. Inf Sci 272:223–237MathSciNetCrossRef
Zurück zum Zitat Zheng M, Xiang Y, Zhou H (2015) A strong provably secure IBE scheme without bilinear map. J Comput Syst Sci 81:125–131MathSciNetCrossRef Zheng M, Xiang Y, Zhou H (2015) A strong provably secure IBE scheme without bilinear map. J Comput Syst Sci 81:125–131MathSciNetCrossRef
Metadaten
Titel
An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment
verfasst von
Chandrashekhar Meshram
Cheng-Chi Lee
Sarita Gajbhiye Meshram
Muhammad Khurram Khan
Publikationsdatum
23.02.2019
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 24/2019
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-019-03855-1

Weitere Artikel der Ausgabe 24/2019

Soft Computing 24/2019 Zur Ausgabe

Premium Partner