{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,5]],"date-time":"2026-11-05T20:08:12Z","timestamp":1793909292542,"version":"4.8.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147906","type":"print"},{"value":"9783031147913","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-14791-3_25","type":"book-chapter","created":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T23:03:28Z","timestamp":1662332608000},"page":"564-587","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Streaming and\u00a0Unbalanced PSI from\u00a0Function Secret Sharing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0018-6354","authenticated-orcid":false,"given":"Samuel","family":"Dittmer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1837-8864","authenticated-orcid":false,"given":"Steve","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1501-1330","authenticated-orcid":false,"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Elsabagh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolaos","family":"Kiourtis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3364-9872","authenticated-orcid":false,"given":"Brian","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9888-0592","authenticated-orcid":false,"given":"Angelos","family":"Stavrou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,5]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: Proceedings of the 2018 IEEE Symposium on Security and Privacy, SP 2018, 21\u201323 May 2018, San Francisco, California, USA, pp. 962\u2013979. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/SP.2018.00062","DOI":"10.1109\/SP.2018.00062"},{"key":"25_CR2","unstructured":"Angelou, N.: Asymmetric private set intersection with applications to contact tracing and private vertical federated machine learning. CoRR abs\/2011.09350 (2020). https:\/\/arxiv.org\/abs\/2011.09350"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pp. 593\u2013602 (1994)","DOI":"10.1145\/195058.195412"},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"378","DOI":"10.2478\/popets-2022-0051","volume":"2022","author":"S Badrinarayanan","year":"2022","unstructured":"Badrinarayanan, S., Miao, P., Xie, T.: Updatable private set intersection. Proc. Priv. Enhanc. Technol. 2022(2), 378\u2013406 (2022). https:\/\/doi.org\/10.2478\/popets-2022-0051","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"25_CR5","doi-asserted-by":"publisher","unstructured":"Baldi, P., Baronio, R., Cristofaro, E.D., Gasti, P., Tsudik, G.: Countering GATTACA: efficient and secure testing of fully-sequenced human genomes. In: Chen, Y., Danezis, G., Shmatikov, V. (eds.) Proceedings of the 18th ACM Conference on Computer and Communications Security, CCS 2011, Chicago, Illinois, USA, 17\u201321 October 2011, pp. 691\u2013702. ACM (2011). https:\/\/doi.org\/10.1145\/2046707.2046785","DOI":"10.1145\/2046707.2046785"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Lightweight techniques for private heavy hitters. IACR Cryptol. ePrint Arch. 2021, 17 (2021). Conference version: IEEE S &P 2021","DOI":"10.1109\/SP40001.2021.00048"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: CCS 2018, pp. 896\u2013912 (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 1292\u20131303. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"issue":"5","key":"25_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6377(94)90082-5","volume":"15","author":"H Bruneel","year":"1994","unstructured":"Bruneel, H., Wuyts, I.: Analysis of discrete-time multiserver queueing models with constant service times. Oper. Res. Lett. 15(5), 231\u2013236 (1994)","journal-title":"Oper. Res. Lett."},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-031-06944-4_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2022","author":"L de Castro","year":"2022","unstructured":"de Castro, L., Polychroniadou, A.: Lightweight, maliciously secure verifiable function secret sharing. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13275, pp. 150\u2013179. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_6"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled PSI from fully homomorphic encryption with malicious security. In: ACM CCS 2018, pp. 1223\u20131237 (2018)","DOI":"10.1145\/3243734.3243836"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: ACM CCS 2017, pp. 1243\u20131255 (2017)","DOI":"10.1145\/3133956.3134061"},{"key":"25_CR14","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords. IACR Cryptol. ePrint Arch. 1998, 3 (1998). http:\/\/eprint.iacr.org\/1998\/003"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Boneh, D., Mazi\u00e8res, D.: Riposte: an anonymous messaging system handling millions of users. In: 2015 IEEE Symposium on Security and Privacy, SP 2015, pp. 321\u2013338 (2015)","DOI":"10.1109\/SP.2015.27"},{"key":"25_CR16","unstructured":"Dauterman, E., Feng, E., Luo, E., Popa, R.A., Stoica, I.: Dory: an encrypted search system with distributed trust. Cryptology ePrint Archive, Report 2020\/1280 (2020). https:\/\/eprint.iacr.org\/2020\/1280"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-35404-5_17","volume-title":"Cryptology and Network Security","author":"E De Cristofaro","year":"2012","unstructured":"De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: Pieprzyk, J., Sadeghi, A.-R., Manulis, M. (eds.) CANS 2012. LNCS, vol. 7712, pp. 218\u2013231. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35404-5_17"},{"issue":"2","key":"25_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.3934\/amc.2020071","volume":"15","author":"SK Debnath","year":"2021","unstructured":"Debnath, S.K., Stanica, P., Kundu, N., Choudhury, T.: Secure and efficient multiparty private set intersection cardinality. Adv. Math. Commun. 15(2), 365\u2013386 (2021)","journal-title":"Adv. Math. Commun."},{"issue":"4","key":"25_CR19","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1515\/popets-2018-0037","volume":"2018","author":"D Demmler","year":"2018","unstructured":"Demmler, D., Rindal, P., Rosulek, M., Trieu, N.: PIR-PSI: scaling private contact discovery. Proc. Priv. Enhanc. Technol. 2018(4), 159\u2013178 (2018). https:\/\/doi.org\/10.1515\/popets-2018-0037","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Dittmer, S., et al.: Authenticated garbling from simple correlations. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-15985-5_3"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1007\/978-3-030-64840-4_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"T Duong","year":"2020","unstructured":"Duong, T., Phan, D.H., Trieu, N.: Catalic: delegated PSI cardinality with applications to contact tracing. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 870\u2013899. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_29"},{"issue":"2","key":"25_CR22","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.spl.2007.05.011","volume":"78","author":"B Eisenberg","year":"2008","unstructured":"Eisenberg, B.: On the expectation of the maximum of IID geometric random variables. Stat. Probab. Lett. 78(2), 135\u2013143 (2008)","journal-title":"Stat. Probab. Lett."},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"MJ Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-030-17659-4_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Ghosh","year":"2019","unstructured":"Ghosh, S., Nilges, T.: An algebraic approach to maliciously secure private set intersection. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 154\u2013185. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_6"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-55220-5_35","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"N Gilboa","year":"2014","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 640\u2013658. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35"},{"key":"25_CR26","unstructured":"Ion, M., et al.: Private intersection-sum protocol with applications to attributing aggregate ad conversions. IACR Cryptol. ePrint Arch. 2017, 738 (2017). http:\/\/eprint.iacr.org\/2017\/738"},{"key":"25_CR27","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: Babai, L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13\u201316 June 2004, pp. 262\u2013271. ACM (2004). https:\/\/doi.org\/10.1145\/1007352.1007396","DOI":"10.1145\/1007352.1007396"},{"issue":"2\u20133","key":"25_CR28","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s11134-005-0402-z","volume":"50","author":"AJ Janssen","year":"2005","unstructured":"Janssen, A.J., Van Leeuwaarden, J.: Analytic computation schemes for the discrete-time bulk service queue. Queueing Syst. 50(2\u20133), 141\u2013163 (2005)","journal-title":"Queueing Syst."},{"issue":"4","key":"25_CR29","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1515\/popets-2017-0044","volume":"2017","author":"\u00c1 Kiss","year":"2017","unstructured":"Kiss, \u00c1., Liu, J., Schneider, T., Asokan, N., Pinkas, B.: Private set intersection for unequal set sizes with mobile applications. Proc. Priv. Enhanc. Technol. 2017(4), 177\u2013197 (2017). https:\/\/doi.org\/10.1515\/popets-2017-0044","journal-title":"Proc. Priv. Enhanc. Technol."},{"key":"25_CR30","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 818\u2013829. ACM (2016). https:\/\/doi.org\/10.1145\/2976749.2978381","DOI":"10.1145\/2976749.2978381"},{"issue":"3","key":"25_CR31","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/opre.9.3.383","volume":"9","author":"JD Little","year":"1961","unstructured":"Little, J.D.: A proof for the queuing formula: L= $$\\lambda $$ w. Oper. Res. 9(3), 383\u2013387 (1961)","journal-title":"Oper. Res."},{"key":"25_CR32","unstructured":"Ma, Y., Zhong, K., Rabin, T., Angel, S.: Incremental offline\/online PIR (extended version). IACR Cryptol. ePrint Arch., p.\u00a01438 (2021). https:\/\/eprint.iacr.org\/2021\/1438"},{"key":"25_CR33","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: Proceedings of the 1986 IEEE Symposium on Security and Privacy, pp. 134\u2013137 (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"25_CR34","doi-asserted-by":"crossref","unstructured":"Menon, S.J., Wu, D.J.: Spiral: fast, high-rate single-server PIR via FHE composition. IACR Cryptol. ePrint Arch., p.\u00a0368 (2022). https:\/\/eprint.iacr.org\/2022\/368","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"25_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-26954-8_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"B Pinkas","year":"2019","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: SpOT-Light: lightweight private set intersection from sparse OT extension. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 401\u2013431. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_13"},{"key":"25_CR36","doi-asserted-by":"publisher","unstructured":"Resende, A.C.D., de\u00a0Freitas\u00a0Aranha, D.: Faster unbalanced private set intersection in the semi-honest setting. J. Cryptogr. Eng. 11(1), 21\u201338 (2021). https:\/\/doi.org\/10.1007\/s13389-020-00242-7","DOI":"10.1007\/s13389-020-00242-7"},{"key":"25_CR37","doi-asserted-by":"publisher","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: improved constructions and implementation. In: ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 1055\u20131072. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3363228","DOI":"10.1145\/3319535.3363228"},{"key":"25_CR38","doi-asserted-by":"crossref","unstructured":"Stewart, C.A., et al.: Jetstream: a self-provisioned, scalable science and engineering cloud environment. In: Proceedings of the 2015 XSEDE Conference: Scientific Advancements Enabled by Enhanced Cyberinfrastructure, pp. 1\u20138 (2015)","DOI":"10.1145\/2792745.2792774"},{"issue":"5","key":"25_CR39","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/MCSE.2014.80","volume":"16","author":"J Towns","year":"2014","unstructured":"Towns, J., et al.: XSEDE: accelerating scientific discovery. Comput. Sci. Eng. 16(5), 62\u201374 (2014). https:\/\/doi.org\/10.1109\/MCSE.2014.80","journal-title":"Comput. Sci. Eng."},{"key":"25_CR40","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). http:\/\/sites.computer.org\/debull\/A20june\/p95.pdf"},{"key":"25_CR41","unstructured":"Wang, F., Yun, C., Goldwasser, S., Vaikuntanathan, V., Zaharia, M.: Splinter: practical private queries on public data. In: NSDI 2017 (2017)"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14791-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T05:53:43Z","timestamp":1727934823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14791-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147906","9783031147913"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14791-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"5 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi (SA)","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it\/scn22\/","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":"101","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":"33","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":"33% - 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":"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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 abstracts of invited talks (not peer-reviewed) are included.","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)"}}]}}