An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem.

*(English)*Zbl 1418.94057Summary: Recently, the chaos theory has been dealt with as a decent approach to reducing the computational complexity of a cryptographic technique while fulfilling the security necessities. In an ID-based cryptographic system where public keys are distributed to individual users, the application of chaotic maps allows users to set their network addresses or names as their individual public keys. This makes the public key cryptographic technique very user-friendly in that the public key confirmation process can be very informal and direct. In such a design, no huge public key database is required, and therefore, those security issues arising as a result of the existence of a public key database can be avoided. The aim of this article is to go deep into the possibility of transforming a chaotic-map-based cryptosystem into an ID-based technique without having to build a new framework from scratch or to do adjustment to the chaotic maps.

##### MSC:

94A60 | Cryptography |

##### Keywords:

chaotic maps; public key cryptography; ID-based cryptography; IND-CCA; IND-sID-CCA; random oracle model
PDF
BibTeX
XML
Cite

\textit{C. Meshram} et al., Soft Comput. 23, No. 16, 6937--6946 (2019; Zbl 1418.94057)

Full Text:
DOI

##### References:

[1] | Algehawi, MB; Samsudin, A., A new identity based encryption (IBE) scheme using extended Chebyshev polynomial over finite fields Zp, Phys Lett A, 374, 4670-4674, (2010) · Zbl 1238.94026 |

[2] | Bergamo, P.; D’Arco, P.; Santis, A.; Kocarev, L., Security of public key cryptosystems based on Chebyshev polynomials, IEEE Trans Circuits Syst I, 52, 1382-1393, (2005) · Zbl 1374.94775 |

[3] | 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 · Zbl 1122.94355 |

[4] | Boneh, D.; Franklin, MK, Identity based encryption from the Weil pairing, SIAM J Comput, 32, 586-615, (2003) · Zbl 1046.94008 |

[5] | Canetti R, Halevi S, Katz J (2003) A forward-secure public-key encryption scheme. In: Advances in cryptology—Eurocrypt 2003, vol 2656, pp 255-271 · Zbl 1037.68532 |

[6] | Chen, F.; Liao, X.; Wong, KW; Han, Q.; Li, Y., Period distribution analysis of some linear maps, Commun Nonlinear Sci Numer Simul, 17, 3848-3856, (2012) · Zbl 1258.94035 |

[7] | Cocks C (2001) An identity based encryption protocol based on quadratic residues. In: International conference on cryptography and coding (proceedings of IMA), lecture notes in computer science, vol 2260. Springer, pp 360-363 · Zbl 0999.94532 |

[8] | Diffie, W.; Hellman, ME, New directions in cryptography, IEEE Trans Inf Theory IT, 22, 454-644, (1976) · Zbl 0435.94018 |

[9] | ElGmal, T., A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans Inf Theory, 31, 469-472, (1995) |

[10] | Han, S.; Chang, E., Chaotic map based key agreement with/out clock synchronization, Choas Soliton Fractals, 39, 1283-1289, (2009) · Zbl 1197.94190 |

[11] | Heng, S.; Kurosawa, K., k-Resilient identity-based encryption in the standard model, IEICE Trans Fundam, E89CA, 39-46, (2006) |

[12] | Hwan, MS; Lo, JW; Lin, SC, An efficient user identification scheme based on ID-based cryptosystem, Comput Stand Interfaces, 26, 565-569, (2004) |

[13] | Hwu F (1993) The interpolating random spline cryptosystem and the chaotic-map public-key cryptosystem. Ph.d. thesis, University of Missouri Rolla |

[14] | Ibrahim, MH; Kumari, S.; Das, AK; Wazid, M.; Odelu, V., Secure anonymous mutual authentication for star two-tier wireless body area networks, Comput Methods Progr Biomed, 135, 37-50, (2016) |

[15] | Kiltz E, Vahlis Y (2008) CCA2 secure IBE: standard model efficiency through authenticated symmetric encryption. CT-RSA, lecture notes in computer science, vol 4964. Springer, pp 221-239 · Zbl 1153.94400 |

[16] | Kocarev, L., Chaos-based cryptography: a brief overview, IEEE Circuits Syst Mag, 1, 6-21, (2001) |

[17] | Kocarev L, Tasev Z (2003) Public-key encryption based on chebyshev maps. In: Proceedings of the 2003 international symposium on circuits and systems. https://doi.org/10.1109/iscas.2003.1204947 |

[18] | Lee, CC; Hsu, CW, A secure biometric-based remote user authentication with key agreement scheme using extended chaotic maps, Nonlinear Dyn, 71, 201-211, (2013) |

[19] | Lee, WC; Liao, KC, Constructing identity-based cryptosystems for discrete logarithm based cryptosystems, J Netw Comput Appl, 22, 191-199, (2004) |

[20] | Lee, CC; Chen, CL; Wu, CY; Huang, SY, An extended chaotic maps-based key agreement protocol with user anonymity, Nonlinear Dyn, 69, 79-87, (2012) · Zbl 1254.94038 |

[21] | Lee, CC; Hsu, CW; Lai, YM; Vasilakos, AV, An enhanced mobile-healthcare emergency system based on extended chaotic maps, J Med Syst, 37, 9973, (2013) |

[22] | Lee, CC; Li, CT; Hsu, CW, A three-party password-based authenticated key exchange protocol with user anonymity using extended chaotic maps, Nonlinear Dyn, 73, 125-132, (2013) · Zbl 1281.94084 |

