{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:39:00Z","timestamp":1765039140754},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642209000"},{"type":"electronic","value":"9783642209017"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20901-7_19","type":"book-chapter","created":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T10:11:30Z","timestamp":1307182290000},"page":"283-293","source":"Crossref","is-referenced-by-count":2,"title":["On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem"],"prefix":"10.1007","author":[{"given":"Fangguo","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-39927-8_28","volume-title":"Information and Communications Security","author":"F. Bao","year":"2003","unstructured":"Bao, F., Deng, R.H., Zhu, H.: Variations of Diffie-Hellman Problem. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol.\u00a02836, pp. 301\u2013312. Springer, Heidelberg (2003)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-49649-1_30","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"M. Burmester","year":"1998","unstructured":"Burmester, M., Desmedt, Y.G., Seberry, J.: Equitable key escrow with limited time span (or, how to enforce time expiration cryptographically). In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 380\u2013391. Springer, Heidelberg (1998)"},{"key":"19_CR3","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":"19_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031, 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR5","unstructured":"FIPS 186-2, Digital signature standard, Federal Information Processing Standards Publication 186-2 (February 2000)"},{"issue":"5","key":"19_CR6","first-page":"1083","volume":"87","author":"C. Konoma","year":"2004","unstructured":"Konoma, C., Mambo, M., Shizuya, H.: Complexity analysis of the cryptographic primitive problems through square-root exponent. IEICE Trans. Fundamentals\u00a0E87-A(5), 1083\u20131091 (2004)","journal-title":"IEICE Trans. Fundamentals"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/ietfec\/E88-A.1.81","volume":"88","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 Trans. Fundamentals\u00a0E88-A(1), 81\u201388 (2005)","journal-title":"IEICE Trans. Fundamentals"},{"key":"19_CR8","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 \u201994","author":"U.M. Maurer","year":"1994","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the diffie-hellman protocol and computing discrete logarithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 271\u2013281. Springer, Heidelberg (1994)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-68697-5_21","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"U.M. Maurer","year":"1996","unstructured":"Maurer, U.M., Wolf, S.: Diffie-hellman oracles. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 268\u2013282. Springer, Heidelberg (1996)"},{"issue":"5","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539796302749","volume":"28","author":"U.M. Maurer","year":"1999","unstructured":"Maurer, U.M., Wolf, S.: The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms. SIAM J. Comput.\u00a028(5), 1689\u20131721 (1999)","journal-title":"SIAM J. Comput."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1008302122286","volume":"19","author":"U.M. Maurer","year":"2000","unstructured":"Maurer, U.M., Wolf, S.: The Diffie-Hellman protocol. Designs Codes and Cryptography\u00a019, 147\u2013171 (2000)","journal-title":"Designs Codes and Cryptography"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"McCurley, K.: The discrete logarithm problem. In: Cryptology and Computational Number Theory. Proceedings of Symposia in Applied Mathematics, vol.\u00a042, pp. 49\u201374 (1990)","DOI":"10.1090\/psapm\/042\/1095551"},{"issue":"2004","key":"19_CR13","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1112\/S1461157000001042","volume":"7","author":"A. Muzereau","year":"2004","unstructured":"Muzereau, A., Smart, N.P., Vrecauteren, F.: The equivalence between the DHP and DLP for elliptic curves used in practical applications. LMS J. Comput. Math.\u00a07(2004), 50\u201372 (2004)","journal-title":"LMS J. Comput. Math."},{"issue":"6","key":"19_CR14","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1109\/TIT.1986.1057236","volume":"32","author":"R. Peralta","year":"1986","unstructured":"Peralta, R.: A simple and fast probabilistic algorithm for computing square roots modulo a prime number. IEEE Trans. on Information Theory\u00a032(6), 846\u2013847 (1986)","journal-title":"IEEE Trans. on Information Theory"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-44448-3_31","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"B. Pfitzmann","year":"2000","unstructured":"Pfitzmann, B., Sadeghi, A.-R.: Anonymous fingerprinting with direct non-repudiation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 401\u2013414. Springer, Heidelberg (2000)"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S.C. Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE-Transactions on Information Theory\u00a024, 106\u2013110 (1978)","journal-title":"IEEE-Transactions on Information Theory"},{"key":"19_CR17","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.-R. Sadeghi","year":"2001","unstructured":"Sadeghi, A.-R., Steiner, M.: Assumptions related to discrete logarithms: Why subtleties make a real difference. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 244\u2013261. Springer, Heidelberg (2001)"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology\u00a04, 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11958239_5","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"F. Zhang","year":"2006","unstructured":"Zhang, F., Chen, X., Susilo, W., Mu, Y.: A new signature scheme without random oracles from bilinear pairings. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 67\u201380. Springer, Heidelberg (2006)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, F., Chen, X., Wei, B.: Efficient designated confirmer signature from bilinear pairings. In: ASIACCS 2008, pp. 363\u2013368 (2008)","DOI":"10.1145\/1368310.1368363"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20901-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T08:07:15Z","timestamp":1560240435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20901-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642209000","9783642209017"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20901-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}