{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:27:59Z","timestamp":1725895679356},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642342882"},{"type":"electronic","value":"9783642342899"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34289-9_49","type":"book-chapter","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T05:46:55Z","timestamp":1349502415000},"page":"440-448","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient ID-Based Directed Signature Scheme from Optimal Eta Pairing"],"prefix":"10.1007","author":[{"given":"Junhua","family":"Ku","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawei","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"She","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A. Shamir","year":"1985","unstructured":"Shamir, A.: Identity-Based Cryptosystems and Signature Schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 47\u201353. Springer, Heidelberg (1985)"},{"key":"49_CR2","unstructured":"Sun, X., Li, J.-H., Chen, G.-L., Yung, S.-T.: Identity-Based Directed Signature Scheme from Bilinear Pairings, \n                    \n                      http:\/\/eprint.iacr.org\/2008\/305.pdf"},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-24676-3_17","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Namprempre, C., Neven, G.: Security Proofs for Identity-Based Identification and Signature Schemes. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 268\u2013286. Springer, Heidelberg (2004)"},{"key":"49_CR4","unstructured":"Libert, B., Quisquater, J.J.: The exact security of an Identity based signature and its applications, \n                    \n                      http:\/\/eprint.iacr.org\/2004\/102"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-01513-7_34","volume-title":"Advances in Neural Networks \u2013 ISNN 2009","author":"J. Zhang","year":"2009","unstructured":"Zhang, J., Yang, Y., Niu, X.: Efficient Provable Secure ID-Based Directed Signature Scheme without Random Oracle. In: Yu, W., He, H., Zhang, N. (eds.) ISNN 2009, Part III. LNCS, vol.\u00a05553, pp. 318\u2013327. Springer, Heidelberg (2009)"},{"key":"49_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient Identity-Based Encryption Without Random Oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"},{"issue":"4","key":"49_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"V. Miller","year":"2004","unstructured":"Miller, V.: The Weil pairing, and its efficient calculation. J. Cryptol.\u00a017(4), 235\u2013261 (2004)","journal-title":"J. Cryptol."},{"key":"49_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-36492-7_20","volume-title":"Selected Areas in Cryptography","author":"F. Hess","year":"2003","unstructured":"Hess, F.: Efficient identity based signature schemes based on pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 310\u2013324. Springer, Heidelberg (2003)"},{"key":"49_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"M. Barreto","year":"2007","unstructured":"Barreto, M., et al.: Efficient pairing computation on supersingular Abelian varieties. Des. Codes Crypt.\u00a042, 239\u2013271 (2007)","journal-title":"Des. Codes Crypt."},{"issue":"10","key":"49_CR10","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F. Hess","year":"2006","unstructured":"Hess, F., Smart, N., Vercauteren, F.: The Eta pairing revisited. IEEE Trans. Inf. Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"49_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-72540-4_25","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"R. Granger","year":"2007","unstructured":"Granger, R., Hess, F., Oyono, R., Th\u00e9riault, N., Vercauteren, F.: Ate Pairing on Hyperelliptic Curves. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 430\u2013447. Springer, Heidelberg (2007)"},{"key":"49_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-85538-5_2","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"F. Hess","year":"2008","unstructured":"Hess, F.: Pairing Lattices. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 18\u201338. Springer, Heidelberg (2008)"},{"key":"49_CR13","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"S. Galbraith","year":"2008","unstructured":"Galbraith, S., Paterson, K., Smart, N.: Pairings for cryptographers. Discrete Applied Mathematics\u00a0156, 3113\u20133121 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"49_CR14","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. Menezes","year":"1993","unstructured":"Menezes, A., Okamoto, T., Vanstone, S.: Reducing elliptic curves logarithms to logarithms in a finite field. IEEE Trans. Inf. Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"49_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-17455-1_25","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"N. Estibals","year":"2010","unstructured":"Estibals, N.: Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 397\u2013416. Springer, Heidelberg (2010)"},{"key":"49_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-11925-5_7","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"D.F. Aranha","year":"2010","unstructured":"Aranha, D.F., L\u00f3pez, J., Hankerson, D.: High-Speed Parallel Software Implementation of the \u03b7_T Pairing. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol.\u00a05985, pp. 89\u2013105. Springer, Heidelberg (2010)"},{"key":"49_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-45682-1_29","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"S.D. Galbraith","year":"2001","unstructured":"Galbraith, S.D.: Supersingular Curves in Cryptography. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 495\u2013513. Springer, Heidelberg (2001)"},{"issue":"1","key":"49_CR18","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F. Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory\u00a056(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"177","key":"49_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"D. Cantor","year":"1987","unstructured":"Cantor, D.: Computing in the Jacobian of a hyperelliptic curve. Math. Comput.\u00a048(177), 95\u2013101 (1987)","journal-title":"Math. Comput."}],"container-title":["Communications in Computer and Information Science","Computational Intelligence and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34289-9_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:35:41Z","timestamp":1557275741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34289-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642342882","9783642342899"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34289-9_49","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}