{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:50:29Z","timestamp":1649040629036},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Cryptology"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf00190804","type":"journal-article","created":{"date-parts":[[2004,9,25]],"date-time":"2004-09-25T10:18:59Z","timestamp":1096107539000},"page":"101-109","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A low communication competitive interactive proof system for promised quadratic residuosity"],"prefix":"10.1007","volume":"9","author":[{"given":"Toshiya","family":"Itoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masafumi","family":"Hoshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeo","family":"Tsujii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00190804_CR1","doi-asserted-by":"crossref","unstructured":"Babai, L., Trading Group Theory for Randomness, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pp. 421\u2013429 (1985).","DOI":"10.1145\/22145.22192"},{"issue":"No. 2","key":"BF00190804_CR2","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"Vol. 37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., and Cr\u00e9peau, C., Minimum Disclosure Proofs of Knowledge, J. Comput. System Sci., Vol. 37, No. 2, pp. 156\u2013189 (1988).","journal-title":"J. Comput. System Sci."},{"issue":"No. l","key":"BF00190804_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01276436","volume":"Vol. 2","author":"R. Beigel","year":"1992","unstructured":"Beigel, R., and Feigenbaum, J., On Being Incoherent Without Being Very Hard, Comput. Complexity, Vol. 2, No. l, pp. 1\u201317 (1992).","journal-title":"Comput. Complexity"},{"issue":"No. 1","key":"BF00190804_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01200056","volume":"Vol. 1","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., and Lund, C., Nondeterministic Exponential Time Has Two-Prover Interactive Protocols, Comput. Complexity, Vol. 1, No. 1, pp. 3\u201340 (1991).","journal-title":"Comput. Complexity"},{"issue":"No. 1","key":"BF00190804_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/S0097539792228289","volume":"Vol. 23","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., and Goldwasser, S., The Complexity of Decision Versus Search, SIAM J. Comput., Vol. 23, No. 1, pp. 97\u2013119 (1994).","journal-title":"SIAM J. Comput."},{"key":"BF00190804_CR6","doi-asserted-by":"crossref","unstructured":"Blum, M., and Kannan, S., Designing Programs that Check Their Work, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 86\u201397 (1989).","DOI":"10.1145\/73007.73015"},{"key":"BF00190804_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0019-9958(84)80056-X","volume":"Vol. 61","author":"S. Even","year":"1984","unstructured":"Even, S., Selman, A., and Yacobi, Y, The Complexity of Promise Problems with Applications to Public-Key Cryptography, Inform. and Control, Vol. 61, pp. 159\u2013173 (1984).","journal-title":"Inform. and Control"},{"key":"BF00190804_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02351717","volume":"Vol. 1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A., and Shamir, A., Zero-Knowledge Proofs of Identity, J. Cryptology, Vol. 1, pp. 77\u201394 (1988).","journal-title":"J. Cryptology"},{"key":"BF00190804_CR9","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Proceedings of Crypto '86","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., and Shamir, A., How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Proceedings of Crypto '86, Lecture Notes in Computer Science, Vol. 263, Springer-Verlag, Berlin, pp. 186\u2013194 (1987)."},{"issue":"No. 1","key":"BF00190804_CR10","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"Vol. 18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., and Rackoff, C., The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput., Vol. 18, No. 1, pp. 186\u2013208 (1989).","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"BF00190804_CR11","first-page":"691","volume":"Vol. 38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., and Wigderson, A., Proofs that Yield Nothing but Their Validity or All Languages in 109\u201301 Have Zero-Knowledge Interactive Proof Systems, J. Assoc. Comput. Mach., Vol. 38, No. 1, pp. 691\u2013729 (1991).","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"BF00190804_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","volume":"Vol. 17","author":"J. Grollmann","year":"1988","unstructured":"Grollmann, J., and Selman, A., Complexity Measures for Public-Key Cryptosystems, SIAM J. Comput., Vol. 17, No. 2, pp. 309\u2013335 (1988).","journal-title":"SIAM J. Comput."},{"issue":"No. 4","key":"BF00190804_CR13","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1145\/146585.146605","volume":"Vol. 39","author":"C. Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H., and Nisan, N., Algebraic Method for Interactive Proof Systems, J. Assoc. Comput. Mach., Vol. 39, No. 4, pp. 859\u2013868 (1992).","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 4","key":"BF00190804_CR14","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1145\/146585.146609","volume":"Vol. 39","author":"A. Shamir","year":"1992","unstructured":"Shamir, A., 109\u201302, J. Assoc. Comput. Mach., Vol. 39, No. 4, pp. 869\u2013877 (1992).","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF00190804_CR15","doi-asserted-by":"crossref","unstructured":"Tompa, M., and Woll, H., Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information, Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, pp. 472\u2013482 (1987).","DOI":"10.1109\/SFCS.1987.49"},{"key":"BF00190804_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A., Coherent Functions and Program Checkers, Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 84\u201394 (1990).","DOI":"10.1145\/100216.100226"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00190804.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00190804\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00190804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00190804.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:33:15Z","timestamp":1586334795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00190804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF00190804"],"URL":"https:\/\/doi.org\/10.1007\/bf00190804","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]},"assertion":[{"value":"29 October 1993","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 1995","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}