{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:40Z","timestamp":1772283640346,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540338512","type":"print"},{"value":"9783540338529","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11745853_3","type":"book-chapter","created":{"date-parts":[[2006,4,13]],"date-time":"2006-04-13T05:18:58Z","timestamp":1144905538000},"page":"27-43","source":"Crossref","is-referenced-by-count":11,"title":["Cryptanalysis of an Efficient Proof of Knowledge of Discrete Logarithm"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Kunz-Jacques","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwena\u00eblle","family":"Martinet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Poupard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Stern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-30580-4_11","volume-title":"Public Key Cryptography - PKC 2005","author":"E. Bangerter","year":"2005","unstructured":"Bangerter, E., Camenisch, J., Maurer, U.: Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 154\u2013171. Springer, Heidelberg (2005)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-45961-8_7","volume-title":"Advances in Cryptology - EUROCRYPT 1988","author":"T. Beth","year":"1988","unstructured":"Beth, T.: Efficient Zero-Knowledge Identification Scheme for Smart Cards. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 77\u201386. Springer, Heidelberg (1988)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology - EUROCRYPT 1999","author":"J. Camenisch","year":"1999","unstructured":"Camenisch, J., Michels, M.: Proving in Zero-Knowledge That a Number Is the Product of Two Safe Primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 107\u2013122. Springer, Heidelberg (1999)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-39118-5_13","volume-title":"Advances in Cryptology - EUROCRYPT 1987","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Evertse, J.-H., van de Graaf, J.: An Improved Protocol for Demonstrating Possession of Discrete Logarithms and some Generalizations. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 127\u2013141. Springer, Heidelberg (1988)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47721-7_14","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"D. Chaum","year":"1987","unstructured":"Chaum, D., Evertse, J.-H., van de Graaf, J., Peralta, R.: Demonstrating Possession of a Discrete Logarithm without Revealing it. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 200\u2013212. Springer, Heidelberg (1987)"},{"key":"3_CR6","unstructured":"NESSIE consortium. Portfolio of recommanded cryptographic primitives (2003), Available from \n                    \n                      http:\/\/www.cryptonessie.org"},{"key":"3_CR7","unstructured":"Cramer, R.: Modular Design of Secure yet Practical Cryptographic Protocol, PhD thesis, University of Amsterdam (1997)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/BFb0055745","volume-title":"Advances in Cryptology - CRYPTO 1998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Damg\u00e5rd, I.: Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge Be for Free. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 424\u2013441. Springer, Heidelberg (1998)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"issue":"6","key":"3_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","first-page":"490","volume-title":"Advances in Cryptology - EUROCRYPT 1991","author":"M. Girault","year":"1992","unstructured":"Girault, M.: Self-Certified Public Keys. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 490\u2013497. Springer, Heidelberg (1992)"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM journal of computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM journal of computing"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT 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\u00a0IT 24(1), 106\u2013110 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"143","key":"3_CR15","first-page":"918","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo Methods for Index Computation (mod p). Mathematics of Computation\u00a032(143), 918\u2013924 (1978)","journal-title":"Mathematics of Computation"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/BFb0054143","volume-title":"Advances in Cryptology - EUROCRYPT 1998","author":"G. Poupard","year":"1998","unstructured":"Poupard, G., Stern, J.: Security Analysis of a Practical \u201don the fly\u201d Authentication and Signature Generation. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 422\u2013436. Springer, Heidelberg (1998)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","first-page":"235","volume-title":"Advances in Cryptology - CRYPTO 1989","author":"C.-P. Schnorr","year":"1990","unstructured":"Schnorr, C.-P.: Efficient Identification and Signatures for Smart Cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 235\u2013251. Springer, Heidelberg (1990)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-68339-9_29","volume-title":"Advances in Cryptology - EUROCRYPT 1996","author":"P.C. Oorschot van","year":"1996","unstructured":"van Oorschot, P.C., Wiener, M.J.: On Diffie-Hellman Key Agreement with Short Exponents. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 332\u2013343. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11745853_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:45:14Z","timestamp":1552347914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11745853_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338512","9783540338529"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11745853_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}