An identity-based encryption technique using subtree for fuzzy user data sharing under cloud computing environment
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.
KeywordsIdentity-based encryption Cloud storage Subtree Bilinear pairings Random oracle Pay TV system Grid security
The authors would like to thank anonymous reviewers of soft computing for their careful and helpful comments.
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- 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–238Google Scholar
- 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–229Google Scholar
- 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–657Google Scholar
- 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, BerlinGoogle Scholar
- 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–554Google Scholar
- Galindo D (2004) The exact security of pairing based encryption and signature schemes. Working Draft, November 1, 2004. http://www.cs.ru.nl/dgalindo/galindoEcrypt.pdf. Accessed 3–5 Nov 2004
- Gentry C, Silverberg A (2002) Hierarchical id-based cryptography. In: ASIACRYPT 2002, LNCS, vol 2501. Springer, Berlin, pp 548–566Google Scholar
- 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–80Google Scholar
- 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–56Google Scholar
- 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–303Google Scholar
- 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–5Google Scholar
- Shamir A (1984) Identity-based cryptosystems and signature schemes. In: Proceedings of CRYPTO’84, Lecture Notes in Computer Science, vol 196, pp 47–53Google Scholar
- 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–127Google Scholar
- Xu P, Cui G, Lei F (2008) An efficient and provably secure IBE scheme without bilinear map. J Comput Res Dev 45(10):1687–1695Google Scholar