{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:27:40Z","timestamp":1752550060718},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,8]],"date-time":"2012-03-08T00:00:00Z","timestamp":1331164800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s00145-012-9120-y","type":"journal-article","created":{"date-parts":[[2012,3,7]],"date-time":"2012-03-07T16:08:47Z","timestamp":1331136527000},"page":"225-245","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On the Analysis of Cryptographic Assumptions in the Generic Ring Model"],"prefix":"10.1007","volume":"26","author":[{"given":"Tibor","family":"Jager","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Schwenk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,8]]},"reference":[{"key":"9120_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-01001-9_2","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2009","author":"D. Aggarwal","year":"2009","unstructured":"D. Aggarwal, U. Maurer, Breaking RSA generically is equivalent to factoring, in Advances in Cryptology\u2014EUROCRYPT 2009, Cologne, Germany, April 26\u201330, ed. by A. Joux. Lecture Notes in Computer Science, vol. 5479 (Springer, Berlin, 2009), pp. 36\u201353"},{"key":"9120_CR2","volume-title":"Workshop on Coding and Cryptography\u2014WCC","author":"D. Aggarwal","year":"2011","unstructured":"D. Aggarwal, U. Maurer, I. Shparlinski, The equivalence of strong RSA and factoring in the generic ring model of computation, in Workshop on Coding and Cryptography\u2014WCC, ed. by D. Augot, A. Canteaut (INRIA, Rocquencourt, 2011)"},{"key":"9120_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/978-3-540-70583-3_36","volume-title":"ICALP 2008: 35th International Colloquium on Automata, Languages and Programming, Part II","author":"K. Altmann","year":"2008","unstructured":"K. Altmann, T. Jager, A. Rupp, On black-box ring extraction and integer factorization, in ICALP 2008: 35th International Colloquium on Automata, Languages and Programming, Part II, Reykjavik, Iceland, July 7\u201311, ed. by L. Aceto, I. Damg\u00e5rd, L.A. Goldberg, M.M. Halld\u00f3rsson, A. Ing\u00f3lfsd\u00f3ttir, I.\u00a0Walukiewicz. Lecture Notes in Computer Science, vol. 5126 (Springer, Berlin, 2008), pp. 437\u2013448"},{"key":"9120_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11799313_21","volume-title":"Fast Software Encryption\u2014FSE 2006","author":"J. Black","year":"2006","unstructured":"J. Black, The ideal-cipher model, revisited: An uninstantiable blockcipher-based hash function, in Fast Software Encryption\u2014FSE 2006, Graz, Austria, March 15\u201317, ed. by M.J.B. Robshaw. Lecture Notes in Computer Science, vol. 4047 (Springer, Berlin, 2006), pp. 328\u2013340"},{"issue":"2","key":"9120_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D. Boneh","year":"2008","unstructured":"D. Boneh, X. Boyen, Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol.\n                  21(2), 149\u2013177 (2008)","journal-title":"J. Cryptol."},{"key":"9120_CR6","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\u2014CRYPTO\u201996","author":"D. Boneh","year":"1996","unstructured":"D. Boneh, R.J. Lipton, Algorithms for black-box fields and their application to cryptography (extended abstract), in Advances in Cryptology\u2014CRYPTO\u201996, Santa Barbara, CA, USA, August 18\u201322, ed. by N.\u00a0Koblitz. Lecture Notes in Computer Science, vol. 1109 (Springer, Berlin, 1996), pp. 283\u2013297"},{"key":"9120_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BFb0054117","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201998","author":"D. Boneh","year":"1998","unstructured":"D. Boneh, R. Venkatesan, Breaking RSA may not be equivalent to factoring, in Advances in Cryptology\u2014EUROCRYPT\u201998, Espoo, Finland, May 31\u2013June 4, ed. by K. Nyberg. Lecture Notes in Computer Science, vol. 1403 (Springer, Berlin, 1998), pp. 59\u201371"},{"key":"9120_CR8","unstructured":"D.R.L. Brown, Breaking RSA may be as difficult as factoring. Cryptology ePrint Archive, Report 2005\/380, 2005. \n                    http:\/\/eprint.iacr.org\/"},{"issue":"4","key":"9120_CR9","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"R. Canetti, O. Goldreich, S. Halevi, The random oracle methodology, revisited. J. ACM\n                  51(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"key":"9120_CR10","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\u2014EUROCRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"I. Damg\u00e5rd, M. Koprowski, Generic lower bounds for root extraction and signature schemes in general groups, in Advances in Cryptology\u2014EUROCRYPT 2002, Amsterdam, The Netherlands, April 28\u2013May 2, ed. by L.R. Knudsen. Lecture Notes in Computer Science, vol. 2332 (Springer, Berlin, 2002), pp. 256\u2013271"},{"key":"9120_CR11","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\u2013ASIACRYPT 2002","author":"A.W. Dent","year":"2002","unstructured":"A.W. Dent, Adapting the weaknesses of the random oracle model to the generic group model, in Advances in Cryptology\u2013ASIACRYPT 2002, Queenstown, New Zealand, December 1\u20135, ed. by Y. Zheng. Lecture Notes in Computer Science, vol. 2501 (Springer, Berlin, 2002), pp. 100\u2013109"},{"key":"9120_CR12","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, M. Hellman, New directions in cryptography. IEEE Trans. Inf. Theory\n                  22, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9120_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/3-540-44448-3_35","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2000","author":"M. Fischlin","year":"2000","unstructured":"M. Fischlin, A note on security proofs in the generic model, in Advances in Cryptology\u2014ASIACRYPT 2000, Kyoto, Japan, December 3\u20137, ed. by T. Okamoto. Lecture Notes in Computer Science, vol. 1976 (Springer, Berlin, 2000), pp. 458\u2013469"},{"issue":"2","key":"9120_CR14","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci.\n                  28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"9120_CR15","unstructured":"T. Jager, Generic group algorithms. Master\u2019s thesis, Ruhr-University Bochum, 2007"},{"key":"9120_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-10366-7_24","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2009","author":"T. Jager","year":"2009","unstructured":"T. Jager, J. Schwenk, On the analysis of cryptographic assumptions in the generic ring model, in Advances in Cryptology\u2014ASIACRYPT 2009, Tokyo, Japan, December 6\u201310, ed. by M. Matsui. Lecture Notes in Computer Science, vol. 5912 (Springer, Berlin, 2009), pp. 399\u2013416"},{"key":"9120_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11935230_16","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2006","author":"G. Leander","year":"2006","unstructured":"G. Leander, A. Rupp, On the equivalence of RSA and factoring regarding generic ring algorithms, in Advances in Cryptology\u2014ASIACRYPT 2006, Shanghai, China, December 3\u20137, ed. by X. Lai, K. Chen. Lecture Notes in Computer Science, vol. 4284 (Springer, Berlin, 2006), pp. 241\u2013251"},{"key":"9120_CR18","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"IMA Int. Conf","author":"U.M. Maurer","year":"2005","unstructured":"U.M. Maurer, Abstract models of computation in cryptography, in IMA Int. Conf, ed. by N.P. Smart. Lecture Notes in Computer Science, vol. 3796 (Springer, Berlin, 2005), pp. 1\u201312"},{"key":"9120_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-540-76900-2_26","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2007","author":"U.M. Maurer","year":"2007","unstructured":"U.M. Maurer, D. Raub, Black-box extension fields and the inexistence of field-homomorphic one-way permutations, in Advances in Cryptology\u2014ASIACRYPT 2007, Kuching, Malaysia, December 2\u20136, ed. by K. Kurosawa. Lecture Notes in Computer Science, vol. 4833 (Springer, Berlin, 2007), pp. 427\u2013443"},{"key":"9120_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0054118","volume-title":"Advances in Cryptology\u2014EUROCRYPT\u201998","author":"U.M. Maurer","year":"1998","unstructured":"U.M. Maurer, S. Wolf, Lower bounds on generic algorithms in groups, in Advances in Cryptology\u2014EUROCRYPT\u201998, Espoo, Finland, May 31\u2013June 4, ed. by K. Nyberg. Lecture Notes in Computer Science, vol. 1403 (Springer, Berlin, 1998), pp. 72\u201384"},{"issue":"2","key":"9120_CR21","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02113297","volume":"55","author":"V.I. Nechaev","year":"1994","unstructured":"V.I. Nechaev, Complexity of a determinate algorithm for the discrete logarithm. Math. Notes\n                  55(2), 165\u2013172 (1994)","journal-title":"Math. Notes"},{"key":"9120_CR22","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L. Rivest, A. Shamir, L.M. Adleman, A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM\n                  21, 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"9120_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-540-89255-7_30","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2008","author":"A. Rupp","year":"2008","unstructured":"A. Rupp, G. Leander, E. Bangerter, A.W. Dent, A.-R. Sadeghi, Sufficient conditions for intractability over black-box groups: Generic lower bounds for generalized DL and DH problems, in Advances in Cryptology\u2014ASIACRYPT 2008, Melbourne, Australia, December 7\u201311, ed. by J. Pieprzyk. Lecture Notes in Computer Science, vol. 5350 (Springer, Berlin, 2008), pp. 489\u2013505"},{"issue":"4","key":"9120_CR24","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"J.T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities. J. ACM\n                  27(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"9120_CR25","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\u2014EUROCRYPT\u201997","author":"V. Shoup","year":"1997","unstructured":"V. Shoup, Lower bounds for discrete logarithms and related problems, in Advances in Cryptology\u2014EUROCRYPT\u201997, Konstanz, Germany, May 11\u201315, ed. by W. Fumy. Lecture Notes in Computer Science, vol. 1233 (Springer, Berlin, 1997), pp. 256\u2013266"},{"key":"9120_CR26","unstructured":"V. Shoup, Sequences of games: A tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004\/332, 2004. \n                    http:\/\/eprint.iacr.org\/"},{"key":"9120_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814549","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V. Shoup","year":"2008","unstructured":"V. Shoup, A Computational Introduction to Number Theory and Algebra, 2nd edn. (Cambridge University Press, Cambridge, 2008)","edition":"2"},{"key":"9120_CR28","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R. Zippel","year":"1979","unstructured":"R. Zippel, Probabilistic algorithms for sparse polynomials, in Symbolic and Algebraic Computation (1979), pp. 216\u2013226"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9120-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-012-9120-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9120-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-012-9120-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:08:31Z","timestamp":1586333311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-012-9120-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,8]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["9120"],"URL":"https:\/\/doi.org\/10.1007\/s00145-012-9120-y","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,8]]},"assertion":[{"value":"17 December 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2012","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}