{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T14:51:48Z","timestamp":1649083908038},"reference-count":26,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1587\/transfun.2020cip0010","type":"journal-article","created":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T22:12:58Z","timestamp":1609452778000},"page":"58-68","source":"Crossref","is-referenced-by-count":0,"title":["Strongly Secure Identity-Based Key Exchange with Single Pairing Operation"],"prefix":"10.1587","volume":"E104.A","author":[{"given":"Junichi","family":"TOMIDA","sequence":"first","affiliation":[{"name":"NTT Secure Platform Laboratories, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsushi","family":"FUJIOKA","sequence":"additional","affiliation":[{"name":"Kanagawa University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"NAGAI","sequence":"additional","affiliation":[{"name":"NTT Secure Platform Laboratories, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koutarou","family":"SUZUKI","sequence":"additional","affiliation":[{"name":"Toyohashi University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] R. Barbulescu and S. Duquesne, \u201cUpdating key size estimations for pairings,\u201d Cryptology ePrint Archive, Report 2017\/334, 2017."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] P.S.L.M. Barreto and M. Naehrig, \u201cPairing-friendly elliptic curves of prime order,\u201d Selected Areas in Cryptography \u2014 SAC&apos;2005, LNCS, vol.3897, pp.319-331, Springer, 2006. 10.1007\/11693383_22","DOI":"10.1007\/11693383_22"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M. Bellare and G. Neven, \u201cMulti-signatures in the plain public-key model and a general forking lemma,\u201d ACM CCS&apos;06, pp.390-399, ACM Press, 2006. 10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[5] C. Boyd and K.K.R. Choo, \u201cSecurity of two-party identity-based key agreement,\u201d Mycrypt 2005, LNCS, vol.3715, pp.229-243, Springer, 2005. 10.1007\/11554868_17","DOI":"10.1007\/11554868_17"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[6] C. Boyd, Y. Cliff, J.M. Gonz\u00e1lez Nieto, and K. Paterson, \u201cEfficient one-round key exchange in the standard model,\u201d ACISP 2008, LNCS, vol.5107, pp.69-83, Springer, 2008. 10.1007\/978-3-540-70500-0_6","DOI":"10.1007\/978-3-540-70500-0_6"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[7] R. Canetti and H. Krawczyk, \u201cAnalysis of key-exchange protocols and their use for building secure channels,\u201d Eurocrypt 2001, LNCS, vol.2045, pp.453-474, Springer, 2001. 10.1007\/3-540-44987-6_28","DOI":"10.1007\/3-540-44987-6_28"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[8] J. Tomida, A. Fujioka, A. Nagai, and K. Suzuki, \u201cStrongly secure identity-based key exchange with single pairing operation,\u201d ESORICS 2019, LNCS, vol.11736, pp.484-503, Springer, 2019. 10.1007\/978-3-030-29962-0_23","DOI":"10.1007\/978-3-030-29962-0_23"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[9] L. Chen and Z. Cheng, \u201cSecurity proof of Sakai-Kasahara&apos;s identity-based encryption scheme,\u201d Cryptology ePrint Archive, Report 2005\/226, 2005.","DOI":"10.1007\/11586821_29"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] L. Chen, Z. Cheng, and N.P. Smart, \u201cIdentity-based key agreement protocols from pairings,\u201d Int. J. Inf. Secur., vol.6, no.4, pp.213-241, 2007. 10.1007\/s10207-006-0011-9","DOI":"10.1007\/s10207-006-0011-9"},{"key":"10","unstructured":"[11] Z. Cheng and L. Chen, \u201cOn security proof of McCullagh-Barreto&apos;s key agreement protocol and its variants,\u201d Cryptology ePrint Archive, Report 2005\/201, 2005."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] K.K.R. Choo, C. Boyd, and Y. Hitchcock, \u201cExamining indistinguishability-based proof models for key establishment protocols,\u201d Asiacrypt 2005, LNCS, vol.3788, pp.585-604, Springer, 2005. 10.1007\/11593447_32","DOI":"10.1007\/11593447_32"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[13] C.J.F. Cremers, \u201c<b>Session-stateReveal<\/b> is stronger than <b>EphemeralKeyReveal<\/b>: Attacking the NAXOS authenticated key exchange protocol,\u201d ACNS 2009, LNCS, vol.5536, pp.20-33, Springer, 2009. 10.1007\/978-3-642-01957-9_2","DOI":"10.1007\/978-3-642-01957-9_2"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] C.J.F. Cremers, \u201cExamining indistinguishability-based security models for key exchange protocols: The case of CK, CK-HMQV, and eCK,\u201d ACM CCS&apos;11, pp.80-91, ACM, 2011. 10.1145\/1966913.1966925","DOI":"10.1145\/1966913.1966925"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[15] D. Fiore and R. Gennaro, \u201cMaking the Diffie-Hellman protocol identity-based,\u201d CT-RSA 2010, LNCS, vol.5985, pp.165-178, Springer, 2010. 10.1007\/978-3-642-11925-5_12","DOI":"10.1007\/978-3-642-11925-5_12"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[16] A. Fujioka, F. Hoshino, T. Kobayashi, K. Suzuki, B. Usta\u014fglu, and K. Yoneyama, \u201cid-eCK secure ID-based authenticated key exchange on symmetric and asymmetric pairing,\u201d IEICE Trans. Fundamentals, vol.E96-A, no.6, pp.1139-1155, June 2013. 10.1587\/transfun.e96.a.1139","DOI":"10.1587\/transfun.E96.A.1139"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[17] A. Fujioka, K. Suzuki, and B. Ustao\u011flu, \u201cEphemeral key leakage resilient and efficient ID-AKEs that can share identities, private and master keys,\u201d Pairing 2010, LNCS, vol.6487, pp.187-205, Springer, 2010. 10.1007\/978-3-642-17455-1_12","DOI":"10.1007\/978-3-642-17455-1_12"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[18] S.D. Galbraith, X. Lin, and M. Scott, \u201cEndomorphisms for faster elliptic curve cryptography on a large class of curves,\u201d J. Cryptology, vol.24, no.3, pp.446-469, 2011. 10.1007\/s00145-010-9065-y","DOI":"10.1007\/s00145-010-9065-y"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[19] R.P. Gallant, R.J. Lambert, and S.A. Vanstone, \u201cFaster point multiplication on elliptic curves with efficient endomorphisms,\u201d CRYPTO 2001, LNCS, vol.2139, pp.190-200, 2001. 10.1007\/3-540-44647-8_11","DOI":"10.1007\/3-540-44647-8_11"},{"key":"19","unstructured":"[20] Gartner Inc, Newsroom, \u201cGartner identifies top 10 strategic IoT technologies and trends,\u201d https:\/\/www.gartner.com\/en\/newsroom\/press-releases\/2018-11-07-gartner-identifies-top-10-strategic-iot-technologies-and-trends"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[21] H. Huang and Z. Cao, \u201cAn ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem,\u201d ASIACCS 09, pp.333-342, ACM Press, 2009. 10.1145\/1533057.1533101","DOI":"10.1145\/1533057.1533101"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[22] T. Kim and R. Barbulescu, \u201cExtended tower number field sieve: A new complexity for the medium prime case,\u201d CRYPTO 2016, LNCS, vol.9814, pp.543-571, Springer, 2016. 10.1007\/978-3-662-53018-4_20","DOI":"10.1007\/978-3-662-53018-4_20"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[23] H. Krawczyk, \u201cHMQV: A high-performance secure Diffie-Hellman protocol,\u201d CRYPTO 2005, LNCS, vol.3621, pp.546-566, Springer, 2005. 10.1007\/11535218_33","DOI":"10.1007\/11535218_33"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[25] N. McCullagh and P.S.L.M. Barreto, \u201cA new two-party identity-based authenticated key agreement,\u201d CT-RSA 2005, LNCS, vol.3376, pp.262-274, Springer, 2005. 10.1007\/978-3-540-30574-3_18","DOI":"10.1007\/978-3-540-30574-3_18"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[26] T. Okamoto and D. Pointcheval, \u201cThe gap-problems: A new class of problems for the security of cryptographic schemes,\u201d PKC 2001, LNCS, vol.1992, pp.104-118, Springer, 2001. 10.1007\/3-540-44586-2_8","DOI":"10.1007\/3-540-44586-2_8"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[27] A. Shamir, \u201cIdentity-based cryptosystems and signature schemes,\u201d CRYPTO&apos;84, LNCS, vol.196, pp.47-53, Springer, 1985. 10.1007\/3-540-39568-7_5","DOI":"10.1007\/3-540-39568-7_5"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[28] F. Vercauteren, \u201cOptimal pairings,\u201d IEEE Trans. Inf. Theory, vol.56, no.1, pp.455-461, 2010. 10.1109\/tit.2009.2034881","DOI":"10.1109\/TIT.2009.2034881"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/1\/E104.A_2020CIP0010\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T03:37:17Z","timestamp":1609558637000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E104.A\/1\/E104.A_2020CIP0010\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020cip0010","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}