{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:42:44Z","timestamp":1777372964456,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642346002","type":"print"},{"value":"9783642346019","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34601-9_9","type":"book-chapter","created":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T02:04:18Z","timestamp":1353031458000},"page":"113-125","source":"Crossref","is-referenced-by-count":8,"title":["Proxy Signature Scheme Based on Isomorphisms of Polynomials"],"prefix":"10.1007","author":[{"given":"Shaohua","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingling","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","first-page":"5","volume":"2","author":"A. Awasthi","year":"2005","unstructured":"Awasthi, A., Lal, S.: Proxy Blind Signature Scheme. Transaction on Cryptology\u00a02(1), 5\u201311 (2005)","journal-title":"Transaction on Cryptology"},{"key":"9_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Post Quantum Cryptography, Department of Computer Science, University of Illinois, Chicago","author":"D.J. Bernstein","year":"2009","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post Quantum Cryptography, Department of Computer Science, University of Illinois, Chicago. Springer, Heidelberg (2009)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00145-010-9082-x","volume":"25","author":"A. Boldyreva","year":"2012","unstructured":"Boldyreva, A., Palacio, A., Warinschi, B.: Secure Proxy Signature Schemes for Delegation of Signing Rights. Journal of Cryptology\u00a025(1), 57\u2013115 (2012)","journal-title":"Journal of Cryptology"},{"key":"9_CR4","unstructured":"Bouillaguet, C., Faug\u00e8re, J., Fouque, P., Perret, L.: Differential Algorithms for the Isomorphism of Polynomials Problem (2009) (manuscript), \n                    \n                      http:\/\/eprint.iacr.org\/2009\/583.pdf"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-17401-8_3","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"S. Bulygin","year":"2010","unstructured":"Bulygin, S., Petzoldt, A., Buchmann, J.: Towards Provable Security of the Unbalanced Oil and Vinegar Signature Scheme under Direct Attacks. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol.\u00a06498, pp. 17\u201332. Springer, Heidelberg (2010)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11787006_14","volume-title":"Automata, Languages and Programming","author":"V. Dubois","year":"2006","unstructured":"Dubois, V., Granboulan, L., Stern, J.: An Efficient Provable Distinguisher for HFE. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 156\u2013167. Springer, Heidelberg (2006)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11761679_3","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J.-C. Faug\u00e8re","year":"2006","unstructured":"Faug\u00e8re, J.-C., Perret, L.: Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 30\u201347. Springer, Heidelberg (2006)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-85855-3_14","volume-title":"Security and Cryptography for Networks","author":"G. Fuchsbauer","year":"2008","unstructured":"Fuchsbauer, G., Pointcheval, D.: Anonymous Proxy Signatures. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol.\u00a05229, pp. 201\u2013217. Springer, Heidelberg (2008)"},{"key":"9_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-completeness. W.H. Freeman (1979)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10207-003-0025-5","volume":"2","author":"W. Geiselmann","year":"2003","unstructured":"Geiselmann, W., Meier, W.: An Attack on the Isomorphisms of Polynomials Problem with One Secret. International Journal of Information Security\u00a02, 59\u201364 (2003)","journal-title":"International Journal of Information Security"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BFb0028478","volume-title":"Information and Communications Security","author":"S. Kim","year":"1997","unstructured":"Kim, S., Park, S., Won, D.: Proxy Signatures, Revisited. In: Information and Communications Security, pp. 223\u2013232. Springer, Heidelberg (1997)"},{"key":"9_CR12","unstructured":"Mambo, M., Usuda, K., Okamoto, E.: Proxy Signatures: Delegation of The Power to Sign Messages. IEICE Transactions on Fundamentals, E79-A(9), 1338-1353 (1996)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Mambo, M., Usuda, K., Okamoto, E.: Proxy Signatures for Delegating Signing Operation. In: Proceedings of the 3rd ACM Conference on Computer and Communications Security, pp. 48-57. ACM (1996)","DOI":"10.1145\/238168.238185"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0054126","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"J. Patarin","year":"1998","unstructured":"Patarin, J., Goubin, L., Courtois, N.T.: Improved Algorithms for Isomorphisms of Polynomials. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 184\u2013200. Springer, Heidelberg (1998)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-68339-9_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J. Patarin","year":"1996","unstructured":"Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 33\u201348. Springer, Heidelberg (1996)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11426639_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"L. Perret","year":"2005","unstructured":"Perret, L.: A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 354\u2013370. Springer, Heidelberg (2005)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-25405-5_5","volume-title":"Post-Quantum Cryptography","author":"K. Sakumoto","year":"2011","unstructured":"Sakumoto, K., Shirai, T., Hiwatari, H.: On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol.\u00a07071, pp. 68\u201382. Springer, Heidelberg (2011)"},{"issue":"5","key":"9_CR18","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-24582-7_18","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"F. Levy-dit-Vehel","year":"2003","unstructured":"Levy-dit-Vehel, F., Perret, L.: Polynomial Equivalence Problems. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol.\u00a02904, pp. 235\u2013251. Springer, Heidelberg (2003)"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/BFb0030429","volume-title":"Information Security","author":"K. Zhang","year":"1998","unstructured":"Zhang, K.: Threshold Proxy Signature Schemes. In: Okamoto, E. (ed.) ISW 1997. LNCS, vol.\u00a01396, pp. 282\u2013290. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34601-9_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:00:36Z","timestamp":1620133236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34601-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346002","9783642346019"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34601-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}