{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T23:53:35Z","timestamp":1648770815359},"reference-count":22,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2014]]},"DOI":"10.1587\/transfun.e97.a.1307","type":"journal-article","created":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T23:18:05Z","timestamp":1401578285000},"page":"1307-1317","source":"Crossref","is-referenced-by-count":0,"title":["Secure Hierarchical Identity-Based Identification without Random Oracles"],"prefix":"10.1587","volume":"E97.A","author":[{"given":"Atsushi","family":"FUJIOKA","sequence":"first","affiliation":[{"name":"Kanagawa University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taiichi","family":"SAITO","sequence":"additional","affiliation":[{"name":"Tokyo Denki University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keita","family":"XAGAWA","sequence":"additional","affiliation":[{"name":"NTT Secure Platform Laboratories, NTT Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] M. Bellare and A. Palacio, “GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks,” CRYPTO 2002, ed. M. Yung, Lect. Notes Comput. Sci., vol.2442, pp.162-177, Springer-Verlag, 2002."},{"key":"2","unstructured":"[2] K. Kurosawa and S.H. Heng, “From digital signature to ID-based identification\/signature,” PKC 2004, Lect. Notes Comput. Sci., vol.2947, pp.248-261, Springer-Verlag, 2004."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M. Bellare, C. Namprempre, and G. Neven, “Security proofs for identity-based identification and signature schemes,” J. Cryptology, vol.22, no.1, pp.1-61, Jan. 2009.","DOI":"10.1007\/s00145-008-9028-8"},{"key":"4","unstructured":"[4] R. Cramer, Modular Design of Secure, yet Practical Cryptographic Protocols, Ph.D. thesis, University of Amsterdam, 1996."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] J.J. Chin, S.H. Heng, and B.M. Goi, “Hierarchical identity-based identification schemes,” FGIT-SecTech 2009, Communications in Computer and Information Science, vol.58, pp.93-99, Springer-Verlag, 2009.","DOI":"10.1007\/978-3-642-10847-1_12"},{"key":"6","unstructured":"[6] C. Gentry and A. Silverberg, “Hierarchical ID-based cryptography,” ASIACRYPT 2002, Lect. Notes Comput. Sci., vol.2501, pp.548-566, Springer-Verlag, 2002."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] D. Boneh and M.K. Franklin, “Identity-based encryption from the Weil pairing,” SIAM J. Comput., vol.32, no.3, pp.584-615, 2003. A preliminary version appeared in CRYPTO 2001, 2001.","DOI":"10.1137\/S0097539701398521"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M. Bellare and P. Rogaway, “Random oracles are practical: A paradigm for designing efficient protocols,” CCS'93, pp.62-73, ACM, 1993.","DOI":"10.1145\/168588.168596"},{"key":"9","unstructured":"[9] A. Fujioka, T. Saito, and K. Xagawa, “Security enhancements by OR-proof in identity-based identification,” ACNS 2012, Lect. Notes Comput. Sci., vol.7341, pp.135-152, Springer-Verlag, 2012."},{"key":"10","unstructured":"[10] A. Fujioka, T. Saito, and K. Xagawa, “Applicability of OR-proof techniques to hierarchical identity-based identification,” CANS 2012, Lect. Notes Comput. Sci., vol.7712, pp.169-184, Springer-Verlag, 2012."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] B. Waters, “Efficient identity-based encryption without random oracles,” EUROCRYPT 2005, Lect. Notes Comput. Sci., vol.3494, pp.114-127, Springer-Verlag, 2005. The full version is available at http:\/\/eprint.iacr.org\/2004\/180","DOI":"10.1007\/11426639_7"},{"key":"12","unstructured":"[12] J. Horwitz and B. Lynn, “Toward hierarchical identity-based encryption,” EUROCRYPT 2002, Lect. Notes Comput. Sci., vol.2332, pp.466-481, Springer-Verlag, 2002."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] S. Goldwasser, S. Micali, and R.L. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks,” SIMA J. Computing, vol.17, no.2, pp.281-308, 1988. A preliminary version appeared in FOCS'84, 1984.","DOI":"10.1137\/0217017"},{"key":"14","unstructured":"[14] F. Hess, “Exponent group signature schemes and efficient identity based signature schemes based on pairings,” Cryptology ePrint Archive, Report 2002\/012, 2002. Available at http:\/\/eprint.iacr.org\/2002\/012"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] A.B. Lewko and B. Waters, “New techniques for dual system encryption and fully secure HIBE with short ciphertexts,” TCC 2010, Lect. Notes Comput. Sci., vol.5978, pp.455-479, Springer-Verlag, 2010. The full version is available at http:\/\/eprint.iacr.org\/2009\/482","DOI":"10.1007\/978-3-642-11799-2_27"},{"key":"16","unstructured":"[16] D. Boneh and X. Boyen, “Efficient selective-ID secure identity based encryption without random oracles,” EUROCRYPT 2004, Lect. Notes Comput. Sci., vol.3027, pp.223-238, Springer-Verlag, 2004."},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] R. Cramer and V. Shoup, “Signature schemes based on the strong RSA assumption,” ACM Trans. Information and System Security, vol.3, no.3, pp.161-185, 2000. A preliminary version appeared in 6th ACM CCS, 1999.","DOI":"10.1145\/357830.357847"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] S. Hohenberger and B. Waters, “Short and stateless signatures from the RSA assumption,” CRYPTO 2009, Lect. Notes Comput. Sci., vol.5677, pp.654-670, Springer-Verlag, 2009. The full version is available at http:\/\/eprint.iacr.org\/2009\/283","DOI":"10.1007\/978-3-642-03356-8_38"},{"key":"19","unstructured":"[19] G. Poupard and J. Stern, “Short proofs of knowledge for factoring,” PKC 2000, Lect. Notes Comput. Sci., vol.1751, pp.147-166, Springer-Verlag, 2000."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] G.L. Miller, “Riemann's hypothesis and tests for primality,” Journal of Computer and System Sciences, vol.13, no.3, pp.300-317, Dec. 1976.","DOI":"10.1016\/S0022-0000(76)80043-8"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] A. Guillevic, “Comparing the pairing efficiency over composite-order and prime-order elliptic curves,” ACNS 2013, Lect. Notes Comput. Sci., vol.7954, pp.357-372, Springer-Verlag, 2013. The full version is available at http:\/\/eprint.iacr.org\/2013\/218","DOI":"10.1007\/978-3-642-38980-1_22"},{"key":"22","unstructured":"[22] A. Fujioka, T. Saito, and K. Xagawa, “Secure hierarchical identity-based identification without random oracles,” ISC 2012, Lect. Notes Comput. Sci., vol.7483, pp.258-273, Springer-Verlag, 2012."}],"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\/E97.A\/6\/E97.A_1307\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T06:03:27Z","timestamp":1619417007000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E97.A\/6\/E97.A_1307\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.e97.a.1307","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}