{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T15:40:59Z","timestamp":1762875659668,"version":"3.41.2"},"reference-count":48,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T00:00:00Z","timestamp":1426464000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"National Science Council of the Republic of China","award":["NSC 102-2410-H-145-001","102-2623-E-145-001-D"],"award-info":[{"award-number":["NSC 102-2410-H-145-001","102-2623-E-145-001-D"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Communication"],"published-print":{"date-parts":[[2017,1,10]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>Application of authentication protocol and key exchange scheme are major research issues in current internet, and entity identification (users or servers) accuracy and security are thereby safeguarded by various types of verification programs. Therefore, in the last 10\u2009years, it was accompanied with productive discussions, but those discussions mainly focus on single issues, and because of the lack of security, there still existed improvements. The concept of zero\u2010knowledge proofs is well suited for the identification and signing within network system, which has been widely used since proposed in 1985. However, common identification methods are only fit for individual user. In an increasingly complex network environment of today, information is usually conveyed through many unidentified servers, as a result, we have to encrypt messages by adopting different kinds of session keys. As for the chaotic maps technology, it also serves as a new encryption technology, widely adopted in communication protocols and key agreements over the years. As a consequence, in this study, we are going to propose an authentication protocol with key exchange function by taking advantage of characters of zero\u2010knowledge proofs and chaotic maps, as well as adopt the BAN\u2010logic to prove the security of this protocol. This study also compares the results of the security analysis of our protocol and related works. As a result, our proposed protocol has more security than others. Copyright \u00a9 2015 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/dac.2945","type":"journal-article","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T18:49:51Z","timestamp":1426531791000},"source":"Crossref","is-referenced-by-count":12,"title":["Enhancement authentication protocol using zero\u2010knowledge proofs and chaotic maps"],"prefix":"10.1002","volume":"30","author":[{"given":"Kai","family":"Chain","sequence":"first","affiliation":[{"name":"Institute of Computer and Communication Engineering, Department of Electrical Engineering National Cheng Kung University Tainan 701 Taiwan"}]},{"given":"Kuei\u2010Hu","family":"Chang","sequence":"additional","affiliation":[{"name":"Department of Management Sciences R.O.C. Military Academy Kaohsiung 830 Taiwan"}]},{"given":"Wen\u2010Chung","family":"Kuo","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering National Yunlin University of Science and Technology Yunlin 640 Taiwan"}]},{"given":"Jar\u2010Ferr","family":"Yang","sequence":"additional","affiliation":[{"name":"Institute of Computer and Communication Engineering, Department of Electrical Engineering National Cheng Kung University Tainan 701 Taiwan"}]}],"member":"311","published-online":{"date-parts":[[2015,3,16]]},"reference":[{"key":"e_1_2_9_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.273037"},{"key":"e_1_2_9_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.345886"},{"key":"e_1_2_9_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.387429"},{"key":"e_1_2_9_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/359657.359659"},{"key":"e_1_2_9_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.1286"},{"key":"e_1_2_9_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.1268"},{"key":"e_1_2_9_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.1387"},{"key":"e_1_2_9_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.02.031"},{"key":"e_1_2_9_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.04.041"},{"issue":"2","key":"e_1_2_9_11_1","first-page":"99","article-title":"Chaotic maps\u2010based mutual authentication and key agreement using smart cards for wireless communications","volume":"4","author":"Guo C","year":"2013","journal-title":"Journal of Information Hiding and Multimedia Signal Processing"},{"key":"e_1_2_9_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.2428"},{"key":"e_1_2_9_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.1355"},{"key":"e_1_2_9_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/dac.2346"},{"key":"e_1_2_9_15_1","doi-asserted-by":"crossref","unstructured":"GoldwasserS MicaliS RackoffC.The knowledge complexity of interactive proof\u2010systems. In STOC '85: Proceedings of the seventeenth annual ACM symposium on Theory of computing 1985; 291\u2013304.","DOI":"10.1145\/22145.22178"},{"key":"e_1_2_9_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02351717"},{"key":"e_1_2_9_17_1","doi-asserted-by":"crossref","unstructured":"FiatA ShamirA.How to prove yourself: practical solutions to identification and signature problems Lecture Notes in Computer Science Springer\u2010Verlag Berlin vol.263 Aug.1987; 186\u2010194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_2_9_18_1","unstructured":"FiatA ShamirA.Unforgeable proofs of identity.Proceedings of the SECURICOM\u201987 Paris 1987; 147\u2010153."},{"key":"e_1_2_9_19_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021812749800098X"},{"key":"e_1_2_9_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_2_9_21_1","doi-asserted-by":"crossref","unstructured":"GrothJ.Non\u2010interactive zero\u2010knowledge arguments for voting Lecture Notes in Computer Science Springer\u2010Verlag Berlin vol.3531 June2005; 467\u2010482.","DOI":"10.1007\/11496137_32"},{"key":"e_1_2_9_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/10958513_11"},{"key":"e_1_2_9_23_1","first-page":"302","volume-title":"Compact e\u2010cash, Lecture Notes in Computer Science","author":"Camenisch J","year":"2005"},{"key":"e_1_2_9_24_1","doi-asserted-by":"crossref","unstructured":"CamenischJ LysyanskayaA MeyerovichM.Endorsed e\u2010cash.Proceedings of the IEEE Symposium on Security and Privacy (S&P 2007) May2007.","DOI":"10.1109\/SP.2007.15"},{"key":"e_1_2_9_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36413-7_20"},{"key":"e_1_2_9_26_1","doi-asserted-by":"crossref","unstructured":"ChaumD.Blind signatures for untraceable payments Advances in Cryptology Springer\u2010Verlag US 1983; pp. 199\u2010203.","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"e_1_2_9_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2001.972857"},{"key":"e_1_2_9_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/7384.963463"},{"key":"e_1_2_9_29_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.64.821"},{"key":"e_1_2_9_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.44.2374"},{"key":"e_1_2_9_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0375-9601(02)00431-0"},{"key":"e_1_2_9_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2003.12.022"},{"key":"e_1_2_9_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-010-9877-1"},{"key":"e_1_2_9_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-010-9749-8"},{"key":"e_1_2_9_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-010-9821-4"},{"key":"e_1_2_9_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2009.05.065"},{"key":"e_1_2_9_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0960-0779(04)00456-4"},{"key":"e_1_2_9_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cnsns.2009.10.012"},{"key":"e_1_2_9_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-013-1018-1"},{"key":"e_1_2_9_40_1","first-page":"73","volume-title":"Advances in Cryptology: CRYPTO '93","author":"Santis AD","year":"1993"},{"key":"e_1_2_9_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-012-0335-0"},{"key":"e_1_2_9_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-011-0247-4"},{"volume-title":"Chebyshev Polynomials","year":"2003","author":"Mason JC","key":"e_1_2_9_43_1"},{"key":"e_1_2_9_44_1","doi-asserted-by":"crossref","unstructured":"TsengHR JouE.An efficient anonymous key agreement protocol based on chaotic maps.Proceedings of the 2011 IEEE International Conference on High Performance Computing and Communications Sept.2011; 752\u2010757.","DOI":"10.1109\/HPCC.2011.107"},{"key":"e_1_2_9_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2006.09.047"},{"key":"e_1_2_9_46_1","doi-asserted-by":"crossref","unstructured":"LiTY LiuXD QinZG ZhangXF.Formal Analysis for Security of Otway\u2013Rees Protocol with BAN Logic.Proceedings of the 1st International Workshop on Database Technology and Applications Wuhan 2009; 590\u2010593.","DOI":"10.1109\/DBTA.2009.26"},{"key":"e_1_2_9_47_1","doi-asserted-by":"crossref","unstructured":"LiTY LiuXD QinZG ZhangXF.An improved security protocol formal analysis with BAN logic.International Conference on Electronic Commerce and Business Intelligence Beijing June2009; 102\u2010105.","DOI":"10.1109\/ECBI.2009.101"},{"key":"e_1_2_9_48_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:19940099"},{"volume-title":"Contemporary Cryptology: The Science of Information Integrity","year":"1992","author":"Simmons GJ","key":"e_1_2_9_49_1"}],"container-title":["International Journal of Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fdac.2945","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fdac.2945","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/dac.2945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:48:34Z","timestamp":1747788514000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/dac.2945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,16]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1,10]]}},"alternative-id":["10.1002\/dac.2945"],"URL":"https:\/\/doi.org\/10.1002\/dac.2945","archive":["Portico"],"relation":{},"ISSN":["1074-5351","1099-1131"],"issn-type":[{"type":"print","value":"1074-5351"},{"type":"electronic","value":"1099-1131"}],"subject":[],"published":{"date-parts":[[2015,3,16]]},"article-number":"e2945"}}