{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:24:53Z","timestamp":1725488693441},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540546207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46416-6_21","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T18:02:07Z","timestamp":1186423327000},"page":"243-256","source":"Crossref","is-referenced-by-count":16,"title":["Interactive Bi-Proof Systems and Undeniable Signature Schemes"],"prefix":"10.1007","author":[{"given":"Atsushi","family":"Fujioka","sequence":"first","affiliation":[]},{"given":"Tatsuaki","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Kazuo","family":"Ohta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"21_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, No.2, pp. 156\u2013189 (Oct., 1988).","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Micali, and R. Ostrovsky, \u201cPerfect Zero-Knowledge in Constant Rounds\u201d, Proceedings of 22nd annual ACM Symposium on Theory of Computing, pp.482\u2013493 (May, 1990).","DOI":"10.1145\/100216.100283"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/3-540-46877-3_41","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 90","author":"D. Chaum","year":"1991","unstructured":"D. Chaum, \u201cZero-Knowledge Undeniable Signatures\u201d, in Advances in Cryptology \u2014 EUROCRYPT\u2019 90, Lecture Notes in Computer Science 473, Springe-Verlag, Berlin, pp.458\u2013464 (1991)."},{"key":"21_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/0-387-34805-0_20","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89","author":"D. Chaum","year":"1990","unstructured":"D. Chaum and H. van Antwerpen, \u201cUndeniable Signatures\u201d, in Advances in Cryptology \u2014 CRYPTO\u2019 89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, pp.212\u2013216 (1990)."},{"issue":"6","key":"21_CR5","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. E. Hellman, \u201cNew Directions in Cryptography\u201d, IEEE Transactions on Information Theory, Vol.IT-22, No.6, pp.644\u2013654 (Nov., 1976).","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat, and A. Shamir, \u201cZero Knowledge Proofs of Identity\u201d, Proceedings of 19th annual ACM Symposium on Theory of Computing, pp.210\u2013217 (May, 1987).","DOI":"10.1145\/28395.28419"},{"issue":"4","key":"21_CR7","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 (Aug., 1989).","journal-title":"SIAM Journal on Computing"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Levin, \u201cA Hard-Core Predicate for all On-Way Functions\u201d, Proceedings of 21st annual ACM Symposium on Theory of Computing, pp.25\u201332 (May, 1989).","DOI":"10.1145\/73007.73010"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, \u201cThe Knowledge Complexity of Interactive Proof-Systems\u201d, Proceedings of 17th annual ACM Symposium on Theory of Computing, pp.291\u2013304 (May, 1985).","DOI":"10.1145\/22145.22178"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin, and M. Luby, \u201cPseudo-Random Number Generation from One-Way Functions\u201d, Proceedings of 21st annual ACM Symposium on Theory of Computing, pp.12\u201324 (May, 1989).","DOI":"10.1145\/73007.73009"},{"key":"21_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89","author":"M. Naor","year":"1990","unstructured":"M. Naor, \u201cBit Commitment Using Pseudo-Randomness\u201d, in Advances in Cryptology \u2014 CRYPTO\u2019 89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, pp.128\u2013136 (1990)."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, \u201cRandom Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information\u201d, 28th Annual Symposium on Foundations of Computer Science, IEEE, pp.472\u2013482 (Oct., 1987).","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46416-6_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:25Z","timestamp":1605647485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46416-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540546207"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46416-6_21","relation":{},"subject":[]}}