{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:56:28Z","timestamp":1769298988740,"version":"3.49.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319124742","type":"print"},{"value":"9783319124759","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12475-9_3","type":"book-chapter","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T09:25:19Z","timestamp":1412155519000},"page":"29-39","source":"Crossref","is-referenced-by-count":7,"title":["Impossibility of Surjective Icart-Like Encodings"],"prefix":"10.1007","author":[{"given":"Mehdi","family":"Tibouchi","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-540-24632-9_19","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J. Baek","year":"2004","unstructured":"Baek, J., Zheng, Y.: Identity-based threshold decryption. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 262\u2013276. Springer, Heidelberg (2004)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: Elliptic-curve points indistinguishable from uniform random strings. In: Gligor, V., Yung, M. (eds.) ACM CCS (2013)","DOI":"10.1145\/2508859.2516734"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36288-6_3","volume-title":"Public Key Cryptography - PKC 2003","author":"A. Boldyreva","year":"2002","unstructured":"Boldyreva, A.: Threshold signatures, multisignatures and blind signatures based on the Gap-Diffie-Hellman-group signature scheme. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 31\u201346. Springer, Heidelberg (2002)"},{"key":"3_CR4","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":"3_CR5","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":"3_CR6","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)"},{"key":"3_CR7","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 (a swiss army knife for identity-based cryptography). In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 383\u2013399. Springer, Heidelberg (2003)"},{"key":"3_CR8","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":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-36288-6_2","volume-title":"Public Key Cryptography - PKC 2003","author":"J.C. Cha","year":"2003","unstructured":"Cha, J.C., Cheon, J.H.: An identity-based signature from Gap Diffie-Hellman groups. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 18\u201330. Springer, Heidelberg (2003)"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"3_CR12","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. J. Symb. Comput.\u00a047(3), 266\u2013281 (2012)","journal-title":"J. Symb. Comput."},{"key":"3_CR13","unstructured":"Couveignes, J.-M., Lercier, R.: The geometry of some parameterizations and encodings. arXiv:1310.1013 (2013)"},{"key":"3_CR14","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)"},{"issue":"281","key":"3_CR15","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1090\/S0025-5718-2012-02606-8","volume":"82","author":"R.R. Farashahi","year":"2013","unstructured":"Farashahi, R.R., Fouque, P.-A., Shparlinski, I., Tibouchi, M., Voloch, J.F.: Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. Math. Comp.\u00a082(281), 491\u2013512 (2013)","journal-title":"Math. Comp."},{"key":"3_CR16","first-page":"353","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":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-39059-3_14","volume-title":"Information Security and Privacy","author":"P.-A. Fouque","year":"2013","unstructured":"Fouque, P.-A., Joux, A., Tibouchi, M.: Injective encodings to elliptic curves. In: Boyd, C., Simpson, L. (eds.) ACISP 2013. LNCS, vol.\u00a07959, pp. 203\u2013218. Springer, Heidelberg (2013)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-17455-1_17","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"P.-A. Fouque","year":"2010","unstructured":"Fouque, P.-A., Tibouchi, M.: Deterministic encoding and hashing to odd hyperelliptic curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 265\u2013277. Springer, Heidelberg (2010)"},{"key":"3_CR19","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":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-33481-8_1","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2012","author":"P.-A. Fouque","year":"2012","unstructured":"Fouque, P.-A., Tibouchi, M.: Indifferentiable hashing to Barreto-Naehrig curves. In: Hevia, A., Neven, G. (eds.) LATINCRYPT 2012. LNCS, vol.\u00a07533, pp. 1\u201317. Springer, Heidelberg (2012)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Fried, M.D.: Global construction of general exceptional covers. In: Mullen, G.L., Shiue, P.J. (eds.) Finite Fields: Theory, Applications, and Algorithms. Contemporary Mathematics, vol.\u00a0168, pp. 69\u2013100. American Mathematical Society (1994)","DOI":"10.1090\/conm\/168\/01690"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02808112","volume":"82","author":"M.D. Fried","year":"1993","unstructured":"Fried, M.D., Guralnick, R.M., Saxl, J.: Schur covers and Carlitz\u2019s conjecture. Israel J. Math.\u00a082, 157\u2013225 (1993)","journal-title":"Israel J. Math."},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/3-540-36178-2_34","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"C. Gentry","year":"2002","unstructured":"Gentry, C., Silverberg, A.: Hierarchical ID-based cryptography. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 548\u2013566. Springer, Heidelberg (2002)"},{"key":"3_CR24","doi-asserted-by":"crossref","first-page":"71","DOI":"10.33232\/BIMS.0050.71.96","volume":"50","author":"R.M. Guralnick","year":"2003","unstructured":"Guralnick, R.M.: Rational maps and images of rational points of curves over finite fields. Irish Math. Soc. Bull.\u00a050, 71\u201395 (2003)","journal-title":"Irish Math. Soc. Bull."},{"key":"3_CR25","unstructured":"Guralnick, R.M., Tucker, T.J., Zieve, M.E.: Exceptional covers and bijections on rational points. Int. Math. Res. Not., Article ID 004, 19 pages (2007)"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF02760932","volume":"101","author":"R.M. Guralnick","year":"1997","unstructured":"Guralnick, R.M., Wan, D.: Bounds for fixed point free elements in a transitive group and applications to curves over finite fields. Israel J. Math.\u00a0101, 255\u2013287 (1997)","journal-title":"Israel J. Math."},{"key":"3_CR27","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":"3_CR28","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":"3_CR29","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":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-17455-1_18","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"J.-G. Kammerer","year":"2010","unstructured":"Kammerer, J.-G., Lercier, R., Renault, G.: Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 278\u2013297. Springer, Heidelberg (2010)"},{"key":"3_CR31","first-page":"523","volume":"319","author":"V. Kumar Murty","year":"1994","unstructured":"Kumar Murty, V., Scherk, J.: Effective versions of the Chebotarev density theorem for function fields. C. R. Acad. Sci. Paris\u00a0319, 523\u2013528 (1994)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-24632-9_14","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"B. Libert","year":"2004","unstructured":"Libert, B., Quisquater, J.-J.: Efficient signcryption with key privacy from Gap Diffie-Hellman groups. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 187\u2013200. Springer, Heidelberg (2004)"},{"issue":"5","key":"3_CR33","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.A.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"A","key":"3_CR34","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":"4","key":"3_CR35","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1090\/S0273-0979-03-00992-3","volume":"40","author":"J.-P. Serre","year":"2003","unstructured":"Serre, J.-P.: On a theorem of Jordan. Bull. Amer. Math. Soc.\u00a040(4), 429\u2013440 (2003)","journal-title":"Bull. Amer. Math. Soc."},{"key":"3_CR36","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":"3_CR37","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":"3_CR38","unstructured":"Tibouchi, M.: Hachage vers les courbes elliptiques et cryptanalyse de sch\u00e9mas RSA. PhD thesis, Univ. Paris 7 and Univ. Luxembourg (2011), Introduction in French, main matter in English"},{"key":"3_CR39","unstructured":"Tibouchi, M.: Indifferentiable deterministic hashing to elliptic and hyperelliptic curves. In: Batina, L., et al. (eds.) ECC 2013 (2013)"},{"key":"3_CR40","unstructured":"Tibouchi, M.: Elligator Squared: Uniform points on elliptic curves of prime order as uniform random strings. In: Christin, N., Safavi-Naini, R. (eds.) Financial Cryptography (to appear, 2014), http:\/\/eprint.iacr.org\/2014\/043"},{"issue":"2","key":"3_CR41","doi-asserted-by":"publisher","first-page":"97","DOI":"10.4064\/ba55-2-1","volume":"55","author":"M. Ulas","year":"2007","unstructured":"Ulas, M.: Rational points on certain hyperelliptic curves over finite fields. Bull. Pol. Acad. Sci. Math.\u00a055(2), 97\u2013104 (2007)","journal-title":"Bull. Pol. Acad. Sci. Math."},{"key":"3_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-36178-2_33","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"F. Zhang","year":"2002","unstructured":"Zhang, F., Kim, K.: ID-based blind signature and ring signature from pairings. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 533\u2013547. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12475-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T14:23:46Z","timestamp":1650291826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12475-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319124742","9783319124759"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12475-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}