{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T01:03:10Z","timestamp":1768525390167,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642334801","type":"print"},{"value":"9783642334818","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33481-8_1","type":"book-chapter","created":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T09:00:27Z","timestamp":1345626027000},"page":"1-17","source":"Crossref","is-referenced-by-count":17,"title":["Indifferentiable Hashing to Barreto\u2013Naehrig Curves"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Baek, J., Zheng, Y.: Identity-based threshold decryption. In: Bao et al. [2], pp. 262\u2013276","DOI":"10.1007\/978-3-540-24632-9_19"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Public Key Cryptography \u2013 PKC 2004","year":"2004","unstructured":"Bao, F., Deng, R., Zhou, J. (eds.): PKC 2004. LNCS, vol.\u00a02947. Springer, Heidelberg (2004)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-36413-7_19","volume-title":"Security in Communication Networks","author":"P.S.L.M. Barreto","year":"2003","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing Elliptic Curves with Prescribed Embedding Degrees. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol.\u00a02576, pp. 257\u2013267. Springer, Heidelberg (2003)"},{"key":"1_CR4","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.S.L.M. Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., 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":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-28641-4_12","volume-title":"Principles of Security and Trust","author":"G. Barthe","year":"2012","unstructured":"Barthe, G., Gr\u00e9goire, B., Heraud, S., Olmedo, F., Zanella B\u00e9guelin, S.: Verified Indifferentiable Hashing into Elliptic Curves. In: Degano, P., Guttman, J.D. (eds.) Principles of Security and Trust. LNCS, vol.\u00a07215, pp. 209\u2013228. Springer, Heidelberg (2012)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme. In: Desmedt [17], pp. 31\u201346","DOI":"10.1007\/3-540-36288-6_3"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 416\u2013432. Springer, Heidelberg (2003)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 514\u2013532. Springer, Heidelberg (2001)"},{"issue":"4","key":"1_CR10","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. Cryptology\u00a017(4), 297\u2013319 (2004)","journal-title":"J. Cryptology"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-540-45146-4_23","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"X. Boyen","year":"2003","unstructured":"Boyen, X.: Multipurpose Identity-Based Signcryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 383\u2013399. Springer, Heidelberg (2003)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-45539-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Boyko","year":"2000","unstructured":"Boyko, V., MacKenzie, P.D., Patel, S.: Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 156\u2013171. Springer, Heidelberg (2000)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-642-14623-7_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"E. Brier","year":"2010","unstructured":"Brier, E., Coron, J.-S., Icart, T., Madore, D., Randriam, H., Tibouchi, M.: Efficient Indifferentiable Hashing into Ordinary Elliptic Curves. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 237\u2013254. Springer, Heidelberg (2010)"},{"key":"1_CR14","unstructured":"Cha, J.C., Cheon, J.H.: An identity-based signature from Gap Diffie-Hellman groups. In: Desmedt [17], pp. 18\u201330"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/11535218_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"B. Chevallier-Mames","year":"2005","unstructured":"Chevallier-Mames, B.: An Efficient CDH-Based Signature Scheme with a Tight Security Reduction. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 511\u2013526. Springer, Heidelberg (2005)"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jsc.2011.11.003","volume":"47","author":"J.-M. Couveignes","year":"2012","unstructured":"Couveignes, J.-M., Kammerer, J.-G.: The geometry of flex tangents to a cubic curve and its parameterizations. Journal of Symbolic Computation\u00a047(3), 266\u2013281 (2012)","journal-title":"Journal of Symbolic Computation"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Public Key Cryptography - PKC 2003","year":"2002","unstructured":"Desmedt, Y.G. (ed.): PKC 2003. LNCS, vol.\u00a02567. Springer, Heidelberg (2002)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-21969-6_17","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"R.R. Farashahi","year":"2011","unstructured":"Farashahi, R.R.: Hashing into Hessian Curves. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol.\u00a06737, pp. 278\u2013289. Springer, Heidelberg (2011)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Farashahi, R.R., Fouque, P.-A., Shparlinski, I.E., Tibouchi, M., Voloch, J.F.: Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Math. Comput. (to appear, 2012)","DOI":"10.1090\/S0025-5718-2012-02606-8"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1515\/JMC.2009.022","volume":"3","author":"R.R. Farashahi","year":"2010","unstructured":"Farashahi, R.R., Shparlinski, I.E., Voloch, J.F.: On hashing into elliptic curves. J. Math. Cryptology\u00a03, 353\u2013360 (2010)","journal-title":"J. Math. Cryptology"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., Tibouchi, M.: Deterministic encoding and hashing to odd hyperelliptic curves. In: Joye et al. [28], pp. 265\u2013277","DOI":"10.1007\/978-3-642-17455-1_17"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-14712-8_5","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"P.-A. Fouque","year":"2010","unstructured":"Fouque, P.-A., Tibouchi, M.: Estimating the Size of the Image of Deterministic Hash Functions to Elliptic Curves. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol.\u00a06212, pp. 81\u201391. Springer, Heidelberg (2010)"},{"key":"1_CR23","series-title":"Ergebnisse der Mathematik und ihrer Grenzgebiete","doi-asserted-by":"crossref","DOI":"10.1007\/b138352","volume-title":"Field arithmetic","author":"M.D. Fried","year":"2005","unstructured":"Fried, M.D., Jarden, M.: Field arithmetic, 2nd edn. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol.\u00a011. Springer, Berlin (2005)","edition":"2"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Gentry, C., Silverberg, A.: Hierarchical ID-based cryptography. In: Zheng [43], pp. 548\u2013566","DOI":"10.1007\/3-540-36178-2_34"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-46035-7_31","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"J. Horwitz","year":"2002","unstructured":"Horwitz, J., Lynn, B.: Toward Hierarchical Identity-Based Encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 466\u2013481. Springer, Heidelberg (2002)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-03356-8_18","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"T. Icart","year":"2009","unstructured":"Icart, T.: How to Hash into Elliptic Curves. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 303\u2013316. Springer, Heidelberg (2009)"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/242896.242897","volume":"26","author":"D.P. Jablon","year":"1996","unstructured":"Jablon, D.P.: Strong password-only authenticated key exchange. SIGCOMM Comput. Commun. Rev.\u00a026, 5\u201326 (1996)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-17455-1_13","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"J. Groth","year":"2010","unstructured":"Groth, J.: Pairing-Based Non-interactive Zero-Knowledge Proofs. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 206\u2013206. Springer, Heidelberg (2010)"},{"key":"1_CR29","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":"1_CR30","doi-asserted-by":"crossref","unstructured":"Kammerer, J.-G., Lercier, R., Renault, G.: Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time. In: Joye et al. [28], pp. 278\u2013297","DOI":"10.1007\/978-3-642-17455-1_18"},{"issue":"2","key":"1_CR31","doi-asserted-by":"publisher","first-page":"133","DOI":"10.2307\/2323198","volume":"96","author":"L.-C. Kappe","year":"1989","unstructured":"Kappe, L.-C., Warren, B.: An elementary test for the Galois group of a quartic polynomial. Amer. Math. Monthly\u00a096(2), 133\u2013137 (1989)","journal-title":"Amer. Math. Monthly"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Libert, B., Quisquater, J.-J.: Efficient signcryption with key privacy from Gap Diffie-Hellman groups. In: Bao et al. [2], pp. 187\u2013200","DOI":"10.1007\/978-3-540-24632-9_14"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U.M. Maurer","year":"2004","unstructured":"Maurer, U.M., Renner, R.S., Holenstein, C.: Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 21\u201339. Springer, Heidelberg (2004)"},{"issue":"8","key":"1_CR34","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.jss.2011.03.083","volume":"84","author":"G.C.C.F. Pereira","year":"2011","unstructured":"Pereira, G.C.C.F., Simpl\u00edcio Jr., M.A., Naehrig, M., Barreto, P.S.L.M.: A family of implementation-friendly BN elliptic curves. The Journal of Systems and Software\u00a084(8), 1319\u20131326 (2011)","journal-title":"The Journal of Systems and Software"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-20465-4_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"T. Ristenpart","year":"2011","unstructured":"Ristenpart, T., Shacham, H., Shrimpton, T.: Careful with Composition: Limitations of the Indifferentiability Framework. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 487\u2013506. Springer, Heidelberg (2011)"},{"issue":"A","key":"1_CR36","first-page":"33","volume":"1","author":"H. Sato","year":"2009","unstructured":"Sato, H., Hakuta, K.: An efficient method of generating rational points on elliptic curves. J. Math-for-Industry\u00a01(A), 33\u201344 (2009)","journal-title":"J. Math-for-Industry"},{"issue":"3","key":"1_CR37","doi-asserted-by":"publisher","first-page":"223","DOI":"10.4064\/ba52-3-1","volume":"52","author":"A. Schinzel","year":"2004","unstructured":"Schinzel, A., Ska\u0142ba, M.: On equations y 2\u2009=\u2009x n \u2009+\u2009k in a finite field. Bull. Pol. Acad. Sci. Math.\u00a052(3), 223\u2013226 (2004)","journal-title":"Bull. Pol. Acad. Sci. Math."},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/11792086_36","volume-title":"Algorithmic Number Theory","author":"A. Shallue","year":"2006","unstructured":"Shallue, A., van de Woestijne, C.E.: Construction of Rational Points on Elliptic Curves over Finite Fields. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 510\u2013524. Springer, Heidelberg (2006)"},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"293","DOI":"10.4064\/aa117-3-7","volume":"117","author":"M. Ska\u0142ba","year":"2005","unstructured":"Ska\u0142ba, M.: Points on elliptic curves over finite fields. Acta Arith.\u00a0117, 293\u2013301 (2005)","journal-title":"Acta Arith."},{"key":"1_CR40","unstructured":"Tibouchi, M.: Hachage vers les courbes elliptiques et cryptanalyse de sch\u00e9mas RSA. PhD thesis, Univ. Paris 7 and Univ. Luxembourg, Introduction in French, main matter in English (2011)"},{"key":"1_CR41","unstructured":"Tibouchi, M.: A note on hasing to BN curves. In: Miyaji, A. (ed.) SCIS. IEICE (2012)"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Zhang, F., Kim, K.: ID-based blind signature and ring signature from pairings. In: Zheng [43], pp. 533\u2013547","DOI":"10.1007\/3-540-36178-2_33"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - ASIACRYPT 2002","year":"2002","unstructured":"Zheng, Y. (ed.): ASIACRYPT 2002. LNCS, vol.\u00a02501. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33481-8_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:11:56Z","timestamp":1620130316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33481-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334801","9783642334818"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33481-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}