{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:41Z","timestamp":1766281001764},"publisher-location":"Berlin, Heidelberg","reference-count":46,"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_33","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T08:05:56Z","timestamp":1196669156000},"page":"456-475","source":"Crossref","is-referenced-by-count":14,"title":["How to Utilize the Randomness of Zero-Knowledge Proofs"],"prefix":"10.1007","author":[{"given":"Tatsuaki","family":"Okamoto","sequence":"first","affiliation":[]},{"given":"Kazuo","family":"Ohta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"T. Beth, \u201cEfficient Zero-Knowledge Identification Scheme For Smart Cards,\u201d Eurocrypt\u201988 (1988)","DOI":"10.1007\/3-540-45961-8_7"},{"key":"33_CR2","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":"33_CR3","doi-asserted-by":"crossref","unstructured":"R. Blom, \u201cNon-Public Key Distribution,\u201d Crypto\u201982, pp.231\u2013236 (1982)","DOI":"10.1007\/978-1-4757-0602-4_22"},{"key":"33_CR4","unstructured":"M. Blum, \u201cHow to Prove a Theorem So No One Else Can Claim It,\u201d ISO\/TC97\/SC20\/WG2 N73 (1986)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman and S. Micali, \u201cNon-Interactive Zero-Knowledge and Its Applications,\u201d STOC, pp.103\u2013112 (1988)","DOI":"10.1145\/62212.62222"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"D. Chaum \u201cZero-Knowledge Undeniable Signatures,\u201d Eurocrypt\u201990 (1990)","DOI":"10.1007\/3-540-46877-3_41"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"D. Chaum, and H. van Antwerpen, \u201cUndeniable Signatures,\u201d Crypto\u201989 (1989)","DOI":"10.1007\/0-387-34805-0_20"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, \u201cSubliminal-Free Authentication and Signature,\u201d Eurocrypt\u201988, pp.23\u201334 (1988)","DOI":"10.1007\/3-540-45961-8_3"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, C. Goutier and S. Bengio, \u201cSpecial Uses and Abuses of the Fiat-Shamir Passport Protocol,\u201d Crypto\u201987 (1987)","DOI":"10.1007\/3-540-48184-2_3"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, and M. Hellman, \u201cNew Directions in Cryptography,\u201d IEEE Transactions on Information Theory, IT-22, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"A. DeSantis, S. Micali and G. Persiano, \u201cNon-Interactive Zero-Knowledge Proof Systems with Auxiliary Language,\u201d Crypto\u201988 (1988)","DOI":"10.1007\/3-540-48184-2_5"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir, \u201cWitness Indistinguishable and Witness Hiding Protocols,\u201d STOC, pp.416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat and A. Shamir, \u201cZero Knowledge Proofs of Identity,\u201d STOC, pp.210\u2013217 (1987)","DOI":"10.1145\/28395.28419"},{"key":"33_CR14","unstructured":"A. Fiat and A. Shamir, \u201cHow to Prove Yourself,\u201d Crypto\u201986 (1986)"},{"key":"33_CR15","unstructured":"Z. Galil, S. Harber, and M. Yung \u201cSymmetric Public-Key Encryption,\u201d Crypto\u201985 (1985)"},{"key":"33_CR16","unstructured":"O. Goldreich, and H. Krawczyk \u201cOn the Composition of Zero-Knowledge Proof Systems,\u201d Technical Report #570 of Technion (1989)"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"O. Goldreich, and A.L. Levin, \u201cA Hard-Core Predicate for All One-Way Functions,\u201d STOC\u201989, pp.25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"issue":"1","key":"33_CR18","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, pp291\u2013304 (1985)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"33_CR19","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and C. Rivest, \u201cA Secure Digital Signature Scheme,\u201d SIAM J. Comput., 17,2, pp.281\u2013308 (1988).","journal-title":"SIAM J. Comput."},{"key":"33_CR20","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 FOCS, pp.174\u2013187 (1986)","DOI":"10.1109\/SFCS.1986.47"},{"key":"33_CR21","unstructured":"M. Girault, and J.C. Pailles, \u201cAn Identity-Based Scheme Providing Zero-Knowledge Authentication and Authenticated Key-Exchange,\u201d ISO IEC\/JTC 1\/SC 27\/WG20.2 N200 (1990)"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"L.C. Guillou, and J.J. Quisquater, \u201cA Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing Both Transmission and Memory,\u201d Eurocrypto\u201988 (1988)","DOI":"10.1007\/3-540-45961-8_11"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, \u201cPseudo-Random Generators under Uniform Assumptions,\u201d STOC, pp.395\u2013404 (1990)","DOI":"10.1145\/100216.100270"},{"key":"33_CR24","unstructured":"ISO \u201cBanking-Requirements for Message Authentication (Wholesale)\u201d ISO\/TC68\/SC2\/WG2 N191 (1987 November)"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin, M. Luby \u201cPseudo-Random Number Generation from One-Way Functions,\u201d STOC, pp.12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"key":"33_CR26","unstructured":"L. Kohnfelder, \u201cTowards a Practical Public-Key Cryptosystems,\u201d B.S.Thesis, MIT (1979)"},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"K. Koyama, and K. Ohta, \u201cIdentity-based Conference Key Distribution Systems,\u201d Crypto\u201987 (1987)","DOI":"10.1007\/3-540-48184-2_13"},{"issue":"2","key":"33_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02351718","volume":"1","author":"K.S. McCurley","year":"1988","unstructured":"K.S. McCurley, \u201cA Key Distribution System Equivalent Factoring,\u201d J. of Cryptology, 1,2, pp.95\u2013106 (1988)","journal-title":"J. of Cryptology"},{"key":"33_CR29","unstructured":"T. Matsumoto and H. Imai, \u201cOn the Key Distribution Problem,\u201d Crypto\u201987, (1987)"},{"key":"33_CR30","unstructured":"M. Naor, \u201cBit Commitment Using Pseudo-Randomness,\u201d Crypto\u201989, (1989)"},{"key":"33_CR31","doi-asserted-by":"crossref","unstructured":"M. Naor, and M. Yung, \u201cUniversal One-Way Hash Functions and Their Cryptographic Applications,\u201d STOC, pp.33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"issue":"2","key":"33_CR32","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1049\/el:19880076","volume":"24","author":"K. Ohta","year":"1988","unstructured":"K. Ohta, \u201cEfficient Identification and Signature Scheme,\u201d Electronics Letters, 24,2, pp.115\u2013116 (1988)","journal-title":"Electronics Letters"},{"key":"33_CR33","unstructured":"K. Ohta, \u201cEncryption and Authentication Techniques for Information Security,\u201d Dr.Sci Thesis, Waseda University (1990)"},{"key":"33_CR34","doi-asserted-by":"crossref","unstructured":"K. Ohta, and T. Okamoto, \u201cA Modification of the Fiat-Shamir Scheme,\u201d Crypto\u201988 (1988)","DOI":"10.1049\/el:19880650"},{"issue":"24","key":"33_CR35","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1049\/el:19860880","volume":"22","author":"E. Okamoto","year":"1986","unstructured":"E. Okamoto, \u201cProposal for Identity-based key distribution systems,\u201d Electronics Letters, 22,24, pp.1283\u20131284 (1986)","journal-title":"Electronics Letters"},{"key":"33_CR36","unstructured":"T. Okamoto, and K. Ohta \u201cDisposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash,\u201d Crypto\u201989 (1989)"},{"key":"33_CR37","unstructured":"T. Okamoto, and K. Ohta \u201cDivertible Zero-Knowledge Interactive Proofs and Commutative Random Self-Reducible,\u201d Eurocrypt\u201989 (1989)"},{"issue":"10","key":"33_CR38","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1002\/scj.4690181002","volume":"18","author":"T. Okamoto","year":"1987","unstructured":"T. Okamoto, and A. Shiraishi \u201cA Single Public-Key Authentication Scheme for Multiple Users,\u201d Systems and Computers in Japan, 18,10, pp.14\u201324 (1987) Previous version, Technical Report of IECE Japan, IN83-92 (1984)","journal-title":"Systems and Computers in Japan"},{"key":"33_CR39","unstructured":"M. Rabin \u201cDigitalized Signatures and Public-Key Cryptosystems,\u201d MIT\/LCS\/TR-212, MIT Technical Report (1979)"},{"key":"33_CR40","doi-asserted-by":"crossref","unstructured":"J. Rompel, \u201cOne-Way Functions are Sufficient for Secure Signatures,\u201d STOC, pp.387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"key":"33_CR41","unstructured":"A. Shamir, \u201cIdentity-based Cryptosystems and Signature Schemes,\u201d Crypto\u201984 (1984)"},{"key":"33_CR42","unstructured":"Z. Shmuely, \u201cComposite Diffie-Hellman Public-Key Generating Systems Are Hard to Break,\u201d TR #356, Computer Science Dept. Technion, IIT (1985)"},{"issue":"4","key":"33_CR43","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1109\/49.17709","volume":"7","author":"S. Tsujii","year":"1989","unstructured":"S. Tsujii, and T. Itoh, \u201cAn ID-Based Crypto-system Based on the Discrete Logarithm Problem,\u201d IEEE J. Selected Area in Communications, 7,4 (1989)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"33_CR44","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"},{"key":"33_CR45","unstructured":"Y. Yacobi, \u201cA Key Distribution \u201cParadox\u201d,\u201d These Proceedings (1990)"},{"key":"33_CR46","unstructured":"Y. Yacobi, and Z. Shmuely, \u201cOn Key Distribution Systems,\u201d Crypto\u201989 (1989)"}],"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_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:05:13Z","timestamp":1605629113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_33","relation":{},"subject":[]}}