{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T05:19:57Z","timestamp":1733203197743,"version":"3.30.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":[[1997,12]]},"DOI":"10.1007\/s001459900018","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:57:52Z","timestamp":1027580272000},"page":"37-49","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["A language-dependent cryptographic primitive"],"prefix":"10.1007","volume":"10","author":[{"given":"Toshiya","family":"Itoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuji","family":"Ohta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"Shizuya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"No. 3","key":"10137_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0022-0000(91)90006-Q","volume":"42","author":"W. Aiello","year":"1991","unstructured":"Aiello, W., and H\u00e5stad, J., Statistical Zero-Knowledge Languages Can Be Recognized in Two Rounds,J. Comput. System Sci., Vol. 42, No. 3, pp. 327\u2013345 (1991).","journal-title":"J. Comput. System Sci."},{"key":"10137_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., and Ostrovsky, R., Perfect Zero-Knowledge in Constant Rounds,Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, pp. 482\u2013493 (1990).","DOI":"10.1145\/100216.100283"},{"key":"10137_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., and Ostrovsky, R., The (True) Complexity of Statistical Zero-Knowledge,Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, pp. 494\u2013502 (1990).","DOI":"10.1145\/100216.100285"},{"key":"10137_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume":"403","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Goldwasser, S., H\u00e5stad, J., Kilian, J., Micali, S., and Rogaway, P., Everything Provable Is Provable in Zero-Knowledge.Proceedings of Crypto '88, Lecture Notes in Computer Science, Vol. 403, pp. 37\u201356 (1990).","journal-title":"Proceedings of Crypto '88, Lecture Notes in Computer Science"},{"key":"10137_CR5","unstructured":"Blum, M., How To Prove a Theorem so No One Else Can Claim It,Proceedings of the ICM, pp. 1444\u20131451 (1986)."},{"issue":"No. 2","key":"10137_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"R. Boppana","year":"1987","unstructured":"Boppana, R., H\u00e5stad, J., and Zachos, S., Does co-NP Have Short Interactive Proofs?,Inform. Process. Lett., Vol. 25, No. 2, pp. 127\u2013132 (1987).","journal-title":"Inform. Process. Lett."},{"issue":"No. 3","key":"10137_CR7","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., Practical Zero-Knowledge Proof: Giving Hints and Using Deficiencies,J. Cryptology, Vol. 4, No. 3, pp. 185\u2013206 (1991).","journal-title":"J. Cryptology"},{"issue":"No. 2","key":"10137_CR8","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., Minimum Disclosure Proofs of Knowledge.J. Comput. System Sci., Vol. 37, No. 2, pp. 156\u2013189 (1988).","journal-title":"J. Comput. System Sci."},{"key":"10137_CR9","doi-asserted-by":"crossref","unstructured":"Chang, R., On the Structure of Bounded Queries to ArbitraryNP Sets,Proceedings of the 4th Structure in Complexity Theory Conference, pp. 250\u2013258 (1989).","DOI":"10.1109\/SCT.1989.41832"},{"key":"10137_CR10","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume":"435","author":"U. Feige","year":"1990","unstructured":"Feige, U., and Shamir, A., Zero-Knowledge Proofs of Knowledge in Two Rounds.Proceedings of Crypto '89. Lecture Notes in Computer Science, Vol. 435, pp. 526\u2013544 (1990).","journal-title":"Proceedings of Crypto '89. Lecture Notes in Computer Science"},{"key":"10137_CR11","doi-asserted-by":"crossref","unstructured":"Fortnow, L., The Complexity of Perfect Zero-Knowledge,Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 204\u2013209 (1987).","DOI":"10.1145\/28395.28418"},{"key":"10137_CR12","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BFb0032038","volume":"443","author":"O. Goldreich","year":"1990","unstructured":"Goldreich, O., and Krawczyk, H., On the Composition of Zero-Knowledge Proof Systems.Proceedings of ICALP '90, Lecture Notes in Computer Science, Vol. 443, pp. 268\u2013282 (1990).","journal-title":"Proceedings of ICALP '90, Lecture Notes in Computer Science"},{"issue":"No. 1","key":"10137_CR13","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., and Wigderson, A., Proofs that Yield Nothing but Their Validity or All Languages inNP have Zero-Knowledge Proof Systems.J. Assoc. Comput. Mach., Vol. 38, No. 1, pp. 691\u2013729 (1991).","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 1","key":"10137_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"Goldreich, O., and Oren, Y., Definitions and Properties of Zero-Knowledge Proof Systems.J. Cryptology, Vol. 7, No. 1, pp. 1\u201332 (1994).","journal-title":"J. Cryptology"},{"key":"10137_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Ostrovsky, R., and Petrank, E., Computational Complexity and Knowledge Complexity,Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, pp. 534\u2013543 (1994).","DOI":"10.1145\/195058.195406"},{"issue":"No. 1","key":"10137_CR16","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,SIAM J. Comput., Vol. 18, No. 1, pp. 186\u2013208 (1989).","journal-title":"SIAM J. Comput."},{"key":"10137_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"J. K\u00f6bler","year":"1993","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., and Tor\u00e1n, J.,The Graph Isomorphism Problem: Its Structural Complexity, Birkh\u00e4user, Boston (1993)."},{"key":"10137_CR18","doi-asserted-by":"crossref","unstructured":"Lozano, A., and Tor\u00e1n, L., On the Nonuniform Complexity of the Graph Isomorphism Problem,Proceedings of the 7th Structure in Complexity Theory Conference, pp. 118\u2013131 (1992).","DOI":"10.1109\/SCT.1992.215387"},{"key":"10137_CR19","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-48071-4_14","volume":"740","author":"M. Naor","year":"1993","unstructured":"Naor, M., Ostrovksy, R., Venkatesan, R., and Yung, M., Perfect Zero-Knowledge Arguments forNP Can Be Based on General Complexity Assumptions.Proceedings of Crypto, '92, Lecture Notes in Computer Science, Vol. 740, pp. 196\u2013214 (1993).","journal-title":"Proceedings of Crypto, '92, Lecture Notes in Computer Science"},{"key":"10137_CR20","first-page":"439","volume":"577","author":"R. Ostrovsky","year":"1992","unstructured":"Ostrovsky, R., Venkatesan, R., and Yung, M., Secure Commitment Against a Powerful Adversary.Proceedings of STACS '92, Lecture Notes in Computer Science, Vol. 577, pp. 439\u2013448 (1992).","journal-title":"Proceedings of STACS '92, Lecture Notes in Computer Science"},{"key":"10137_CR21","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"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001459900018.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s001459900018\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001459900018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001459900018.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:51:43Z","timestamp":1733187103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s001459900018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["10137"],"URL":"https:\/\/doi.org\/10.1007\/s001459900018","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[1997,12]]},"assertion":[{"value":"19 July 1994","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 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"}]}}