{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:15:29Z","timestamp":1781259329500,"version":"3.54.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306198","type":"print"},{"value":"9783031306204","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30620-4_2","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T11:03:05Z","timestamp":1681470185000},"page":"35-65","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Differential Privacy and\u00a0Adaptive Data Analysis with\u00a0Bounded Space"],"prefix":"10.1007","author":[{"given":"Itai","family":"Dinur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uri","family":"Stemmer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David P.","family":"Woodruff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samson","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Alon, N., Livni, R., Malliaris, M., Moran, S.: Private PAC learning implies finite littlestone dimension. In: STOC, pp. 852\u2013860. ACM (2019). https:\/\/doi.org\/10.1145\/3313276.3316312","DOI":"10.1145\/3313276.3316312"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Bassily, R., Nissim, K., Smith, A.D., Steinke, T., Stemmer, U., Ullman, J.R.: Algorithmic stability for adaptive data analysis. SIAM J. Comput. 50(3) (2021). https:\/\/doi.org\/10.1137\/16M1103646","DOI":"10.1137\/16M1103646"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-85174-5_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A Beimel","year":"2008","unstructured":"Beimel, A., Nissim, K., Omri, E.: Distributed private data analysis: simultaneously solving how and what. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 451\u2013468. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_25"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) CCS 1993, pp. 62\u201373. ACM (1993). https:\/\/doi.org\/10.1145\/168588.168596","DOI":"10.1145\/168588.168596"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Blocki, J., Blum, A., Datta, A., Sheffet, O.: The Johnson-Lindenstrauss transform itself preserves differential privacy. In: FOCS, pp. 410\u2013419. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.67","DOI":"10.1109\/FOCS.2012.67"},{"issue":"5","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1109\/18.705568","volume":"44","author":"D Boneh","year":"1998","unstructured":"Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44(5), 1897\u20131905 (1998). https:\/\/doi.org\/10.1109\/18.705568","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Brown, G., Bun, M., Feldman, V., Smith, A., Talwar, K.: When is memorization of irrelevant training data necessary for high-accuracy learning? In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 123\u2013132 (2021). https:\/\/doi.org\/10.1145\/3406325.3451131","DOI":"10.1145\/3406325.3451131"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Bun, M., Nissim, K., Stemmer, U., Vadhan, S.P.: Differentially private release and learning of threshold functions. In: FOCS, pp. 634\u2013649. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.45","DOI":"10.1109\/FOCS.2015.45"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Bun, M., Ullman, J.R., Vadhan, S.P.: Fingerprinting codes and the price of approximate differential privacy. In: STOC, pp. 1\u201310. ACM (2014). https:\/\/doi.org\/10.1145\/2591796.2591877","DOI":"10.1145\/2591796.2591877"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Canetti","year":"2000","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 453\u2013469. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_33"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-319-96884-1_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Coretti","year":"2018","unstructured":"Coretti, S., Dodis, Y., Guo, S.: Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 693\u2013721. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_23"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-319-78381-9_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Coretti","year":"2018","unstructured":"Coretti, S., Dodis, Y., Guo, S., Steinberger, J.: Random oracles and non-uniformity. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 227\u2013258. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_9"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-64381-2_12","volume-title":"Theory of Cryptography","author":"W Dai","year":"2020","unstructured":"Dai, W., Tessaro, S., Zhang, X.: Super-linear time-memory trade-offs for symmetric encryption. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 335\u2013365. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_12"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-030-64381-2_9","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2020","unstructured":"Dodis, Y., Farshim, P., Mazaheri, S., Tessaro, S.: Towards defeating backdoored random oracles: indifferentiability with bounded adaptivity. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 241\u2013273. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_9"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Dwork, C., Feldman, V., Hardt, M., Pitassi, T., Reingold, O., Roth, A.L.: Preserving statistical validity in adaptive data analysis. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 117\u2013126 (2015)","DOI":"10.1145\/2746539.2746580"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. J. Priv. Confidentiality 7(3), 17\u201351 (2016). https:\/\/doi.org\/10.29012\/jpc.v7i3.405","DOI":"10.29012\/jpc.v7i3.405"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Dwork, C., Naor, M., Reingold, O., Rothblum, G.N., Vadhan, S.: On the complexity of differentially private data release: efficient algorithms and hardness results. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 381\u2013390 (2009). https:\/\/doi.org\/10.1145\/1536414.1536467","DOI":"10.1145\/1536414.1536467"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.P.: Boosting and differential privacy. In: FOCS, pp. 51\u201360. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/FOCS.2010.12","DOI":"10.1109\/FOCS.2010.12"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11681878_11","volume-title":"Theory of Cryptography","author":"S Dziembowski","year":"2006","unstructured":"Dziembowski, S.: Intrusion-resilience via the bounded-storage model. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 207\u2013224. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_11"},{"key":"2_CR20","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Pietrzak, K.: Leakage-resilient cryptography. In: FOCS 2008, pp. 293\u2013302. IEEE Computer Society (2008). https:\/\/doi.org\/10.1109\/FOCS.2008.56","DOI":"10.1109\/FOCS.2008.56"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Feldman, V.: Does learning require memorization? A short tale about a long tail. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 954\u2013959 (2020). https:\/\/doi.org\/10.1145\/3357713.3384290","DOI":"10.1145\/3357713.3384290"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"G\u00f6\u00f6s, M., Lovett, S., Meka, R., Watson, T., Zuckerman, D.: Rectangles are nonnegative juntas. In: Servedio, R.A., Rubinfeld, R. (eds.) STOC 2015, pp. 257\u2013266. ACM (2015). https:\/\/doi.org\/10.1145\/2746539.2746596","DOI":"10.1145\/2746539.2746596"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"G\u00f6\u00f6s, M., Pitassi, T., Watson, T.: Deterministic communication vs. partition number. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 1077\u20131088. IEEE (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.70","DOI":"10.1109\/FOCS.2015.70"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Hardt, M., Ullman, J.R.: Preventing false discovery in interactive data analysis is hard. In: FOCS, pp. 454\u2013463. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.55","DOI":"10.1109\/FOCS.2014.55"},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999). https:\/\/doi.org\/10.1137\/S0097539793244708","journal-title":"SIAM J. Comput."},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/s00145-015-9200-x","volume":"29","author":"C Hazay","year":"2015","unstructured":"Hazay, C., L\u00f3pez-Alt, A., Wee, H., Wichs, D.: Leakage-resilient cryptography from minimal assumptions. J. Cryptol. 29(3), 514\u2013551 (2015). https:\/\/doi.org\/10.1007\/s00145-015-9200-x","journal-title":"J. Cryptol."},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Reyzin, L.: A survey of leakage-resilient cryptography. In: Goldreich, O. (ed.) Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, pp. 727\u2013794. ACM (2019). https:\/\/doi.org\/10.1145\/3335741.3335768","DOI":"10.1145\/3335741.3335768"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Kothari, P.K., Meka, R., Raghavendra, P.: Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs. In: Hatami, H., McKenzie, P., King, V. (eds.) STOC 2017, pp. 590\u2013603. ACM (2017). https:\/\/doi.org\/10.1145\/3055399.3055438","DOI":"10.1145\/3055399.3055438"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Mironov","year":"2009","unstructured":"Mironov, I., Pandey, O., Reingold, O., Vadhan, S.P.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126\u2013142. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_8"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-642-01001-9_27","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"K Pietrzak","year":"2009","unstructured":"Pietrzak, K.: A leakage-resilient mode of operation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 462\u2013482. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_27"},{"issue":"3","key":"2_CR31","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s004930050062","volume":"19","author":"R Raz","year":"1999","unstructured":"Raz, R., McKenzie, P.: Separation of the monotone NC hierarchy. Comb. 19(3), 403\u2013435 (1999). https:\/\/doi.org\/10.1007\/s004930050062","journal-title":"Comb."},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Smith, A.D., Song, S., Thakurta, A.: The Flajolet-Martin sketch itself preserves differential privacy: private counting with minimal space. In: NeurIPS (2020). https:\/\/doi.org\/10.5555\/3495724.3497365","DOI":"10.5555\/3495724.3497365"},{"key":"2_CR33","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-14452-3_5","volume-title":"Towards Hardware-Intrinsic Security - Foundations and Practice","author":"F Standaert","year":"2010","unstructured":"Standaert, F., Pereira, O., Yu, Y., Quisquater, J., Yung, M., Oswald, E.: Leakage resilient cryptography in practice. In: Sadeghi, A., Naccache, D. (eds.) Towards Hardware-Intrinsic Security - Foundations and Practice. Information Security and Cryptography, pp. 99\u2013134. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14452-3_5"},{"key":"2_CR34","unstructured":"Steinke, T., Ullman, J.R.: Interactive fingerprinting codes and the hardness of preventing false discovery. In: COLT. JMLR Workshop and Conference Proceedings, vol. 40, pp. 1588\u20131628. JMLR.org (2015)"},{"issue":"2","key":"2_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1346330.1346335","volume":"55","author":"G Tardos","year":"2008","unstructured":"Tardos, G.: Optimal probabilistic fingerprint codes. J. ACM (JACM) 55(2), 1\u201324 (2008). https:\/\/doi.org\/10.1145\/1346330.1346335","journal-title":"J. ACM (JACM)"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Ullman, J.: Answering $$n^{2+o(1)}$$ counting queries with differential privacy is hard. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 361\u2013370 (2013). https:\/\/doi.org\/10.1145\/2488608.2488653","DOI":"10.1145\/2488608.2488653"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-74143-5_12","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D Unruh","year":"2007","unstructured":"Unruh, D.: Random oracles and auxiliary input. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 205\u2013223. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_12"},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Woodruff, D.P.: Optimal space lower bounds for all frequency moments. In: Munro, J.I. (ed.) Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, 11\u201314 January 2004, pp. 167\u2013175. SIAM (2004). https:\/\/doi.org\/10.5555\/982792.982817","DOI":"10.5555\/982792.982817"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30620-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:11Z","timestamp":1744754591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30620-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306198","9783031306204"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30620-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","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":"109","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":"26% - 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":"16","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)"}}]}}