{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T19:11:41Z","timestamp":1675105901866},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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. Cryptology"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1007\/bf00191319","type":"journal-article","created":{"date-parts":[[2004,8,28]],"date-time":"2004-08-28T00:49:27Z","timestamp":1093654167000},"page":"29-39","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":55,"title":["An interactive identification scheme based on discrete logarithms and factoring"],"prefix":"10.1007","volume":"5","author":[{"given":"Ernest F.","family":"Brickell","sequence":"first","affiliation":[]},{"given":"Kevin S.","family":"McCurley","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00191319_CR1","series-title":"Lecture Notes in Computer Science","first-page":"77","volume-title":"Advances in Cryptology\u2014Proceedings of Eurocrypt '88","author":"T. Beth","year":"1989","unstructured":"T. Beth, Efficient zero-knowledge identification scheme for smart cards, Advances in Cryptology\u2014Proceedings of Eurocrypt '88, Lecture Notes in Computer Science, vol. 330, Springer-Verlag, Berlin, 1989, pp. 77\u201384."},{"key":"BF00191319_CR2","unstructured":"E. F. Brickell and K. S. McCurley, An interactive identification scheme based on discrete logarithms and factoring, Advances in Cryptology\u2014Proceedings of Eurocrypt '90 (to appear)."},{"key":"BF00191319_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-47721-7_14","volume-title":"Advances in Cryptology\u2014Proceedings of Eurocrypt '86","author":"D. Chaum","year":"1987","unstructured":"D. Chaum, J.-H. Evertse, J. van de Graaf, and R. Peralta, Demonstrating possession of a discrete logarithm without revealing it, Advances in Cryptology\u2014Proceedings of Eurocrypt '86, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, Berlin, 1987, pp. 200\u2013212."},{"key":"BF00191319_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\u2014Proceedings of 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, Advances in Cryptology\u2014Proceedings of Eurocrypt '87, Lecture Notes in Computer Science, vol. 304, Springer-Verlag, Berlin, 1988, pp. 127\u2013141."},{"key":"BF00191319_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-48184-2_3","volume-title":"Advances in Cryptology Proceedings of Crypto '87","author":"Y. Desmedt","year":"1988","unstructured":"Y. Desmedt, C. Goutier, and S. Bengio, Special uses and abuses of the Fiat-Shamir passport protocol, Advances in Cryptology Proceedings of Crypto '87, Lecture Notes in Computer Science, vol. 293, Springer-Verlag, Berlin, 1988, pp. 21\u201339."},{"key":"BF00191319_CR6","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 identify, Journal of Cryptology\n1 (1988), 77\u201394.","journal-title":"Journal of Cryptology"},{"key":"BF00191319_CR7","first-page":"416","volume-title":"Proceedings of the 22nd ACM Symposium on Theory of Computing","author":"U. Feige","year":"1990","unstructured":"U. Feige and A. Shamir, Witness indistinguishable and witness hiding protocols, Proceedings of the 22nd ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1990, pp. 416\u2013424."},{"issue":"No. 1","key":"BF00191319_CR8","doi-asserted-by":"crossref","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 Journal on Computing\n18, No. 1 (1989), 186\u2013208.","journal-title":"SIAM Journal on Computing"},{"key":"BF00191319_CR9","volume-title":"The Art of Computer Programming, Vol. 2: Seminumerical Algorithms","author":"D. E. Knuth","year":"1981","unstructured":"D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1981.","edition":"2nd ed."},{"key":"BF00191319_CR10","unstructured":"B. LaMacchia and A. Odlyzko, Computation of discrete logarithms in prime finite fields, Advances in Cryptology\u2014Proceedings of Crypto '90, Lecture Notes in Computer Science (to appear)."},{"key":"BF00191319_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-46885-4_35","volume-title":"Advances in Cryptology\u2014Proceedings of Eurocrypt '89","author":"A. K. Lenstra","year":"1990","unstructured":"A. K. Lenstra and M. S. Manasse, Factoring by electronic mail, Advances in Cryptology\u2014Proceedings of Eurocrypt '89, Lecture Notes in Computer Science, vol. 434, Springer-Verlag, Berlin, 1990, pp. 355\u2013371."},{"key":"BF00191319_CR12","first-page":"564","volume-title":"Proceedings of the 22nd ACM Symposium on Theory of Computing","author":"A. K. Lenstra","year":"1990","unstructured":"A. K. Lenstra, H. W. Lenstra, Jr., M. S. Manasse, and J. M. Pollard, The number field sieve, Proceedings of the 22nd ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1990, pp. 564\u2013572."},{"key":"BF00191319_CR13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02351718","volume":"1","author":"K. S. McCurley","year":"1988","unstructured":"K. S. McCurley, A key distribution system equivalent to factoring, Journal of Cryptology\n1 (1988), 95\u2013105.","journal-title":"Journal of Cryptology"},{"key":"BF00191319_CR14","first-page":"49","volume-title":"Cryptology and Computational Number Theory, Proceedings of Symposia in Applied Mathematics, vol. 42","author":"K. S. McCurley","year":"1990","unstructured":"K. S. McCurley, The discrete logarithm problem, Cryptology and Computational Number Theory, Proceedings of Symposia in Applied Mathematics, vol. 42, American Mathematical Society, Providence, 1990, pp. 49\u201374."},{"key":"BF00191319_CR15","first-page":"918","volume":"32","author":"J. M. Pollard","year":"1978","unstructured":"J. M. Pollard, Monte Carlo methods for index computation mod p, Mathematics of Computation 32 (1978), 918\u2013924.","journal-title":"p, Mathematics of Computation"},{"key":"BF00191319_CR16","first-page":"27","volume-title":"Cryptology and Computational Number Theory, Proceedings of Symposia in Applied Mathematics, vol. 42","author":"C. Pomerance","year":"1990","unstructured":"C. Pomerance, Factoring, Cryptology and Computational Number Theory, Proceedings of Symposia in Applied Mathematics, vol. 42, American Mathematical Society, Providence, RI, 1990, pp. 27\u201348."},{"key":"BF00191319_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology\u2014Proceedings of Crypto '89","author":"C. P. Schnorr","year":"1990","unstructured":"C. P. Schnorr, Efficient identification and signatures for smart cards, Advances in Cryptology\u2014Proceedings of Crypto '89, Lecture Notes in Computer Science, vol. 435, Springer-Verlag, Berlin, 1990, pp. 239\u2013252."},{"key":"BF00191319_CR18","first-page":"472","volume-title":"Proceedings of the 28th IEEE Symposium on Foundations of Computer Science","author":"M. Tompa","year":"1987","unstructured":"M. Tompa and H. Woll, Random self-reducibility and zero knowledge interactive proofs of possession of information, Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, IEEE, Washington, D.C., 1987, pp. 472\u2013482."},{"key":"BF00191319_CR19","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1090\/S0025-5718-1979-0528061-7","volume":"33","author":"S. S. Wagstaff Jr.","year":"1979","unstructured":"S. S. Wagstaff, Jr., Greatest of the least primes in arithmetic progressions having a given modulus, Mathematics of Computation\n33 (1979), 1073\u20131080.","journal-title":"Mathematics of Computation"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00191319.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00191319\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00191319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00191319.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:23:28Z","timestamp":1586334208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00191319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["BF00191319"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf00191319","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":["Applied Mathematics","Computer Science Applications","Software"],"published":{"date-parts":[[1992,1]]},"assertion":[{"value":"20 December 1990","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 1991","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}