{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:37:11Z","timestamp":1725496631746},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-38424-3_25","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T08:05:56Z","timestamp":1196669156000},"page":"339-352","source":"Crossref","is-referenced-by-count":1,"title":["Multi-Language Zero Knowledge Interactive Proof Systems"],"prefix":"10.1007","author":[{"given":"Kaoru","family":"Kurosawa","sequence":"first","affiliation":[]},{"given":"Shigeo","family":"Tsujii","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Blum: \u201cCoin flipping by telephone\u201d, IEEE, COMPCON, pp.133\u2013137 (1982)"},{"key":"25_CR2","unstructured":"Blum: \u201cHow to prove a theorem so no one else can claim it Proc. International Congress of Mathematics, pp.1444\u20131451 (1986)"},{"issue":"2","key":"25_CR3","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"Gilles Brassard","year":"1988","unstructured":"Brassard, Chaum and Crepeau: \u201cMinimum disclosure proofs of knowledge\u201d, JCSS, pp.156\u2013166 (1988)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"Goldwasser","year":"1989","unstructured":"Goldwasser, Micali and Rackoff: \u201cThe knowledge complexity of interactive proof systems\u201d, SIAM J. on Comp. vol.18, No.1, pp.186\u2013208 (1989)","journal-title":"SIAM J. on Comp."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, Micali and Wigderson: \u201cHow to prove all NP-statements in zero knowledge, and a methodology of cryptographic protocol design\u201d, Crypt\u201986, pp.171\u2013185 (1986)","DOI":"10.1007\/3-540-47721-7_11"},{"issue":"15","key":"25_CR6","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1049\/el:19870573","volume":"23","author":"Kurosawa","year":"1987","unstructured":"Kurosawa, Itoh and Takeuchi: \u201cPublic key cryptosystem using a reciprocal number with the same intractability as factoring a large number\u201d, Electronics Letters, vol.23, No.15, pp.809\u2013810 (1987), CRYPTOLOGIA, vol.XII, No.4, pp.225\u2013233 (1988)","journal-title":"Electronics Letters"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"Rabin","year":"1980","unstructured":"Rabin: \u201cProbabilistic algorithms in finite fields\u201d, SIAM J. Comput. 9, pp.273\u2013280 (1980)","journal-title":"SIAM J. Comput."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Tompa and Woll: \u201cRandom self reducibility and zero knowledge interactive proofs of possession of information\u201d, FOCS, pp.472\u2013482 (1987)","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology-CRYPT0\u2019 90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38424-3_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:20:11Z","timestamp":1619558411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_25","relation":{},"subject":[]}}