{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:13:37Z","timestamp":1769721217180,"version":"3.49.0"},"publisher-location":"New York, NY","reference-count":12,"publisher":"Springer New York","isbn-type":[{"value":"9780387973173","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_44","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T02:05:53Z","timestamp":1194573953000},"page":"498-506","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Identification Schemes Using Two Prover Interactive Proofs"],"prefix":"10.1007","author":[{"given":"Michael","family":"Ben-Or","sequence":"first","affiliation":[]},{"given":"Shafi","family":"Goldwasser","sequence":"additional","affiliation":[]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","unstructured":"Blum, \u201cHow to Prove a Theorem So No One Else Can Claim It\u201d, Zero Knowledge Proofs, ICM 1986."},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, Goldwasser, Kilian, and Wigderson, \u201cMulti-Prover Interactive Proofs: How to Remove Intractability Assumptions,\u201d Proceedings of STOC 1988.","DOI":"10.1145\/62212.62223"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Brassard, Gilles, David Chaum, and Claude Cr\u2019epeau, \u201cMinimum Disclosure Proofs of Knowledge,\u201d JCSS, Oct. 1988.","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"44_CR4","unstructured":"Fiat, and Shamir, \u201cHow to Prove Yourself: Practical Solutions to Identification and Signature Problems\u201d, CRYPTO 86."},{"key":"44_CR5","unstructured":"Guillou, and Quisquater, \u201cA Paradoxical Identity Based Signature Scheme Resulting from Zero Knowledge\u201d, CRYPTO 88."},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Goldwasser, Micali, and Rackoff, \u201cThe Knowledge Complexity of Interactive Proofs\u201d, SIAM J. of Comp., Feb. 1989.","DOI":"10.1137\/0218012"},{"key":"44_CR7","unstructured":"Goldreich, Micali, and Wigderson, \u201cProofs that Yield Nothing But the Validity of the Assertion\u201d, Proceedings of FOCS 1986."},{"key":"44_CR8","unstructured":"Impagliazzo, Russell and Moti Yung, \u201cDirect Minimum Knowledge Computations,\u201d CRYPTO 87."},{"key":"44_CR9","unstructured":"Kilian, Micali, and Ostrovsky, \u201cEfficient Zero Knowledge Proofs with Bounded Interaction,\u201d Proceedings of FOCS 89."},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Lagarias, and Odlyzko, \u201cSolving Low Density Subset Sum Problems\u201d, Proceedings of FOCS 1983.","DOI":"10.1109\/SFCS.1983.70"},{"key":"44_CR11","unstructured":"Micali and Shamir, \u201cAn Improvement of the Fiat-Shamir Identification and Signature Scheme\u201d, CRYPTO 88."},{"key":"44_CR12","unstructured":"A. Shamir, \u201cA Zero-Knowledge Proof for Knapsacks\u201d, presented at a workshop on Probabilistic Algorithms, Marseille (March 1986)."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34805-0_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:28:22Z","timestamp":1619501302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_44","relation":{},"subject":[]}}