{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:38:48Z","timestamp":1725536328768},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035630"},{"type":"electronic","value":"9783642035647"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03564-7_21","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T07:05:35Z","timestamp":1250751935000},"page":"318-323","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Interpolation of the k-th Root of the Discrete Logarithm"],"prefix":"10.1007","author":[{"given":"Gerasimos C.","family":"Meletiou","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-48390-X_15","volume-title":"FCT 1999","author":"G. Ateniese","year":"1999","unstructured":"Ateniese, G., Tsudik, G.: Some open issues and new directions in group signatures. In: Franklin, M. (ed.) FCT 1999. LNCS, vol.\u00a01684, pp. 196\u2013211. Springer, Heidelberg (1999)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11779360_12","volume-title":"Coding and Cryptography","author":"C. Adelmann","year":"2006","unstructured":"Adelmann, C., Winterhof, A.: Interpolation of functions related to the integer factoring problem. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol.\u00a03969, pp. 144\u2013154. Springer, Heidelberg (2006)"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.ffa.2005.05.010","volume":"12","author":"H. Aly","year":"2006","unstructured":"Aly, H., Winterhof, A.: Polynomial representations of the Lucas logarithm. Finite Fields Appl.\u00a012(3), 413\u2013424 (2006)","journal-title":"Finite Fields Appl."},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44586-2_15","volume-title":"Public Key Cryptography","author":"E. Bresson","year":"2001","unstructured":"Bresson, E., Stern, J.: Efficient Revocation in Group Signatures. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 190\u2013206. Springer, Heidelberg (2001)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-24747-0_7","volume-title":"Trust Management","author":"L. Bussard","year":"2004","unstructured":"Bussard, L., Molva, R., Roudier, Y.: History-based signature or how to trust anonymous documents. In: Jensen, C., Poslad, S., Dimitrakos, T. (eds.) iTrust 2004. LNCS, vol.\u00a02995, pp. 78\u201392. Springer, Heidelberg (2004)"},{"key":"21_CR6","unstructured":"Camenisch, J.L.: Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem, Doctoral Dissertation, ZURICH (1998)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J.L. Camenisch","year":"1997","unstructured":"Camenisch, J.L., Stadler, M.A.: Efficient group signature schemes for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 410\u2013424. Springer, Heidelberg (1997)"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s001450010002","volume":"13","author":"D. Coppersmith","year":"2000","unstructured":"Coppersmith, D., Shparlinski, I.: On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping. J. Cryptology\u00a013(3), 339\u2013360 (2000)","journal-title":"J. Cryptology"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1017\/S0004972700019547","volume":"63","author":"E. Mahassni El","year":"2001","unstructured":"El Mahassni, E., Shparlinski, I.E.: Polynomial representations of the Diffie-Hellman mapping. Bull. Austral. Math. Soc.\u00a063, 467\u2013473 (2001)","journal-title":"Bull. Austral. Math. Soc."},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44495-5_10","volume-title":"Progress in Cryptology - INDOCRYPT 2000","author":"I.R. Jeong","year":"2000","unstructured":"Jeong, I.R., Lee, D.-H.: Anonymity control in multi-bank E-cash system. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol.\u00a01977, pp. 104\u2013116. Springer, Heidelberg (2000)"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/ietfec\/E88-A.1.81","volume":"E88-A","author":"C. Konoma","year":"2005","unstructured":"Konoma, C., Mambo, M., Shizuya, H.: The computational difficulty of solving cryptographic primitive problems related to the discrete logarithm problem. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a0E88-A(1), 81\u201388 (2005)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0055483","volume-title":"Financial Cryptography","author":"A. Lysyanskaya","year":"1998","unstructured":"Lysyanskaya, A., Ramzan, Z.: Group blind digital signatures: A scalable solution to electronic cash. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol.\u00a01465, pp. 184\u2013197. Springer, Heidelberg (1998)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00200-002-0104-2","volume":"13","author":"W. Meidl","year":"2002","unstructured":"Meidl, W., Winterhof, A.: A polynomial representation of the Diffie-Hellman mapping. Appl. Algebra Engrg. Comm. Comput.\u00a013, 313\u2013318 (2002)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"21_CR14","first-page":"25","volume":"29","author":"G.C. Meletiou","year":"1993","unstructured":"Meletiou, G.C.: Explicit form for the discrete logarithm over the field GF(p, k). Arch. Math (Brno)\u00a029, 25\u201328 (1993)","journal-title":"Arch. Math. (Brno)"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF01189026","volume":"3","author":"G.C. Meletiou","year":"1992","unstructured":"Meletiou, G.C., Mullen, G.L.: A note on discrete logarithms in finite fields. Appl. Algebra Engrg. Comm. Comput.\u00a03(1), 75\u201378 (1992)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-69499-1_1","volume-title":"Arithmetic of Finite Fields","author":"G.C. Meletiou","year":"2008","unstructured":"Meletiou, G.C., Winterhof, A.: Interpolation of the double discrete logarithm. In: von zur Gathen, J., Ima\u00f1a, J.L., Ko\u00e7, \u00c7.K. (eds.) WAIFI 2008. LNCS, vol.\u00a05130, pp. 1\u201310. Springer, Heidelberg (2008)"},{"issue":"3","key":"21_CR17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.4064\/aa-47-3-255-261","volume":"47","author":"G.L. Mullen","year":"1986","unstructured":"Mullen, G.L., White, D.: A polynomial representation for logarithms in GF(q). Acta Arith.\u00a047(3), 255\u2013261 (1986)","journal-title":"Acta Arith."},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01810847","volume":"1","author":"H. Niederreiter","year":"1990","unstructured":"Niederreiter, H.: A short proof for explicit formulas for discrete logarithms in finite fields. Appl. Algebra Engrg. Comm. Comput.\u00a01(1), 55\u201357 (1990)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/ffta.2001.0334","volume":"8","author":"H. Niederreiter","year":"2002","unstructured":"Niederreiter, H., Winterhof, A.: Incomplete character sums and polynomial interpolation of the discrete logarithm. Finite Fields Appl.\u00a08(2), 184\u2013192 (2002)","journal-title":"Finite Fields Appl."},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-47719-5_5","volume-title":"Information Security and Privacy","author":"C. Pavlovski","year":"2001","unstructured":"Pavlovski, C., Boyd, C.: Attacks based on small factors in various group structures. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol.\u00a02119, pp. 36\u201350. Springer, Heidelberg (2001)"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Shparlinski, I.E.: Cryptographic Applications of Analytic Number Theory. Complexity Lower Bounds and Pseudorandomness. Progress in Computer Science and Applied Logic, vol. 22. Birkhauser Verlag, Basel (2003)","DOI":"10.1007\/978-3-0348-8037-4_8"},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M.A. Stadler","year":"1996","unstructured":"Stadler, M.A.: Publicly verifiable secret sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 190\u2013199. Springer, Heidelberg (1996)"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-48970-3_19","volume-title":"Information Security and Privacy","author":"J. Traor\u00e9","year":"1999","unstructured":"Traor\u00e9, J.: Group signatures and their relevance to privacy protecting offline electronic cash systems. In: Pieprzyk, J.P., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol.\u00a01587, pp. 228\u2013243. Springer, Heidelberg (1999)"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1017\/S0004972700019936","volume":"64","author":"A. Winterhof","year":"2001","unstructured":"Winterhof, A.: A note on the interpolation of the Diffie-Hellman mapping. Bull. Austral. Math. Soc.\u00a064, 475\u2013477 (2001)","journal-title":"Bull. Austral. Math. Soc."},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1012556500517","volume":"25","author":"A. Winterhof","year":"2002","unstructured":"Winterhof, A.: Polynomial interpolation of the discrete logarithm. Des. Codes Cryptogr.\u00a025, 63\u201372 (2002)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03564-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:52:22Z","timestamp":1558493542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03564-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035630","9783642035647"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03564-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}