{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:47:57Z","timestamp":1764132477404},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540892540"},{"type":"electronic","value":"9783540892557"}],"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-89255-7_30","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T02:27:00Z","timestamp":1228098420000},"page":"489-505","source":"Crossref","is-referenced-by-count":12,"title":["Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems"],"prefix":"10.1007","author":[{"given":"Andy","family":"Rupp","sequence":"first","affiliation":[]},{"given":"Gregor","family":"Leander","sequence":"additional","affiliation":[]},{"given":"Endre","family":"Bangerter","sequence":"additional","affiliation":[]},{"given":"Alexander W.","family":"Dent","sequence":"additional","affiliation":[]},{"given":"Ahmad-Reza","family":"Sadeghi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"30_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":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","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":"30_CR3","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":"30_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":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-24676-3_14","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Efficient selective-ID secure identity based encryption without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 223\u2013238. Springer, Heidelberg (2004)"},{"key":"30_CR6","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":"30_CR7","unstructured":"Boneh, D.: Number-theoretic assumptions. TCC\u2019s Special Session on Assumptions for Cryptography (2007) (Invited Talk)"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-45311-3_32","volume-title":"Progress in Cryptology - INDOCRYPT 2001","author":"E. Kiltz","year":"2001","unstructured":"Kiltz, E.: A tool box of cryptographic functions related to the Diffie-Hellman function. In: Pandu Rangan, C., Ding, C. (eds.) INDOCRYPT 2001. LNCS, vol.\u00a02247, pp. 339\u2013350. Springer, Heidelberg (2001)"},{"key":"30_CR9","unstructured":"Boneh, D., Boyen, X., Goh, E.: Hierarchical identity based encryption with constant size ciphertext (full paper). Cryptology ePrint Archive, Report 2005\/015 (2005), \n                    \n                      http:\/\/eprint.iacr.org\/2005\/015"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-74143-5_27","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"E. Bresson","year":"2007","unstructured":"Bresson, E., Lakhnech, Y., Mazar\u00e9, L., Warinschi, B.: A generalization of DDH with applications to protocol analysis and computational soundness. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 482\u2013499. Springer, Heidelberg (2007)"},{"key":"30_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-44987-6_16","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"A. Sadeghi","year":"2001","unstructured":"Sadeghi, A., Steiner, M.: Assumptions related to discrete logarithms: Why subtleties make a real difference. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 244\u2013260. Springer, Heidelberg (2001)"},{"key":"30_CR12","unstructured":"Rupp, A., Leander, G., Bangerter, E., Dent, A.W., Sadeghi, A.R.: Sufficient conditions for intractability over black-box groups: Generic lower bounds for generalized DL and DH problems (full version). Cryptology ePrint Archive, Report 2007\/360 (2007), \n                    \n                      http:\/\/eprint.iacr.org\/2007\/360"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89255-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T02:21:37Z","timestamp":1551666097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89255-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540892540","9783540892557"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89255-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}