{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:18Z","timestamp":1742596818379,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573326"},{"type":"electronic","value":"9783540480662"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57332-1_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:50:29Z","timestamp":1330260629000},"page":"382-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Any language in IP has a divertible ZKIP"],"prefix":"10.1007","author":[{"given":"Toshiya","family":"Itoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"Shizuya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Aiello, W. and H\u00e5stad, J., \u201cStatistical Zero-Knowledge Languages Can Be recognized in Two Rounds,\u201d IEEE Annual Symposium on Foundations of Computer Science, pp.439\u2013448 (October 1987).","DOI":"10.1109\/SFCS.1987.47"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., \u201cTrading Group Theory for Randomness,\u201d ACM Annual Symposium on Theory of Computing, pp.421\u2013429 (May 1985).","DOI":"10.1145\/22145.22192"},{"issue":"No.2","key":"33_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., and Cr\u00e9peau, C., \u201cMinimum Disclosure Proofs of Knowledge,\u201d Journal of Computer and System Sciences, Vol.37, No.2, pp.156\u2013189 (October 1988).","journal-title":"Journal of Computer and System Sciences"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science 474","first-page":"1","volume-title":"Advances in Cryptology \u2014 Eurocrypt'90","author":"M. D. V. V. Burmester","year":"1991","unstructured":"Burmester, M. D. V. and Desmedt, Y., \u201cAll Languages in $$\\mathcal{N}\\mathcal{P}$$ Have Divertible Zero-Knowledge Proofs and Arguments Under the Cryptographic Assumptions,\u201d Advances in Cryptology \u2014 Eurocrypt'90, Lecture Notes in Computer Science 474, Springer-Verlag, Berlin, pp.1\u201310 (1991)."},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science 403","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume-title":"Advances in Cryptology \u2014 Crypto'88","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Goldwasser, S., H\u00e5stad, J., Kilian, J., Micali, S., and Rogaway, P., \u201cEverything Provable is Provable in Zero-Knowledge,\u201d Advances in Cryptology \u2014 Crypto'88, Lecture Notes in Computer Science 403, Springer-Verlag, Berlin, pp.37\u201356 (1990)."},{"issue":"No.2","key":"33_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"Boppana, R., H\u00e5stad, J., and Zachos, S., \u201cDoes co- $$\\mathcal{N}\\mathcal{P}$$ Have Short Proofs,\u201d Information Processing Letters, Vol.25, No.2, pp.127\u2013132 (May 1987).","journal-title":"Information Processing Letters"},{"key":"33_CR7","unstructured":"Blum, M., \u201cHow to Prove a Theorem So No One Else Can Claim It,\u201d International Congress of Mathematicians, pp.1444\u20131451 (August 1986)."},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science 435","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/0-387-34805-0_2","volume-title":"Advances in Cryptology \u2014 Crypto'89","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y., \u201cMaking Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context,\u201d Advances in Cryptology \u2014 Crypto'89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, pp.6\u201316 (1990)."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Fortnow, L., \u201cThe Complexity of Perfect Zero-Knowledge,\u201d ACM Annual Symposium on Theory of Computing, pp.204\u2013209 (May 1987).","DOI":"10.1145\/28395.28418"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U., Fiat, A., and Shamir, A., \u201cZero-Knowledge Proofs of Identity,\u201d ACM Annual Symposium on Theory of Computing, pp.210\u2013217 (May 1988).","DOI":"10.1145\/28395.28419"},{"issue":"No.1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., and Rackoff, C., \u201cThe Knowledge Complexity of Interactive Proof Systems,\u201d SIAM J. Comput., Vol.18, No.1, pp.186\u2013208 (February 1989).","journal-title":"SIAM J. Comput."},{"key":"33_CR12","volume-title":"Technical Report #544","author":"O. Goldreich","year":"1989","unstructured":"Goldreich, O., Micali, S., and Wigderson, A., \u201cProofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proofs,\u201d Technical Report #544, Technion \u2014 Israel Institute of Technology, Department of Computer Science, Haifa, Israel (March 1989)."},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Goldwasser, S. and Sipser, M., \u201cPrivate Coins versus Public Coins in Interactive Proof Systems,\u201d ACM Annual Symposium on Theory of Computing, pp.59\u201368 (May 1986).","DOI":"10.1145\/12130.12137"},{"key":"33_CR14","unstructured":"Kilian, J., \u201cAchieving Zero-Knowledge Robustly,\u201d Proc. of Crypto'90 (August 1990)."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Lund, C., Fortnow, L., Karloff, H., and Nisan, N., \u201cAlgebraic Methods for Interactive Proof systems\u201d IEEE Annual Symposium on Foundations of Computer Science, pp.2\u201310 (October 1990).","DOI":"10.1109\/FSCS.1990.89518"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science 434","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-46885-4_16","volume-title":"Advances in Cryptology \u2014 Eurocrypt'89","author":"T. Okamoto","year":"1990","unstructured":"Okamoto, T. and Ohta, K., \u201cDivertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducibility,\u201d Advances in Cryptology \u2014 Eurocrypt'89, Lecture Notes in Computer Science 434, Springer-Verlag, Berlin, pp.134\u2013149 (1990)."},{"key":"33_CR17","unstructured":"Shamir, A., \u201c $$\\mathcal{P}\\mathcal{S}\\mathcal{P}\\mathcal{A}\\mathcal{C}\\mathcal{E}$$ ,\u201d IEEE Annual Symposium on Foundations of Computer Science, pp.11\u201315 (October 1990)."},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science 209","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-39757-4_25","volume-title":"Advances in Cryptology \u2014 Eurocrypt'84","author":"G. J. Simmons","year":"1985","unstructured":"Simmons, G. J., \u201cThe Subliminal Channel and Digital Signatures,\u201d Advances in Cryptology \u2014 Eurocrypt'84, Lecture Notes in Computer Science 209, Springer-Verlag, Berlin, pp.364\u2013378 (1985)."},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Tompa, M. and Woll, H., \u201cRandom Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information,\u201d IEEE Annual Symposium on Foundations of Computer Science, pp.472\u2013482 (October 1987).","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT '91"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57332-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:08:11Z","timestamp":1742594891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57332-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573326","9783540480662"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-57332-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"28 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}