{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:46Z","timestamp":1766281006408,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540887324"},{"type":"electronic","value":"9783540887331"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-88733-1_14","type":"book-chapter","created":{"date-parts":[[2008,10,16]],"date-time":"2008-10-16T22:08:02Z","timestamp":1224194882000},"page":"200-209","source":"Crossref","is-referenced-by-count":16,"title":["On the Equivalence of Generic Group Models"],"prefix":"10.1007","author":[{"given":"Tibor","family":"Jager","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Schwenk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"V.I. Nechaev","year":"1994","unstructured":"Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes\u00a055(2), 165\u2013172 (1994)","journal-title":"Mathematical Notes"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT 1997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"Cryptography and Coding","author":"U.M. Maurer","year":"2005","unstructured":"Maurer, U.M.: Abstract models of computation in cryptography. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 1\u201312. Springer, Heidelberg (2005)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-46035-7_17","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Koprowski, M.: Generic lower bounds for root extraction and signature schemes in general groups. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 256\u2013271. Springer, Heidelberg (2002)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11935230_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"G. Leander","year":"2006","unstructured":"Leander, G., Rupp, A.: On the equivalence of RSA and factoring regarding generic ring algorithms. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 241\u2013251. Springer, Heidelberg (2006)"},{"key":"14_CR6","unstructured":"Aggarwal, D., Maurer, U.: Factoring is equivalent to generic RSA. Cryptology ePrint Archive, Report 2008\/260 (2008), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P., Jakobsson, M.: Security of signed elgamal encryption. In: [24], pp. 73\u201389","DOI":"10.1007\/3-540-44448-3_7"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-45325-3_8","volume-title":"IMA Int. Conf.","author":"N.P. Smart","year":"2001","unstructured":"Smart, N.P.: The exact security of ECIES in the generic group model. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol.\u00a02260, pp. 73\u201384. Springer, Heidelberg (2001)"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10623-003-6154-z","volume":"35","author":"D.R.L. Brown","year":"2005","unstructured":"Brown, D.R.L.: Generic groups, collision resistance, and ECDSA. Des. Codes Cryptography\u00a035(1), 119\u2013152 (2005)","journal-title":"Des. Codes Cryptography"},{"key":"14_CR10","unstructured":"Dent, A.W.: The hardness of the DHK problem in the generic group model. Cryptology ePrint Archive, Report 2006\/156 (2006), \n                    \n                      http:\/\/eprint.iacr.org\/\n                    \n                    \n                  ."},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D. Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptology\u00a021(2), 149\u2013177 (2008)","journal-title":"J. Cryptology"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In: Lewis, D.J. (ed.) 1969 Number Theory Institute. Proceedings of Symposia in Pure Mathematics, Providence, Rhode Island, vol.\u00a020, pp. 415\u2013440. American Mathematical Society (1971)","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J.M. Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. BIT\u00a015, 331\u2013334 (1975)","journal-title":"BIT"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-39757-4_20","volume-title":"Advances in Cryptology","author":"A.M. Odlyzko","year":"1985","unstructured":"Odlyzko, A.M.: Discrete logarithms in finite fields and their cryptographic significance. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol.\u00a0209, pp. 224\u2013314. Springer, Heidelberg (1985)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Fischlin, M.: A note on security proofs in the generic model. In: [24] pp. 458\u2013469","DOI":"10.1007\/3-540-44448-3_35"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-36178-2_6","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"A.W. Dent","year":"2002","unstructured":"Dent, A.W.: Adapting the weaknesses of the random oracle model to the generic group model. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 100\u2013109. Springer, Heidelberg (2002)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-48658-5_26","volume-title":"Advances in Cryptology - CRYPTO 1994","author":"U.M. Maurer","year":"1994","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete algorithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 271\u2013281. Springer, Heidelberg (1994)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/3-540-68697-5_22","volume-title":"Advances in Cryptology - CRYPTO 1996","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Lipton, R.J.: Algorithms for black-box fields and their application to cryptography (extended abstract). In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 283\u2013297. Springer, Heidelberg (1996)"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BFb0054118","volume-title":"Advances in Cryptology - EUROCRYPT 1998","author":"U.M. Maurer","year":"1998","unstructured":"Maurer, U.M., Wolf, S.: Lower bounds on generic algorithms in groups. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 72\u201384. Springer, Heidelberg (1998)"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-540-70583-3_36","volume-title":"Automata, Languages and Programming","author":"K. Altmann","year":"2008","unstructured":"Altmann, K., Jager, T., Rupp, A.: On black-box ring extraction and integer factorization. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 437\u2013448. Springer, Heidelberg (2008)"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3934\/amc.2007.1.13","volume":"1","author":"N. Koblitz","year":"2007","unstructured":"Koblitz, N., Menezes, A.: Another look at generic groups. Advances in Mathematics of Communications\u00a01, 13\u201328 (2007)","journal-title":"Advances in Mathematics of Communications"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security","year":"2000","unstructured":"Okamoto, T. (ed.): ASIACRYPT 2000. LNCS, vol.\u00a01976. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88733-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T14:16:50Z","timestamp":1551622610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88733-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540887324","9783540887331"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88733-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}