{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:04Z","timestamp":1725663844921},"publisher-location":"Berlin, Heidelberg","reference-count":25,"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_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:50:21Z","timestamp":1330242621000},"page":"368-381","source":"Crossref","is-referenced-by-count":1,"title":["An extension of zero-knowledge proofs and its applications"],"prefix":"10.1007","author":[{"given":"Tatsuaki","family":"Okamoto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G.Brassard, D.Chaum and C.Cr\u00e9peau, \u201cMinimum Disclosure Proofs of Knowledge,\u201d Journal of Computer and System Sciences, Vol.37, pp.156\u2013189 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"G.Brassard, C.Cr\u00e9peau and M. Yung, \u201cEverything in NP Can Be Argued in Perfect Zero-Knowledge in a Bounded Number of Round,\u201d Proc. Eurocrypt'89 (1989)","DOI":"10.1007\/BFb0035756"},{"key":"32_CR3","unstructured":"M.Blum, \u201cHow to Prove a Theorem So No One Else Can Claim It,\u201d ISO\/ TC97\/ SC20\/ WG2 N73 (1986)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"M.Bellare, S.Micali and R.Ostrovsky, \u201cPerfect Zero-Knowledge in Constant Rounds,\u201d Proc. STOC (1990)","DOI":"10.1145\/100216.100283"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"M.Bellare, S.Micali and R.Ostrovsky, \u201cThe (True) Complexity of Statistical Zero-Knowledge,\u201d Proc. STOC (1990)","DOI":"10.1145\/100216.100285"},{"key":"32_CR6","unstructured":"U.Feige and A.Shamir, \u201cZero-Knowledge Proofs of Knowledge in Two Rounds,\u201d Proc. Crypto'89 (1989)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"U.Feige and A.Shamir, \u201cWitness Indistinguishable and Witness Hiding Protocols,\u201d Proc. STOC (1990)","DOI":"10.1145\/100216.100272"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"U.Feige, A.Fiat and A.Shamir, \u201cZero Knowledge Proofs of Identity,\u201d Proc. STOC, pp.210\u2013217 (1987)","DOI":"10.1145\/28395.28419"},{"key":"32_CR9","unstructured":"A.Fiat and A.Shamir, \u201cHow to Prove Yourself,\u201d The Proc. of Crypto'86, pp.186\u2013199 (1986)"},{"key":"32_CR10","unstructured":"A.Fujioka, T.Okamoto and S.Miyaguchi: \u201cESIGN: An Efficient Digital Signature Implementation for Smart Cards\u201d, Proc. of Eurocrypt'91 (1991)"},{"issue":"No.4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1137\/0218049","volume":"18","author":"Z. Galil","year":"1989","unstructured":"Z. Galil, S. Haber, and C. Yung, \u201cMinimum-Knowledge Interactive Proofs for Decision Problems\u201d, SIAM Journal on Computing, Vol.18, No.4, pp.711\u2013739 (1989).","journal-title":"SIAM Journal on Computing"},{"key":"32_CR12","unstructured":"O.Goldreich and H.Krawczyk \u201cOn the Composition of Zero-Knowledge Proof Systems,\u201d Technical Report #570 of Technion (1989)"},{"issue":"2","key":"32_CR13","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S.Goldwasser, S.Micali, \u201cProbabilistic Encryption,\u201d JCSS, 28, 2, pp.270\u2013299 (1984).","journal-title":"JCSS"},{"issue":"1","key":"32_CR14","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, \u201cThe Knowledge Complexity of Interactive Proofs,\u201d SIAM J. Comput., 18, 1, pp.186\u2013208 (1989). Previous version, Proc. STOC, pp.291\u2013304 (1985)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"32_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S.Goldwasser, S.Micali and R.Rivest, \u201cA Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks,\u201d SIAM J. Compt., 17, 2, pp.281\u2013308 (1988)","journal-title":"SIAM J. Compt."},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"O.Goldreich, S.Micali, and A.Wigderson, \u201cProofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design,\u201d Proc. FOCS, pp.174\u2013187 (1986)","DOI":"10.1109\/SFCS.1986.47"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"O.Goldreich and E.Petrank, \u201cQuantifying Knowledge Complexity,\u201d Proc. FOCS (1991)","DOI":"10.1109\/SFCS.1991.185349"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"J.H\u00e5stad, \u201cPseudo-Random Generators under Uniform Assumptions,\u201d Proc. STOC (1990)","DOI":"10.1145\/100216.100270"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin and M. Luby, \u201cPseudo-Random Number Generation from One-Way Functions,\u201d Proc. STOC, pp.12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"key":"32_CR20","unstructured":"S.Micali and P.Rogaway, \u201cSecure Computation,\u201d Proc. Crypto'91, (1991)"},{"key":"32_CR21","unstructured":"M.Naor, \u201cBit Commitment Using Pseudo-Randomness,\u201d Proc. Crypto'89 (1990)."},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"M.Naor and M.Yung, \u201cUniversal One-Way Hash Functions and Their Cryptographic Applications,\u201d Proc. STOC, pp.33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Y.Oren, \u201cOn the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs,\u201d Proc. FOCS, pp.462\u2013471 (1987)","DOI":"10.1109\/SFCS.1987.43"},{"key":"32_CR24","unstructured":"T.Okamoto, and A.Shiraishi \u201cA Digital Signature Scheme Based on the Rabin Cryptosystem,\u201d (in Japanese) Spring Conference of IEICE Japan, 1439 (1985)"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"M.Tompa and H.Woll, \u201cRandom Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information,\u201d Proc. FOCS, pp472\u2013482 (1987)","DOI":"10.1109\/SFCS.1987.49"}],"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_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:11:37Z","timestamp":1605629497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57332-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573326","9783540480662"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-57332-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}