Chebyshev chaotic map‐based ID‐based cryptographic model using subtree and fuzzy‐entity data sharing for public key cryptography

Recently, chaos has been dealt with as a decent approach to reduce computational complexity while fulfilling security necessities of a cryptographic technique. Cloud storage brings strong conveniences for adaptable data sharing. When sharing data with a large number of entities described with fuzzy identities, the data proprietors must use an appropriate ID‐based cryptographic (IBC) technique to meet the security and efficiency prerequisites. IBC is a promising candidate to make sure fuzzy‐entity data sharing while meeting the security prerequisite, but encounters the efficiency difficulty in multi‐receiver settings. In IBC technique distributing public keys for individually entity, technique allows separately entity to select his/her network address or name as her/his public key. This is valuable to public key cryptographic (PKC) technique in light of the fact that the public key confirmation is so informal and direct. In such a mode, a huge public key document is not compulsory. Subsequently novel PKC technique dependably confront security encounters accordingly, the aim of this article is to outline and examination of conversion mechanism subtree and fuzzy‐entity data sharing that can transfer PKC's using Chebyshev chaotic map into the IBC technique as opposed to re‐concoct another framework. Also, no adjustment of the first Chebyshev chaotic map ‐ based PKC's is vital.