[23] | Lee, CC; Li, CT; Chiu, ST; Lai, YM, A new three-party-authenticated key agreement scheme based on chaotic maps without password table, Nonlinear Dyn, 79, 2485-2495, (2014) · Zbl 1331.94061 |

[24] | Lee, CC; Lou, DC; Li, CT; Hsu, CW, An extended chaotic-maps-based protocol with key agreement for multiserver environments, Nonlinear Dyn, 76, 853-866, (2014) · Zbl 1319.94076 |

[25] | Li, CT; Lee, CC; Weng, CY, A secure chaotic maps and smart cards based password authentication and key agreement scheme with user anonymity for telecare medicine information systems, J Med Syst, 38, 77, (2014) |

[26] | Li, CT; Chen, CL; Lee, CC; etal., A novel three-party password-based authenticated key exchange protocol with user anonymity based on chaotic maps, Soft Comput, (2017) · Zbl 1398.94199 |

[27] | Liu, W.; Liu, J.; Wu, Q.; Qin, B.; Naccache, D.; Ferradi, H., Efficient subtree-based encryption for fuzzy-entity data sharing, Soft Comput, (2017) · Zbl 1402.68056 |

[28] | Mason JC, Handscomb DC (2003) Chebyshev polynomials. Chapman & Hall/CRC, Boca Raton · Zbl 1015.33001 |

[29] | Menezes A, Oorschot PV, Vanstone S (1997) Handbook of applied cryptography. CRC, Boca Raton · Zbl 0868.94001 |

[30] | Meshram, C., An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem, Inf Process Lett, 115, 351-358, (2015) · Zbl 1320.94075 |

[31] | Meshram, C., An efficient ID-based beta cryptosystem, Int J Secur Appl, 9, 189-202, (2015) |

[32] | Meshram, C., Factoring and discrete logarithm using IBC, Int J Hybrid Inf Technol, 8, 121-132, (2015) |

[33] | 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 · Zbl 1358.94071 |

[34] | Meshram, C.; Meshram, S., An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem, Inf Process Lett, 113, 375-380, (2013) · Zbl 1358.94071 |

[35] | Meshram, C.; Meshram, SA, Constructing new an ID-based cryptosystem for IFP and GDLP based cryptosystem, J Discrete Math Sci Cryptogr, 20, 1121-1134, (2017) |

[36] | 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, pp 1-5 |

[37] | Meshram, C.; Meshram, S.; Zhang, M., An ID-based cryptographic mechanisms based on GDLP and IFP, Inf Process Lett, 112, 753-758, (2012) · Zbl 1250.94059 |

[38] | Meshram, C.; Huang, X.; Meshram, S., New Identity-based cryptographic scheme for IFP and DLP based cryptosystem, Int J Pure Appl Math, 81, 65-79, (2012) · Zbl 1305.94065 |

[39] | Meshram, C.; Meshram, S.; Ram, C., Constructing identity-based cryptographic scheme for beta cryptosystem, Int J Appl Math, 25, 609-624, (2012) · Zbl 1342.94086 |

[40] | Meshram, C.; Powar, PL; Obaidat, MS; Lee, CC, An IBE technique using partial discrete logarithm, Procedia Comput Sci, 93, 735-741, (2016) |

[41] | Meshram, C.; Tseng, YM; Lee, CC; Meshram, SG, An IND-ID-CPA secure ID-based cryptographic protocol using GDLP and IFP, Informatica, 28, 471-484, (2017) · Zbl 1398.94141 |

[42] | Meshram, C.; Lee, CC; Li, CT; Chen, CL, A secure key authentication scheme for cryptosystems based on GDLP and IFP, Soft Comput, 21, 7285-7291, (2017) |

[43] | Meshram, C.; Li, CT; Meshram, SG, An efficient online/offline ID-based short signature procedure using extended chaotic maps, Soft Comput, (2018) · Zbl 1415.94469 |

[44] | Rivest, RL; Shamir, A.; Adleman, L., A method for obtaining digital signatures and public-key cryptosystems, Commun ACM, 21, 120-126, (1978) · Zbl 0368.94005 |

[45] | Shamir A (1984) Identity-based cryptosystems and signature schemes. In: Proceedings of CRYPTO’84, lecture notes in computer science, vol 196. Springer, pp 47-53 · Zbl 1359.94626 |

[46] | Shao, Z., A provably secure short signature scheme based on discrete logarithms, Inf Sci, 177, 5432-5440, (2007) · Zbl 1134.94010 |

[47] | Stinson D (2002) Cryptography: theory and practice, 2nd edn. CRC, Boca Raton · Zbl 0997.94001 |

[48] | Tsujii, S.; Itoh, T., An ID-based cryptosystem based on the discrete logarithm problem, IEEE J Sel Areas Commun, 7, 467-473, (1989) |

[49] | Waters B (2005) Efficient identity-based encryption without random oracles. In: Advances in cryptology-CRYPTO 2005, lecture notes in computer science, vol 3494. Springer, Berlin, pp 114-127 · Zbl 1137.94360 |

[50] | Wei, J.; Hu, X.; Liu, W.; etal., Forward and backward secure fuzzy encryption for data sharing in cloud computing, Soft Comput, (2017) |

[51] | Zhang, L., Cryptanalysis of the public key encryption based on multiple chaotic systems, Chaos Solitons Fractals, 37, 669-674, (2008) · Zbl 1134.94371 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.