{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:20Z","timestamp":1760202560154,"version":"3.33.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,7,12]],"date-time":"2007-07-12T00:00:00Z","timestamp":1184198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s00224-007-9028-3","type":"journal-article","created":{"date-parts":[[2007,7,17]],"date-time":"2007-07-17T02:32:01Z","timestamp":1184639521000},"page":"100-117","source":"Crossref","is-referenced-by-count":3,"title":["SZK Proofs for Black-Box Group Problems"],"prefix":"10.1007","volume":"43","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bireswar","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,12]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. In: IEEE Foundations of Computer Science, pp.\u00a0743\u2013750 (2002)","key":"9028_CR1","DOI":"10.1109\/SFCS.2002.1181999"},{"doi-asserted-by":"crossref","unstructured":"Arvind, V., Tor\u00e1n, J.: Solvable group isomorphism is (almost) in $\\mbox {\\rm NP}\\cap \\mbox {\\rm co-NP}$ . In: IEEE Conference on Computational Complexity, pp.\u00a091\u2013103 (2004)","key":"9028_CR2","DOI":"10.1109\/CCC.2004.1313808"},{"doi-asserted-by":"crossref","unstructured":"Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite groups. In: STOC 1991, pp.\u00a0164\u2013174","key":"9028_CR3","DOI":"10.1145\/103418.103440"},{"issue":"1","key":"9028_CR4","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0405008","volume":"5","author":"L. Babai","year":"1992","unstructured":"Babai, L.: Bounded round interactive proofs in finite groups. SIAM J. Discret. Math. 5(1), 88\u2013111 (1992)","journal-title":"SIAM J. Discret. Math."},{"doi-asserted-by":"crossref","unstructured":"Babai, L., Szemer\u00e9di, E.: On the complexity of matrix group problems I. In: IEEE Foundations of Computer Science, pp.\u00a0229\u2013240 (1984)","key":"9028_CR5","DOI":"10.1109\/SFCS.1984.715919"},{"key":"9028_CR6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1006\/jabr.1996.6980","volume":"194","author":"L. Babai","year":"1997","unstructured":"Babai, L., Goodman, A.J., Kantor, W.M., Luks, E.M., P\u00e1lfy, P.P.: Short presentations for finite groups. J. Algebra 194, 79\u2013112 (1997)","journal-title":"J. Algebra"},{"doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: Proceedings of the 30th STOC, pp.\u00a0409\u2013418 (1998)","key":"9028_CR7","DOI":"10.1145\/276698.276853"},{"key":"9028_CR8","series-title":"Basic Tools","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a0I. Basic Tools. Cambridge University Press, Cambridge (2001)"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Vadhan, S.: Comparing entropies in statistical zero knowledge with applications to the structure of SZK. In: IEEE Conference on Computational Complexity (1999)","key":"9028_CR9","DOI":"10.1109\/CCC.1999.766262"},{"issue":"3","key":"9028_CR10","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems. J. ACM 38(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"issue":"1","key":"9028_CR11","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"9028_CR12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01200427","volume":"2","author":"J. K\u00f6bler","year":"1992","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: Graph isomorphism is low for PP. Comput. Complex. 2, 301\u2013330 (1992)","journal-title":"Comput. Complex."},{"doi-asserted-by":"crossref","unstructured":"Luks, E.M.: Permutation groups and polynomial-time computation. In: Groups and Computation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a011, pp.\u00a0139\u2013175 (1993)","key":"9028_CR13","DOI":"10.1090\/dimacs\/011\/11"},{"doi-asserted-by":"crossref","unstructured":"Micciancio, D., Vadhan, S.: Statistical zero-knowledge proofs with efficient provers: lattice problems and more. In: Proceedings of the 23rd CRYPTO Conference. Lecture Notes in Comput. Sci., vol.\u00a02729, pp.\u00a0282\u2013298 (2003)","key":"9028_CR14","DOI":"10.1007\/978-3-540-45146-4_17"},{"doi-asserted-by":"crossref","unstructured":"Micciancio, D., Ong, S.J., Sahai, A., Vadhan, S.: Concurrent zero knowledge without complexity assumptions. In: Electronic Colloquium on Computational Complexity (ECCC), Technical Report TR05-093 (August 2005)","key":"9028_CR15","DOI":"10.1007\/11681878_1"},{"doi-asserted-by":"crossref","unstructured":"Sahai, A., Vadhan, S.: A complete promise problem for statistical zero-knowledge. In: Foundations of Computer Science, pp.\u00a0448\u2013457 (1997)","key":"9028_CR16","DOI":"10.1109\/SFCS.1997.646133"},{"key":"9028_CR17","series-title":"Cambridge Tracts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation Group Algorithms","author":"A. Seress","year":"2003","unstructured":"Seress, A.: Permutation Group Algorithms. Cambridge Tracts in Mathematics, vol.\u00a0152. Cambridge Univ. Press, Cambridge (2003)"},{"unstructured":"Vadhan, S.: A study of statistical zero-knowledge proofs. Ph.D. Thesis, MIT (1999). Revised 8\/00, http:\/\/www.eecs.harvard.edu\/~salil\/papers\/phdthesis.ps","key":"9028_CR18"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9028-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9028-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9028-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T14:35:58Z","timestamp":1737297358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9028-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,12]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9028"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9028-3","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2007,7,12]]}}}