{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:52:15Z","timestamp":1764784335092,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030360320"},{"type":"electronic","value":"9783030360337"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36033-7_12","type":"book-chapter","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T21:03:34Z","timestamp":1574456614000},"page":"311-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Statistical Difference Beyond the Polarizing Regime"],"prefix":"10.1007","author":[{"given":"Itay","family":"Berman","sequence":"first","affiliation":[]},{"given":"Akshay","family":"Degwekar","sequence":"additional","affiliation":[]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[]},{"given":"Prashant Nalini","family":"Vasudevan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/978-3-319-63688-7_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Arkis, B., Raykov, P., Vasudevan, P.N.: Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 727\u2013757. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_24"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: On basing one-way functions on NP-hardness. In: Kleinberg, J.M. (ed.) Symposium on Theory of Computing, pp. 701\u2013710. ACM (2006)","DOI":"10.1145\/1132516.1132614"},{"issue":"3","key":"12_CR3","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., Hastad, J.: Statistical zero-knowledge languages can be recognized in two rounds. J. Comput. Syst. Sci. 42(3), 327\u2013345 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-46494-6_1","volume-title":"Theory of Cryptography","author":"A Bogdanov","year":"2015","unstructured":"Bogdanov, A., Brzuska, C.: On basing size-verifiable one-way functions on NP-hardness. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 1\u20136. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_1"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-662-53008-5_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Z Brakerski","year":"2016","unstructured":"Brakerski, Z., Brzuska, C., Fleischhacker, N.: On statistically secure obfuscation with approximate correctness. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part II. LNCS, vol. 9815, pp. 551\u2013578. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_19"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-22935-0_36","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"N Bhatnagar","year":"2011","unstructured":"Bhatnagar, N., Bogdanov, A., Mossel, E.: The computational complexity of estimating MCMC convergence time. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2011. LNCS, vol. 6845, pp. 424\u2013435. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22935-0_36"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Bouland, A., Chen, L., Holden, D., Thaler, J., Vasudevan, P.N.: On the power of statistical zero knowledge. In: FOCS (2017)","DOI":"10.1109\/FOCS.2017.71"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-78375-8_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"I Berman","year":"2018","unstructured":"Berman, I., Degwekar, A., Rothblum, R.D., Vasudevan, P.N.: Multi-collision resistant hash functions and their applications. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 133\u2013161. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_5"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-319-63688-7_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"N Bitansky","year":"2017","unstructured":"Bitansky, N., Degwekar, A., Vaikuntanathan, V.: Structure vs. hardness through the obfuscation lens. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 696\u2013723. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_23"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00145-002-0113-0","volume":"16","author":"M Ben-Or","year":"2003","unstructured":"Ben-Or, M., Gutfreund, D.: Trading help for interaction in statistical zero-knowledge proofs. J. Cryptol. 16(2), 95\u2013116 (2003)","journal-title":"J. Cryptol."},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"RB Boppana","year":"1987","unstructured":"Boppana, R.B., H\u00e5stad, J., Zachos, S.: Does co-NP have short interactive proofs? Inf. Process. Lett. 25(2), 127\u2013132 (1987)","journal-title":"Inf. Process. Lett."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Kalai, Y.T., Paneth, O.: Multi-collision resistance: a paradigm for keyless hash functions. In: STOC (2018)","DOI":"10.1145\/3188745.3188870"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-40041-4_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Bogdanov","year":"2013","unstructured":"Bogdanov, A., Lee, C.H.: Limits of provable security for homomorphic encryption. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 111\u2013128. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_7"},{"key":"12_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4946-7","volume-title":"Asymptotic Methods in Statistical Decision Theory","author":"L Le Cam","year":"1986","unstructured":"Le Cam, L.: Part I. Springer, New York (1986). https:\/\/doi.org\/10.1007\/978-1-4612-4946-7"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-540-78524-8_28","volume-title":"Theory of Cryptography","author":"A Chailloux","year":"2008","unstructured":"Chailloux, A., Ciocan, D.F., Kerenidis, I., Vadhan, S.: Interactive and noninteractive zero knowledge are equivalent in the help model. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 501\u2013534. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_28"},{"key":"12_CR16","unstructured":"Chen, Y.-H., G\u00f6\u00f6s, M., Vadhan, S.P., Zhang, J.: A tight lower bound for entropy flattening. In: CCC (2018)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-24676-3_21","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"C Dwork","year":"2004","unstructured":"Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 342\u2013360. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_21"},{"key":"12_CR18","first-page":"429","volume":"5","author":"M F\u00fcrer","year":"1989","unstructured":"F\u00fcrer, M., Goldreich, O., Mansour, Y., Sipser, M., Zachos, S.: On completeness and soundness in interactive proof systems. Adv. Comput. Res. 5, 429\u2013442 (1989)","journal-title":"Adv. Comput. Res."},{"key":"12_CR19","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":"12_CR20","unstructured":"Fehr, S., Vaudenay, S.: Personal Communication (2017)"},{"issue":"6","key":"12_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(90)90010-U","volume":"34","author":"O Goldreich","year":"1990","unstructured":"Goldreich, O.: A note on computational indistinguishability. Inf. Process. Lett. 34(6), 277\u2013281 (1990)","journal-title":"Inf. Process. Lett."},{"key":"12_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/9781108135252","volume-title":"Introduction to Property Testing","author":"O Goldreich","year":"2017","unstructured":"Goldreich, O.: Introduction to Property Testing. Cambridge University Press, Cambridge (2017)"},{"key":"12_CR23","first-page":"73","volume":"5","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. Adv. Comput. Res. 5, 73\u201390 (1989)","journal-title":"Adv. Comput. Res."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: STOC (1998)","DOI":"10.1145\/276698.276852"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/3-540-48405-1_30","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"O Goldreich","year":"1999","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Can statistical zero knowledge be made non-interactive? Or on the relationship of SZK and NISZK. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 467\u2013484. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_30"},{"key":"12_CR26","unstructured":"Goldreich, O., Vadhan, S.P.: Comparing entropies in statistical zero knowledge with applications to the structure of SZK. In: CCC (1999)"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-22670-0_27","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay Between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O., Vadhan, S.: On the complexity of computational problems regarding distributions. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay Between Randomness and Computation. LNCS, vol. 6650, pp. 390\u2013405. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_27"},{"issue":"1\u20132","key":"12_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-002-0169-0","volume":"11","author":"O Goldreich","year":"2002","unstructured":"Goldreich, O., Vadhan, S., Wigderson, A.: On interactive proofs with a laconic prover. Comput. Complex. 11(1\u20132), 1\u201353 (2002)","journal-title":"Comput. Complex."},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/11535218_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"T Holenstein","year":"2005","unstructured":"Holenstein, T., Renner, R.: One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 478\u2013493. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_29"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: STOC, pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Komargodski, I., Naor, M., Yogev, E.: White-box vs. black-box complexity of search problems: Ramsey and graph property testing. In: FOCS (2017)","DOI":"10.1109\/FOCS.2017.63"},{"key":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-78375-8_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"I Komargodski","year":"2018","unstructured":"Komargodski, I., Naor, M., Yogev, E.: Collision resistant hashing for paranoids: dealing with multiple collisions. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 162\u2013194. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_6"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-96881-0_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"I Komargodski","year":"2018","unstructured":"Komargodski, I., Yogev, E.: On distributional collision resistant hashing. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 303\u2013327. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_11"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-70500-2_2","volume-title":"Theory of Cryptography","author":"S Lovett","year":"2017","unstructured":"Lovett, S., Zhang, J.: On the impossibility of entropy reversal, and its application to zero-knowledge proofs. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 31\u201355. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_2"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Naor, M., Rothblum, G.N.: Learning to impersonate. In: ICML, pp. 649\u2013656 (2006)","DOI":"10.1145\/1143844.1143926"},{"key":"12_CR36","unstructured":"Ostrovsky, R.: One-way functions, hard on average problems, and statistical zero-knowledge proofs. In: Structure in Complexity Theory Conference, pp. 133\u2013138 (1991)"},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-78524-8_27","volume-title":"Theory of Cryptography","author":"SJ Ong","year":"2008","unstructured":"Ong, S.J., Vadhan, S.: An equivalence between zero knowledge and commitments. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 482\u2013500. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_27"},{"key":"12_CR38","unstructured":"Ostrovsky, R., Wigderson, A.: One-way functions are essential for non-trivial zero-knowledge. In: ISTCS, pp. 3\u201317 (1993)"},{"key":"12_CR39","unstructured":"Polyanskiy, Y., Wu, Y.: Lecture notes on information theory (2017). http:\/\/people.lids.mit.edu\/yp\/homepage\/data\/itlectures_v5.pdf"},{"issue":"2","key":"12_CR40","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"A Sahai","year":"2003","unstructured":"Sahai, A., Vadhan, S.: A complete problem for statistical zero knowledge. J. ACM (JACM) 50(2), 196\u2013249 (2003)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"12_CR41","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/18.850703","volume":"46","author":"F Tops\u00f8e","year":"2000","unstructured":"Tops\u00f8e, F.: Some inequalities for information divergence and related measures of discrimination. IEEE Trans. Inf. Theory 46(4), 1602\u20131609 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"12_CR42","unstructured":"Vadhan, S.P.: A study of statistical zero-knowledge proofs. Ph.D. thesis, Massachusetts Institute of Technology (1999)"},{"key":"12_CR43","first-page":"151","volume":"23","author":"A Yehudayoff","year":"2016","unstructured":"Yehudayoff, A.: Pointer chasing via triangular discrimination. Electron. Colloq. Comput. Complex. (ECCC) 23, 151 (2016)","journal-title":"Electron. Colloq. Comput. Complex. (ECCC)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36033-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T03:05:56Z","timestamp":1669086356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-36033-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030360320","9783030360337"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36033-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nuremberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2019\/","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":"Review software by Shai Halevi","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"147","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":"43","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":"29% - 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.35","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":"15","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}