{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:08Z","timestamp":1725663848915},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573326"},{"type":"electronic","value":"9783540480662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57332-1_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:50:39Z","timestamp":1330260639000},"page":"360-367","source":"Crossref","is-referenced-by-count":1,"title":["An efficient zero-knowledge scheme for the discrete logarithm based on smooth numbers"],"prefix":"10.1007","author":[{"given":"Yvo","family":"Desmedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Burmester","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"31_CR1","first-page":"263","volume-title":"Perspective in Computing series, Vol. 15","author":"L. M. Adleman","year":"1986","unstructured":"L. M. Adleman and K. S. McCurley. Open problems in number theoretic complexity. In D. Johnson, T. Nishizeki, A. Nozaki, and H. Wilf, editors, Discrete Algorithms and Complexity, Proceedings of the Japan-US Joint Seminar (Perspective in Computing series, Vol. 15), pp. 263\u2013286. Academic Press Inc., Orlando, Florida, June 4\u20136, Kyoto, Japan 1986."},{"key":"31_CR2","unstructured":"G. Brassard and P. Bratley. Algorithmics \u2014 Theory & Practice. Prentice Hall, 1988."},{"issue":"No.1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1093\/comjnl\/35.1.21","volume":"35","author":"M. Burmester","year":"1992","unstructured":"M. Burmester, Y. Desmedt, and T. Beth. Efficient zero-knowledge identification schemes for smart cards. Accepted for publication in special issue on Safety and Security, The Computer Journal, February 1992, Vol. 35, No. 1, pp. 21\u201329.","journal-title":"The Computer Journal"},{"key":"31_CR4","first-page":"77","volume-title":"Lecture Notes in Computer Science 330","author":"T. Beth","year":"1988","unstructured":"T. Beth. A Fiat-Shamir-like authentication protocol for the El-Gamalscheme. In C. G. G\u00fcnther, editor, Advances in Cryptology, Proc. of Eurocrypt '88 (Lecture Notes in Computer Science 330), pp. 77\u201384. Springer-Verlag, May 1988. Davos, Switzerland."},{"key":"31_CR5","first-page":"563","volume-title":"Randomness in interactive proofs","author":"M. Bellare","year":"1990","unstructured":"M. Bellare, O. Goldreich, and S. Goldwasser. Randomness in interactive proofs. In 31th Annual Symp. on Foundations of Computer Science (FOCS), pp. 563\u2013572. IEEE Computer Society Press, October 22\u2013October 24, 1990. St. Louis, Missouri."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Micali, and R. Ostrovsky. Perfect zero-knowledge in constant rounds. In Proceedings of the twenty second annual ACM Symp. Theory of Computing, STOC, pp. 482\u2013493, May 14\u201316, 1990.","DOI":"10.1145\/100216.100283"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science 304","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-39118-5_13","volume-title":"Advances in Cryptology \u2014 Eurocrypt '87","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, J.-H. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In D. Chaum and W. L. Price, editors, Advances in Cryptology \u2014 Eurocrypt '87 (Lecture Notes in Computer Science 304), pp. 127\u2013141. Springer-Verlag, Berlin, 1988. Amsterdam, The Netherlands, April 13\u201315, 1987."},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, A. Odlyzko, and R. Schroeppel. Discrete logarithms in GF(p). Algorithmica, pp. 1\u201315, 1986.","DOI":"10.1007\/BF01840433"},{"issue":"6","key":"31_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, IT-22(6), pp. 644\u2013654, November 1976.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory, 31, pp. 469\u2013472, 1985.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"31_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, and A. Shamir. Zero knowledge proofs of identity. Journal of Cryptology, 1(2), pp. 77\u201394, 1988.","journal-title":"Journal of Cryptology"},{"key":"31_CR12","first-page":"186","volume-title":"Lecture Notes in Computer Science 263","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. Odlyzko, editor, Advances in Cryptology, Proc. of Crypto '86 (Lecture Notes in Computer Science 263), pp. 186\u2013194. Springer-Verlag, 1987. Santa Barbara, California, U. S. A., August 11\u201315."},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. Siam J. Comput., 18(1), pp. 186\u2013208, February 1989.","journal-title":"Siam J. Comput."},{"key":"31_CR14","first-page":"123","volume-title":"Lecture Notes in Computer Science 330","author":"L. C. Guillou","year":"1988","unstructured":"L. C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In C. G. G\u00fcnther, editor, Advances in Cryptology, Proc. of Eurocrypt '88 (Lecture Notes in Computer Science 330), pp. 123\u2013128. Springer-Verlag, May 1988. Davos, Switzerland."},{"key":"31_CR15","volume-title":"Basic Algebra I","author":"N. Jacobson","year":"1985","unstructured":"N. Jacobson. Basic Algebra I. W. H. Freeman and Company, New York, 1985."},{"key":"31_CR16","first-page":"474","volume-title":"Minimum resource zero-knowledge proofs","author":"J. Kilian","year":"1989","unstructured":"J. Kilian, S. Micali, and R. Ostrovsky. Minimum resource zero-knowledge proofs. In 30th Annual Symp. on Foundations of Computer Science (FOCS), pp. 474\u2013479. IEEE Computer Society Press, October 30\u2013November 1, 1989. Research Triangle Park, NC, U.S.A."},{"key":"31_CR17","volume-title":"Cryptography: A Primer","author":"A. Konheim","year":"1981","unstructured":"A. Konheim. Cryptography: A Primer. John Wiley, Toronto, 1981."},{"key":"31_CR18","unstructured":"J. L. Massey and J. K. Omura. A new multiplicative algorithm over finite fields and its applicability in public-key cryptography. Presented at Eurocrypt 83, Udine, Italy."},{"key":"31_CR19","first-page":"224","volume-title":"Lecture Notes in Computer Science 209","author":"A. M. Odlyzko","year":"1984","unstructured":"A. M. Odlyzko. Discrete logs in a finite field and their cryptographic significance. In N. Cot T. Beth and I. Ingemarsson, editors, Advances in Cryptology, Proc. of Eurocrypt 84 (Lecture Notes in Computer Science 209), pp. 224\u2013314. Springer-Verlag, 1984. Paris, France April 1984."},{"issue":"1","key":"31_CR20","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S. C. Pohlig","year":"1978","unstructured":"S. C. Pohlig and M. E. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inform. Theory, IT-24(1), pp. 106\u2013110, January 1978.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"31_CR21","first-page":"239","volume-title":"Lecture Notes in Computer Science 435","author":"C. P. Schnorr","year":"1990","unstructured":"C. P. Schnorr. Efficient identification and signatures for smart cards. In G. Brassard, editor, Advances in Cryptology \u2014 Crypto '89, Proceedings (Lecture Notes in Computer Science 435), pp. 239\u2013252. Springer-Verlag, 1990. Santa Barbara, California, U.S.A., August 20\u201324."},{"key":"31_CR22","first-page":"11","volume-title":"IP=PSPACE","author":"A. Shamir","year":"1990","unstructured":"A. Shamir. IP=PSPACE. In 31th Annual Symp. on Foundations of Computer Science (FOCS), pp. 11\u201315. IEEE Computer Society Press, October 22\u2013October 24, 1990. St. Louis, Missouri."},{"issue":"1","key":"31_CR23","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1978","unstructured":"R. Solovay and V. Strassen. A fast Monte-Carlo test for primality. SIAM Journal on Computing, 6(1), pp. 84\u201385, erratum (1978), ibid, 7,118, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"31_CR24","first-page":"472","volume-title":"Random self-reducibility and zero-knowledge interactive proofs of possession of information","author":"M. Tompa","year":"1987","unstructured":"M. Tompa and H. Woll. Random self-reducibility and zero-knowledge interactive proofs of possession of information. In The Computer Society of IEEE, 28th Annual Symp. on Foundations of Computer Science (FOCS), pp. 472\u2013482. IEEE Computer Society Press, 1987. Los Angeles, California, U.S.A., October 12\u201314, 1987."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57332-1_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:48Z","timestamp":1619571828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57332-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573326","9783540480662"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-57332-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}