{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T14:16:09Z","timestamp":1785420969269,"version":"3.56.0"},"publisher-location":"Cham","reference-count":75,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031505935","type":"print"},{"value":"9783031505942","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-50594-2_23","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"455-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Scaling Mobile Private Contact Discovery to\u00a0Billions of\u00a0Users"],"prefix":"10.1007","author":[{"given":"Laura","family":"Hetz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Weinert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: EUROCRYPT (2015)","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"23_CR2","unstructured":"Ali, A., et al.: Communication-computation trade-offs in PIR. In: USENIX Security (2021)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: S &P (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"23_CR4","unstructured":"Apple, Google: Exposure Notification Privacy-preserving Analytics (ENPA) White Paper (2021). https:\/\/covid19-static.cdn-apple.com\/applications\/covid19\/current\/static\/contact-tracing\/pdf\/ENPA_White_Paper.pdf"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer extensions with security for malicious adversaries. In: EUROCRYPT (2015)","DOI":"10.1007\/978-3-662-46800-5_26"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: CRYPTO (2000)","DOI":"10.1007\/3-540-44598-6_4"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Bloom, B.H.: Space\/Time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","DOI":"10.1145\/362686.362692"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Lightweight techniques for private heavy hitters. In: S &P (2021)","DOI":"10.1109\/SP40001.2021.00048"},{"key":"23_CR9","unstructured":"Borrello, P., Kogler, A., Schwarzl, M., Lipp, M., Gruss, D., Schwarz, M.: \u00c6PIC leak: Architecturally leaking uninitialized data from the microarchitecture. In: USENIX Security (2022)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: EUROCRYPT (2015)","DOI":"10.1145\/2976749.2978429"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: Improvements and extensions. In: CCS (2016)","DOI":"10.1145\/2976749.2978429"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Bui, D., Couteau, G.: Improved private set intersection for sets with small entries. In: PKC (2023)","DOI":"10.1007\/978-3-031-31371-4_7"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled PSI from fully homomorphic encryption with malicious security. In: CCS (2018)","DOI":"10.1145\/3243734.3243836"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: CCS (2017)","DOI":"10.1145\/3133956.3134061"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Cong, K., et al.: Labeled PSI from homomorphic encryption with reduced computation and communication. In: CCS (2021)","DOI":"10.1145\/3460120.3484760"},{"key":"23_CR16","unstructured":"Corrigan-Gibbs, H., Boneh, D.: Prio: private, robust, and scalable computation of aggregate statistics. In: NSDI (2017)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Henzinger, A., Kogan, D.: Single-server private information retrieval with sublinear amortized time. In: EUROCRYPT (2022)","DOI":"10.1007\/978-3-031-07085-3_1"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Kogan, D.: Private information retrieval with sublinear online time. In: EUROCRYPT (2020)","DOI":"10.1007\/978-3-030-45721-1_3"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Cristofaro, E.D., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: CANS (2012)","DOI":"10.1007\/978-3-642-35404-5_17"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Cristofaro, E.D., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: FC (2010)","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Cui, J., Yu, J.Z., Shinde, S., Saxena, P., Cai, Z.: SmashEx: smashing SGX enclaves using exceptions. In: CCS (2021)","DOI":"10.1145\/3460120.3484821"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Davidson, A., Pestana, G., Celi, S.: FrodoPIR: simple, scalable, single-server private information retrieval. PETS (2023)","DOI":"10.56553\/popets-2023-0022"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Demmler, D., Rindal, P., Rosulek, M., Trieu, N.: PIR-PSI: scaling private contact discovery. PETS (2018)","DOI":"10.1515\/popets-2018-0037"},{"key":"23_CR24","unstructured":"Eppstein, D.: Cuckoo filter: simplification and analysis. In: SWAT (2016)"},{"key":"23_CR25","unstructured":"Facebook, Inc. (FB): First Quarter 2020 Results Conference Call (2020). https:\/\/s21.q4cdn.com\/399680738\/files\/doc_financials\/2020\/q1\/Q1\u201920-FB-Earnings-Call-Transcript.pdf"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.: Cuckoo filter: practically better than bloom. In: CoNEXT (2014)","DOI":"10.1145\/2674005.2674994"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: TCC (2005)","DOI":"10.1007\/978-3-540-30576-7_17"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Garimella, G., Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Oblivious key-value stores and amplification for private set intersection. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"23_CR29","unstructured":"Ghosh, S.: Facebook probably has your phone number, even if you never shared it. Now it has a secret tool to let you delete it (2022). https:\/\/www.businessinsider.com\/facebook-has-hidden-tool-to-delete-your-phone-number-email-2022-10"},{"key":"23_CR30","unstructured":"Gong, T., Henry, R., Psomas, A., Kate, A.: More is merrier in collusion mitigation (2022). CoRR arXiv:2305.08846"},{"key":"23_CR31","unstructured":"G\u00fcnther, D., Heymann, M., Pinkas, B., Schneider, T.: GPU-accelerated PIR with client-independent preprocessing for large-scale applications. In: USENIX Security (2022)"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Hagen, C., Weinert, C., Sendner, C., Dmitrienko, A., Schneider, T.: All the numbers are US: large-scale abuse of contact discovery in mobile messengers. In: NDSS (2021)","DOI":"10.14722\/ndss.2021.23159"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Hagen, C., Weinert, C., Sendner, C., Dmitrienko, A., Schneider, T.: Contact discovery in mobile messengers: Low-cost attacks, quantitative analyses, and efficient mitigations. TOPS (2023)","DOI":"10.1145\/3546191"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. J. Cryptol. 23, 422\u2013456 (2010)","DOI":"10.1007\/s00145-008-9034-x"},{"key":"23_CR35","unstructured":"Heinrich, A., Hollick, M., Schneider, T., Stute, M., Weinert, C.: PrivateDrop: Practical privacy-preserving authentication for Apple AirDrop. In: USENIX Security (2021)"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Henry, R.: Polynomial batch codes for efficient IT-PIR. PETS (2016)","DOI":"10.1515\/popets-2016-0036"},{"key":"23_CR37","unstructured":"Henzinger, A., Hong, M.M., Corrigan-Gibbs, H., Meiklejohn, S., Vaikuntanathan, V.: One server for the price of two: Simple and fast single-server private information retrieval. In: USENIX Security (2023)"},{"key":"23_CR38","unstructured":"Hombashi, T.: Tcconfig (2022). https:\/\/github.com\/thombashi\/tcconfig"},{"key":"23_CR39","unstructured":"Internet Security Research Group: ISRG Prio Services for Preserving Privacy in COVID-19 EN Apps (2021). https:\/\/divviup.org\/blog\/prio-services-for-covid-en\/"},{"key":"23_CR40","unstructured":"Internet Security Research Group: Divvi Up (2023). https:\/\/divviup.org\/"},{"key":"23_CR41","doi-asserted-by":"crossref","unstructured":"Ion, M., et al.: On deploying secure computing: Private intersection-sum-with-cardinality. In: EuroS &P (2020)","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"23_CR42","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: STOC (2004)","DOI":"10.1145\/1007352.1007396"},{"key":"23_CR43","unstructured":"Kales, D., Rechberger, C., Schneider, T., Senker, M., Weinert, C.: Mobile private contact discovery at scale. In: USENIX Security (2019)"},{"key":"23_CR44","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: Actively secure OT extension with optimal overhead. In: CRYPTO (2015)","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"23_CR45","doi-asserted-by":"crossref","unstructured":"Kiss, \u00c1., Liu, J., Schneider, T., Asokan, N., Pinkas, B.: Private set intersection for unequal set sizes with mobile applications. PETS (2017)","DOI":"10.1515\/popets-2017-0044"},{"key":"23_CR46","unstructured":"Kogan, D., Corrigan-Gibbs, H.: Private blocklist lookups with checklist. In: USENIX Security (2021)"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: CCS (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"23_CR48","unstructured":"Lazzaretti, A., Papamanthou, C.: Single server PIR with sublinear amortized time and polylogarithmic bandwidth. ePrint 2022\/081 (2022)"},{"key":"23_CR49","doi-asserted-by":"crossref","unstructured":"Li, L., Pal, B., Ali, J., Sullivan, N., Chatterjee, R., Ristenpart, T.: Protocols for checking compromised credentials. In: SIGSAC (2019)","DOI":"10.1145\/3319535.3354229"},{"key":"23_CR50","unstructured":"Liu, J., Li, J., Wu, D., Ren, K.: PIRANA: Faster multi-query PIR via constant-weight codes (2022). ePrint 2022\/1401"},{"key":"23_CR51","unstructured":"Ma, Y., Zhong, K., Rabin, T., Angel, S.: Incremental Offline\/Online PIR. In: USENIX Security (2022)"},{"key":"23_CR52","doi-asserted-by":"crossref","unstructured":"Meadows, C.A.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: S &P (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"23_CR53","doi-asserted-by":"crossref","unstructured":"Menon, S.J., Wu, D.J.: SPIRAL: fast, high-rate single-server PIR via FHE composition. In: S &P (2022)","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"23_CR54","doi-asserted-by":"crossref","unstructured":"Mughees, M.H., Chen, H., Ren, L.: OnionPIR: response efficient single-server PIR. In: CCS (2021)","DOI":"10.1145\/3460120.3485381"},{"key":"23_CR55","doi-asserted-by":"crossref","unstructured":"Mughees, M.H., Ren, L.: Vectorized batch private information retrieval. S &P (2023)","DOI":"10.1109\/SP46215.2023.10179329"},{"key":"23_CR56","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. Journal of ACM 51(2), 231\u2013262 (2004)","DOI":"10.1145\/972639.972643"},{"key":"23_CR57","doi-asserted-by":"crossref","unstructured":"Nevo, O., Trieu, N., Yanai, A.: Simple, fast malicious multiparty private set intersection. In: CCS (2021)","DOI":"10.1145\/3460120.3484772"},{"key":"23_CR58","unstructured":"Olson, P.: Facebook Closes \\$19 Billion WhatsApp Deal (2014). https:\/\/www.forbes.com\/sites\/parmyolson\/2014\/10\/06\/facebook-closes-19-billion-whatsapp-deal\/"},{"key":"23_CR59","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: CRYPTO (2008)"},{"key":"23_CR60","unstructured":"Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: Private set intersection using permutation-based hashing. In: USENIX Security (2015)"},{"key":"23_CR61","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Smart, N.P., Williams, S.C.: Secure two-party computation is practical. In: AC (2009)","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"23_CR62","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on OT extension. TOPS (2018)","DOI":"10.1145\/3154794"},{"key":"23_CR63","doi-asserted-by":"crossref","unstructured":"Raab, M., Steger, A.: \u201cBalls into Bins\u201d - A simple and tight analysis. In: RANDOM (1998)","DOI":"10.1007\/3-540-49543-6_13"},{"key":"23_CR64","doi-asserted-by":"crossref","unstructured":"Ragab, H., Milburn, A., Razavi, K., Bos, H., Giuffrida, C.: CrossTalk: Speculative data leaks across cores are real. In: S &P (2021)","DOI":"10.1109\/SP40001.2021.00020"},{"key":"23_CR65","doi-asserted-by":"crossref","unstructured":"Raghuraman, S., Rindal, P.: Blazing fast PSI from improved OKVS and subfield VOLE. In: CCS (2022)","DOI":"10.1145\/3548606.3560658"},{"key":"23_CR66","doi-asserted-by":"crossref","unstructured":"Resende, A.C.D., Aranha, D.F.: Faster unbalanced private set intersection. In: FC (2018)","DOI":"10.1007\/978-3-662-58387-6_11"},{"key":"23_CR67","doi-asserted-by":"crossref","unstructured":"Rindal, P., Schoppmann, P.: VOLE-PSI: Fast OPRF and circuit-PSI from vector-OLE. In: EUROCRYPT (2021)","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"23_CR68","doi-asserted-by":"crossref","unstructured":"Shi, E., Aqeel, W., Chandrasekaran, B., Maggs, B.M.: Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84259-8_22"},{"key":"23_CR69","unstructured":"Thomas, K., et al.: Protecting accounts from credential stuffing with password breach alerting. In: USENIX Security (2019)"},{"key":"23_CR70","unstructured":"Trieu, N., Shehata, K., Saxena, P., Shokri, R., Song, D.: Epione: lightweight contact tracing with strong privacy. IEEE Data Eng. Bull. 43(2), 95\u2013107 (2020)"},{"key":"23_CR71","unstructured":"Troy Hunt: Have I Been Pwned: Check if your email has been compromised in a data breach (2023). https:\/\/haveibeenpwned.com\/"},{"key":"23_CR72","doi-asserted-by":"crossref","unstructured":"van Schaik, S., Minkin, M., Kwong, A., Genkin, D., Yarom, Y.: CacheOut: leaking data on intel CPUs via cache evictions. In: S &P (2021)","DOI":"10.1109\/SP40001.2021.00064"},{"key":"23_CR73","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"23_CR74","doi-asserted-by":"crossref","unstructured":"Yeo, K.: Lower bounds for (batch) PIR with private preprocessing. In: EUROCRYPT (2023)","DOI":"10.1007\/978-3-031-30545-0_18"},{"key":"23_CR75","doi-asserted-by":"crossref","unstructured":"Zhou, M., Lin, W.K., Tselekounis, Y., Shi, E.: Optimal single-server private information retrieval. In: EUROCRYPT (2023)","DOI":"10.1007\/978-3-031-30545-0_14"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50594-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:10:36Z","timestamp":1704964236000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50594-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031505935","9783031505942"],"references-count":75,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50594-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Hague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"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":"478","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":"93","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":"19% - 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-4","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":"10","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}