{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:07Z","timestamp":1725488407775},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48329-2_6","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:25:55Z","timestamp":1186363555000},"page":"61-72","source":"Crossref","is-referenced-by-count":0,"title":["A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity"],"prefix":"10.1007","author":[{"given":"Toshiya","family":"Itoh","sequence":"first","affiliation":[]},{"given":"Masafumi","family":"Hoshi","sequence":"additional","affiliation":[]},{"given":"Shigeo","family":"Tsujii","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01276436","volume":"2","author":"R. Beigel","year":"1992","unstructured":"Beigel, R. and Feigenbaum, J., \u201cOn Being Coherent Without Being Very Hard,\u201d Computational Complexity, Vol.2, No.1, pp.1\u201317 (1992).","journal-title":"Computational Complexity"},{"key":"6_CR2","unstructured":"Bellare, M. and Goldwasser, S., \u201cThe Complexity of Decision versus Search,\u201d MIT\/LCS\/TM-444 (April 1991)."},{"key":"6_CR3","unstructured":"Bellare, M. and Goldwasser, S., \u201cThe Complexity of Decision versus Search,\u201d to appear in SIAM J. on Comput."},{"key":"6_CR4","first-page":"254","volume":"36","author":"L. Babai","year":"1988","unstructured":"Babai, L. and Moran, S., \u201cArthur-Merlin Games: A Randomized Proof Systems and a Hierarchy of Complexity Classes,\u201d JCSS, Vol.36, pp.254\u2013276 (1988).","journal-title":"JCSS"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0019-9958(84)80056-X","volume":"61","author":"S. Even","year":"1984","unstructured":"Even, S., Selman, A., and Yacobi, Y., \u201cThe Complexity of Promise Problems with Applications to Public-Key Cryptography,\u201d Information and Control, Vol.61, pp.159\u2013173 (1984).","journal-title":"Information and Control"},{"key":"6_CR6","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. of Cryptology, Vol.1, pp.77\u201394 (1988).","journal-title":"J. of Cryptology"},{"issue":"1","key":"6_CR7","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., The Knowledge Complexity of Interactive Proof Systems,\u201d SIAM J. on Comput., Vol.18, No.1, pp.186\u2013208 (1989).","journal-title":"SIAM J. on Comput."},{"issue":"1","key":"6_CR8","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% MathType!MTEF!2!1!+-\n% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn\n% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr\n% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9\n% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x\n% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgznf\n% gDOfdaryqr1ngBPrginfgDObYtUvgaiuaacqWFneVtcqWFpepuaaa!431D!\n\n                    $$\n\\mathcal{N}\\mathcal{P}\n$$\n                  \n Have Zero-Knowledge Interactive Proof Systems,\u201d J. of the ACM, Vol.38, No.1, pp.691\u2013729 (1991).","journal-title":"J. of the ACM"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/0217018","volume":"17","author":"J. Grollmann","year":"1988","unstructured":"Grollmann, J. and Selman, A., \u201cComplexity Measures for Public-Key Cryptosystems,\u201d SIAM J. on Comput., Vol.17, No.2, pp.309\u2013335 (1988).","journal-title":"SIAM J. on Comput."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Tompa, M. and Woll, H., \u201cRandom Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information,\u201d Proc. of FOCS, pp.472\u2013482 (1987).","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48329-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:44Z","timestamp":1605647744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48329-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540577669"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48329-2_6","relation":{},"subject":[]}}