{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:12:45Z","timestamp":1743120765221,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_29","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"393-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Untold Story of $$\\mathsf {SBP}$$"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7616-0751","authenticated-orcid":false,"given":"Ilya","family":"Volkovich","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-16486-3_85","volume-title":"Structure in Complexity Theory","author":"EW Allender","year":"1986","unstructured":"Allender, E.W.: The complexity of sparse sets in P. In: Selman, A.L. (ed.) Structure in Complexity Theory. LNCS, vol. 223, pp. 1\u201311. Springer, Heidelberg (1986). \nhttps:\/\/doi.org\/10.1007\/3-540-16486-3_85"},{"key":"29_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(95)91133-B","volume":"137","author":"V Arvind","year":"1995","unstructured":"Arvind, V., K\u00f6bler, J., Sch\u00f6ning, U., Schuler, R.: If NP haspolynomial-size circuits, then MA = AM. Theor. Comput. Sci. 137(2), 279\u2013282 (1995). \nhttps:\/\/doi.org\/10.1016\/0304-3975(95)91133-B","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Babai, L.: Trading group theory for randomness. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC), pp. 421\u2013429 (1985). \nhttps:\/\/doi.org\/10.1145\/22145.22192","key":"29_CR4","DOI":"10.1145\/22145.22192"},{"issue":"6","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1016\/j.jcss.2006.05.001","volume":"72","author":"E B\u00f6hler","year":"2006","unstructured":"B\u00f6hler, E., Gla\u00dfer, C., Meister, D.: Error-bounded probabilistic computations between MA and AM. J. Comput. Syst. Sci. 72(6), 1043\u20131076 (2006). \nhttps:\/\/doi.org\/10.1016\/j.jcss.2006.05.001","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"publisher","unstructured":"Bouland, A., Chen, L., Holden, D., Thaler, J., Vasudevan, P.: On the power of statistical zero knowledge. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, 15\u201317 October 2017, pp. 708\u2013719 (2017). \nhttps:\/\/doi.org\/10.1109\/FOCS.2017.71","key":"29_CR6","DOI":"10.1109\/FOCS.2017.71"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.2190\/4U1D-VQRM-J70D-JEQF","volume":"5","author":"L Fortnow","year":"1989","unstructured":"Fortnow, L.: The complexity of perfect zero-knowledge. Adv. Comput. Res. 5, 327\u2013343 (1989)","journal-title":"Adv. Comput. Res."},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-22670-0_24","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O.: A sample of samplers: a computational perspective on sampling. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 302\u2013332. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22670-0_24"},{"doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 59\u201368 (1986). \nhttps:\/\/doi.org\/10.1145\/12130.12137","key":"29_CR9","DOI":"10.1145\/12130.12137"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","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). \nhttps:\/\/doi.org\/10.1137\/0218012","journal-title":"SIAM J. Comput."},{"issue":"5","key":"29_CR11","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1137\/15M103145X","volume":"45","author":"M G\u00f6\u00f6s","year":"2016","unstructured":"G\u00f6\u00f6s, M., Lovett, S., Meka, R., Watson, T., Zuckerman, D.: Rectangles are nonnegative juntas. SIAM J. Comput. 45(5), 1835\u20131869 (2016). \nhttps:\/\/doi.org\/10.1137\/15M103145X","journal-title":"SIAM J. Comput."},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2015.05.031","volume":"593","author":"BM Kapron","year":"2015","unstructured":"Kapron, B.M., Malka, L., Srinivasan, V.: A framework for non-interactive instance-dependent commitment schemes (NIC). Theor. Comput. Sci. 593, 1\u201315 (2015). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2015.05.031","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Karp, R.M., Lipton, R.J.: Some connections between nonuniform and uniform complexity classes. In: Proceedings of the 12th Annual ACM Symposium on Theory of Computing, Los Angeles, California, USA, 28\u201330 April 1980, pp. 302\u2013309 (1980). \nhttps:\/\/doi.org\/10.1145\/800141.804678","key":"29_CR13","DOI":"10.1145\/800141.804678"},{"issue":"5","key":"29_CR14","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/S0097539700389652","volume":"31","author":"A Klivans","year":"2002","unstructured":"Klivans, A., van Melkebeek, D.: Graph nonisomorphism has subexponential sizeproofs unless the polynomial-time hierarchy collapses. SIAM J. Comput. 31(5), 1501\u20131526 (2002). \nhttps:\/\/doi.org\/10.1137\/S0097539700389652","journal-title":"SIAM J. Comput."},{"issue":"3","key":"29_CR15","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s00037-005-0197-7","volume":"14","author":"PB Miltersen","year":"2005","unstructured":"Miltersen, P.B., Vinodchandran, N.V.: Derandomizing Arthur-Merlin games using hitting sets. Comput. Complex. 14(3), 256\u2013279 (2005). \nhttps:\/\/doi.org\/10.1007\/s00037-005-0197-7","journal-title":"Comput. Complex."},{"issue":"2","key":"29_CR16","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1137\/0211026","volume":"11","author":"S Moran","year":"1982","unstructured":"Moran, S.: On the accepting density hierarchy in NP. SIAM J. Comput. 11(2), 344\u2013349 (1982). \nhttps:\/\/doi.org\/10.1137\/0211026","journal-title":"SIAM J. Comput."},{"issue":"1","key":"29_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jcss.1999.1664","volume":"60","author":"T Okamoto","year":"2000","unstructured":"Okamoto, T.: On relationships between statistical zero-knowledge proofs. J. Comput. Syst. Sci. 60(1), 47\u2013108 (2000). \nhttps:\/\/doi.org\/10.1006\/jcss.1999.1664","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Rubinstein, R.: Structural Complexity Classes of Sparse Sets: Intractability, Data Compression, and Printability. Ph.D. thesis, Northeastern University, Department of computer Science (1988)","key":"29_CR18"},{"issue":"2","key":"29_CR19","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"A Sahai","year":"2003","unstructured":"Sahai, A., Vadhan, S.P.: A complete problem for statistical zero knowledge. J. ACM 50(2), 196\u2013249 (2003)","journal-title":"J. ACM"},{"issue":"1","key":"29_CR20","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","volume":"5","author":"LG Valiant","year":"1976","unstructured":"Valiant, L.G.: Relative complexity of checking and evaluating. Inf. Process. Lett. 5(1), 20\u201323 (1976). \nhttps:\/\/doi.org\/10.1016\/0020-0190(76)90097-1","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"publisher","unstructured":"Vereshchagin, N.K.: On the power of PP. In: Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pp. 138\u2013143 (1992). \nhttps:\/\/doi.org\/10.1109\/SCT.1992.215389","key":"29_CR21","DOI":"10.1109\/SCT.1992.215389"},{"issue":"1","key":"29_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00037-014-0091-2","volume":"25","author":"T Watson","year":"2014","unstructured":"Watson, T.: The complexity of estimating min-entropy. Comput. Complex. 25(1), 153\u2013175 (2014). \nhttps:\/\/doi.org\/10.1007\/s00037-014-0091-2","journal-title":"Comput. Complex."},{"issue":"4\/5","key":"29_CR23","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01940870","volume":"16","author":"D Zuckerman","year":"1996","unstructured":"Zuckerman, D.: Simulating BPP using a general weak random source. Algorithmica 16(4\/5), 367\u2013391 (1996). \nhttps:\/\/doi.org\/10.1007\/BF01940870","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:07:33Z","timestamp":1592780853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":">= 3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}