{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:45:06Z","timestamp":1725770706781},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319048727"},{"type":"electronic","value":"9783319048734"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04873-4_5","type":"book-chapter","created":{"date-parts":[[2014,1,26]],"date-time":"2014-01-26T22:49:57Z","timestamp":1390776597000},"page":"77-96","source":"Crossref","is-referenced-by-count":1,"title":["Pairing Inversion via Non-degenerate Auxiliary Pairings"],"prefix":"10.1007","author":[{"given":"Seunghwan","family":"Chang","sequence":"first","affiliation":[]},{"given":"Hoon","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Eunjeong","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Hyang-Sook","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10623-006-9033-6","volume":"42","author":"P. Barreto","year":"2007","unstructured":"Barreto, P., Galbraith, S., \u00d3h\u00c9igeartaigh, C., Scott, M.: Efficient Pairing Computation on Supersingular Abelian Varieties. Designs, Codes and Cryptography\u00a042(3), 239\u2013271 (2007)","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. SIAM J. of Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. of Computing"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2005","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. of Cryptology\u00a017(4), 297\u2013319 (2004)","journal-title":"J. of Cryptology"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"P. Barreto","year":"2006","unstructured":"Barreto, P., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"5_CR6","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"2000","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Heidelberg (2000)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1007\/978-3-642-32009-5_48","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"A. Duc","year":"2012","unstructured":"Duc, A., Jetchev, D.: Hardness of Computing Individual Bits for One-way Functions on Elliptic Curves. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 832\u2013849. Springer, Heidelberg (2012)"},{"key":"5_CR8","unstructured":"Cray Titan: olcf.ornl.gov\/titan\/, en.wikipedia.org\/wiki\/Titan_(supercomputer)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-40061-5_7","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"I. Duursma","year":"2003","unstructured":"Duursma, I., Lee, H.-S.: Tate pairing implementation for hyperelliptic curves y\n                2\u2009=\u2009x\n                \n                  p\n                \u2009\u2212\u2009x\u2009+\u2009d. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 111\u2013123. Springer, Heidelberg (2003)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D. Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. of Cryptology\u00a023, 224\u2013280 (2010)","journal-title":"J. of Cryptology"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"5719","DOI":"10.1109\/TIT.2008.2006431","volume":"54","author":"S. Galbraith","year":"2008","unstructured":"Galbraith, S., Hess, F., Vercauteren, F.: Aspects of Pairing Inversion. IEEE Trans. Information Theory\u00a054, 5719\u20135728 (2008)","journal-title":"IEEE Trans. Information Theory"},{"key":"5_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":"5_CR13","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. Information Theory\u00a052, 4595\u20134602 (2006)","journal-title":"IEEE Trans. Information Theory"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A. Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. of Cryptology\u00a017(4), 263\u2013276 (2004)","journal-title":"J. of Cryptology"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1109\/TIT.2011.2173714","volume":"58","author":"N. Kanayama","year":"2012","unstructured":"Kanayama, N., Okamoto, E.: Approach to Pairing Inversions Without Solving Miller Inversion. IEEE Trans. Information Theory\u00a058, 1248\u20131253 (2012)","journal-title":"IEEE Trans. Information Theory"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"E.J. Kachisa","year":"2008","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 126\u2013135. Springer, Heidelberg (2008)"},{"key":"5_CR17","unstructured":"Kim, S., Cheon, J.: Fixed Argument Pairing Inversion on Elliptic Curves (2012) (preprint), \n                  \n                    http:\/\/eprint.iacr.org\/2012\/657"},{"issue":"4","key":"5_CR18","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TIT.2009.2013048","volume":"55","author":"E. Lee","year":"2009","unstructured":"Lee, E., Lee, H.-S., Park, C.: Efficient and Generalized Pairing Computation on Abelian Varieties. IEEE Trans. Information Theory\u00a055(4), 1793\u20131803 (2009)","journal-title":"IEEE Trans. Information Theory"},{"key":"5_CR19","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. of Cryptology\u00a017, 235\u2013261 (2004)","journal-title":"J. of Cryptology"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-02617-1_13","volume-title":"Advances in Information Security and Assurance","author":"N. Mrabet El","year":"2009","unstructured":"El Mrabet, N.: What about Vulnerability to a Fault Attack of the Miller\u2019s Algorithm During an Identity Based Protocol? In: Park, J.H., Chen, H.-H., Atiquzzaman, M., Lee, C., Kim, T.-h., Yeo, S.-S. (eds.) ISA 2009. LNCS, vol.\u00a05576, pp. 122\u2013134. Springer, Heidelberg (2009)"},{"issue":"8","key":"5_CR21","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.jss.2011.03.083","volume":"84","author":"G. Pereira","year":"2011","unstructured":"Pereira, G., Simpl\u00edcio, M., Naehrig, M., Barreto, P.: A Family of Implementation-Friendly BN Elliptic Curves. J. of Systems and Software\u00a084(8), 1319\u20131326 (2011)","journal-title":"J. of Systems and Software"},{"issue":"9","key":"5_CR22","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TC.2006.134","volume":"55","author":"D. Page","year":"2006","unstructured":"Page, D., Vercauteren, F.: A Fault Attack on Pairing Based Cryptography. IEEE Trans. Computers\u00a055(9), 1075\u20131080 (2006)","journal-title":"IEEE Trans. Computers"},{"key":"5_CR23","first-page":"135","volume":"9","author":"T. Satoh","year":"2006","unstructured":"Satoh, T.: On polynomial interpolations related to Verheul homomorphisms. J. Comput. Math.\u00a09, 135\u2013158 (2006)","journal-title":"J. Comput. Math."},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-73489-5_18","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"T. Satoh","year":"2007","unstructured":"Satoh, T.: On pairing inversion problems. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 317\u2013328. Springer, Heidelberg (2007)"},{"issue":"1","key":"5_CR25","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. Information Theory\u00a056(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Information Theory"},{"issue":"4","key":"5_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00145-004-0313-x","volume":"17","author":"E. Verheul","year":"2004","unstructured":"Verheul, E.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. J. Cryptology\u00a017(4), 277\u2013296 (2004)","journal-title":"J. Cryptology"},{"key":"5_CR27","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)"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-34704-7_9","volume-title":"Information Security and Cryptology","author":"J. Weng","year":"2012","unstructured":"Weng, J., Dou, Y., Ma, C.: Fault Attacks against the Miller Algorithm in Hessian Coordinates. In: Wu, C.-K., Yung, M., Lin, D. (eds.) Inscrypt 2011. LNCS, vol.\u00a07537, pp. 102\u2013112. Springer, Heidelberg (2012)"},{"issue":"6","key":"5_CR29","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10207-008-0054-1","volume":"7","author":"C. Zhao","year":"2008","unstructured":"Zhao, C., Zhang, F., Huang, J.: A Note on the Ate Pairing. International J. of Information Security\u00a07(6), 379\u2013382 (2008)","journal-title":"International J. of Information Security"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04873-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T00:46:56Z","timestamp":1558831616000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04873-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319048727","9783319048734"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04873-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}