{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:26:20Z","timestamp":1725488780190},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583332"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48658-5_20","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:50:39Z","timestamp":1186692639000},"page":"188-201","source":"Crossref","is-referenced-by-count":4,"title":["Language Dependent Secure Bit Commitment"],"prefix":"10.1007","author":[{"given":"Toshiya","family":"Itoh","sequence":"first","affiliation":[]},{"given":"Yuji","family":"Ohta","sequence":"additional","affiliation":[]},{"given":"Hiroki","family":"Shizuya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"20_CR1","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 J. Comput. System Sci., Vol.37, No.2, pp.156\u2013189 (1988).","journal-title":"J. Comput. System Sci."},{"key":"20_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume-title":"Proceedings of Crypto\u201988","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 Proceedings of Crypto\u201988, Lecture Notes in Computer Science 403, pp.37\u201356 (1990)."},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00196727","volume":"4","author":"J. Boyar","year":"1991","unstructured":"Boyar, J., Friedl, K., and Lund, C., \u201cPractical Zero-Knowledge Proof: Giving Hints and Using Deficiencies,\u201d J. Cryptology, Vol.4, No.3, pp.185\u2013206 (1991).","journal-title":"J. Cryptology"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., and Ostrovsky, R., \u201cThe (True) Complexity of Statistical Zero-Knowledge,\u201d Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp.494\u2013502 (1990).","DOI":"10.1145\/100216.100285"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A., and Shamir, A., \u201cZero-Knowledge Proofs of Identity,\u201d J. Cryptology, Vol.1, No.2, pp.77\u201394 (1988).","journal-title":"J. Cryptology"},{"key":"20_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Proceedings of Crypto\u201989","author":"U. Feige","year":"1990","unstructured":"Feige, U. and Shamir, A., \u201cZero-Knowledge Proofs of Knowledge in Two Rounds,\u201d Proceedings of Crypto\u201989, Lecture Notes in Computer Science 435, pp.526\u2013544 (1990)."},{"key":"20_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BFb0032038","volume-title":"Proceedings of ICALP\u201990","author":"O. Goldreich","year":"1990","unstructured":"Goldreich, O. and Krawczyk, H., \u201cOn the Composition of Zero-Knowledge Proof Systems,\u201d Proceedings of ICALP\u201990, Lecture Notes in Computer Science 443, pp.268\u2013282 (1990)."},{"issue":"1","key":"20_CR8","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 (1989).","journal-title":"SIAM J. Comput."},{"issue":"1","key":"20_CR9","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., and Wigderson, A., \u201cProofs That Yield Nothing But Their Validity or All Languages in \n                    \n                      \n                    \n                    $$\n\\mathcal{N}\\mathcal{P}\n$$\n                   Have Zero-Knowledge Proof Systems,\u201d J. Assoc. Comput. Mach., Vol.38, No.1, pp.691\u2013729 (1991).","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"Goldreich, O. and Oren, Y., \u201cDefinitions and Properties of Zero-Knowledge Proof Systems,\u201d J. Cryptology, Vol.7, No.1, pp.1\u201332 (1994).","journal-title":"J. Cryptology"},{"key":"20_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-48071-4_14","volume-title":"Proceedings of Crypto\u201992","author":"M. Naor","year":"1993","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., and Yung, M., \u201cPerfect Zero-Knowledge Arguments for \n                    \n                      \n                    \n                    $$\n\\mathcal{N}\\mathcal{P}\n$$\n                   Can Be Based on General Complexity Assumptions,\u201d Proceedings of Crypto\u201992, Lecture Notes in Computer Science 740, pp.196\u2013214 (1993)."},{"key":"20_CR12","unstructured":"Ostrovsky, R., \u201cComparison of Bit-Commitment and Oblivious Transfer Protocols when Players have Different Computing Power,\u201d DIMACS Technical Report #90-41, pp.27\u201329 (1990)."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Tompa, M. and Woll, H., \u201cRandom Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information,\u201d Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pp.472\u2013482 (1987).","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201994"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48658-5_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:11Z","timestamp":1605647771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48658-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540583332"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48658-5_20","relation":{},"subject":[]}}