{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:52:09Z","timestamp":1757631129132,"version":"3.44.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589509"},{"type":"electronic","value":"9783030589516"}],"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-58951-6_33","type":"book-chapter","created":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T09:07:40Z","timestamp":1599815260000},"page":"677-697","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Where Are You Bob? Privacy-Preserving Proximity Testing with a Napping Party"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Oleynikov","sequence":"first","affiliation":[]},{"given":"Elena","family":"Pagnin","sequence":"additional","affiliation":[]},{"given":"Andrei","family":"Sabelfeld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,12]]},"reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-30530-7_14","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2019","author":"DF Aranha","year":"2019","unstructured":"Aranha, D.F., Pagnin, E.: The simplest multi-key linearly homomorphic signature scheme. In: Schwabe, P., Th\u00e9riault, N. (eds.) LATINCRYPT 2019. LNCS, vol. 11774, pp. 280\u2013300. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_14"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-662-44381-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"A Beimel","year":"2014","unstructured":"Beimel, A., Gabizon, A., Ishai, Y., Kushilevitz, E., Meldgaard, S., Paskin-Cherniavsky, A.: Non-interactive secure multiparty computation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 387\u2013404. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_22"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-319-63688-7_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"F Benhamouda","year":"2017","unstructured":"Benhamouda, F., Krawczyk, H., Rabin, T.: Robust non-interactive multiparty computation against constant-size collusion. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 391\u2013419. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_13"},{"key":"33_CR4","unstructured":"BlaBlaCar - Trusted carpooling. https:\/\/www.blablacar.com\/"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-20465-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Freeman, D.M.: Homomorphic signatures for polynomial functions. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 149\u2013168. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_10"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15317-4_13","volume-title":"Security and Cryptography for Networks","author":"O Catrina","year":"2010","unstructured":"Catrina, O., de Hoogh, S.: Improved primitives for secure multiparty integer computation. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 182\u2013199. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_13"},{"key":"33_CR7","unstructured":"ChangLiu: Ecc-pycrypto Library (2019). https:\/\/github.com\/lc6chang\/ecc-pycrypto. Accessed 14 Apr 2020"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-93387-0_16","volume-title":"Applied Cryptography and Network Security","author":"G Couteau","year":"2018","unstructured":"Couteau, G.: New protocols for secure equality test and comparison. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 303\u2013320. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_16"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Cu\u00e9llar, J., Ochoa, M., Rios, R.: Indistinguishable regions in geographic privacy. In: SAC, pp. 1463\u20131469 (2012)","DOI":"10.1145\/2245276.2232010"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-662-53890-6_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Fiore","year":"2016","unstructured":"Fiore, D., Mitrokotsa, A., Nizzardo, L., Pagnin, E.: Multi-key homomorphic authenticators. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 499\u2013530. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_17"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Freni, D., Vicente, C.R., Mascetti, S., Bettini, C., Jensen, C.S.: Preserving location and absence privacy in geo-social networks. In: CIKM, pp. 309\u2013318 (2010)","DOI":"10.1145\/1871437.1871480"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-540-71677-8_22","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"J Garay","year":"2007","unstructured":"Garay, J., Schoenmakers, B., Villegas, J.: Practical and secure solutions for integer comparison. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 330\u2013342. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_22"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-14623-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C Gentry","year":"2010","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: i-hop homomorphic encryption and rerandomizable Yao circuits. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 155\u2013172. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_9"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: STOC, pp. 469\u2013477. ACM (2015)","DOI":"10.1145\/2746539.2746576"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-642-38348-9_34","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"SD Gordon","year":"2013","unstructured":"Gordon, S.D., Malkin, T., Rosulek, M., Wee, H.: Multi-party computation of polynomials and branching programs without simultaneous interaction. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 575\u2013591. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_34"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-70700-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"S Halevi","year":"2017","unstructured":"Halevi, S., Ishai, Y., Jain, A., Komargodski, I., Sahai, A., Yogev, E.: Non-interactive multiparty computation without correlated randomness. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 181\u2013211. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_7"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-22792-9_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S Halevi","year":"2011","unstructured":"Halevi, S., Lindell, Y., Pinkas, B.: Secure computation on the web: computing without simultaneous interaction. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 132\u2013150. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_8"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Hallgren, P., Orlandi, C., Sabelfeld, A.: PrivatePool: privacy-preserving ridesharing. In: CSF, pp. 276\u2013291 (2017)","DOI":"10.1109\/CSF.2017.24"},{"key":"33_CR19","unstructured":"Hallgren, P.: BetterTimes Python Library (2017). https:\/\/bitbucket.org\/hallgrep\/bettertimes\/. Accessed 22 Jan 2020"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Hallgren, P.A., Ochoa, M., Sabelfeld, A.: InnerCircle: a parallelizable decentralized privacy-preserving location proximity protocol. In: PST, pp. 1\u20136 (2015)","DOI":"10.1109\/PST.2015.7232947"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Hallgren, P.A., Ochoa, M., Sabelfeld, A.: MaxPace: speed-constrained location queries. In: CNS (2016)","DOI":"10.1109\/CNS.2016.7860479"},{"key":"33_CR22","unstructured":"Hern, A.: Uber employees \u2018spied on ex-partners, politicians and Beyonc\u00e9\u2019 (2016). https:\/\/www.theguardian.com\/technology\/2016\/dec\/13\/uber-employees-spying-ex-partners-politicians-beyonce"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Jarrous, A., Pinkas, B.: Canon-MPC, a system for casual non-interactive secure multi-party computation using native client. In: Sadeghi, A., Foresti, S. (eds.) WPES, pp. 155\u2013166. ACM (2013)","DOI":"10.1145\/2517840.2517845"},{"key":"33_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-00434-7_1","volume-title":"Cryptology and Network Security","author":"K J\u00e4rvinen","year":"2018","unstructured":"J\u00e4rvinen, K., Kiss, \u00c1., Schneider, T., Tkachenko, O., Yang, Z.: Faster privacy-preserving location proximity schemes. In: Camenisch, J., Papadimitratos, P. (eds.) CANS 2018. LNCS, vol. 11124, pp. 3\u201322. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00434-7_1"},{"key":"33_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-10433-6_1","volume-title":"Cryptology and Network Security","author":"V Kolesnikov","year":"2009","unstructured":"Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: Improved garbled circuit building blocks and applications to auctions and computing minima. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 1\u201320. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10433-6_1"},{"key":"33_CR26","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.comcom.2015.07.017","volume":"73","author":"P Kotzanikolaou","year":"2016","unstructured":"Kotzanikolaou, P., Patsakis, C., Magkos, E., Korakakis, M.: Lightweight private proximity testing for geospatial social networks. Comput. Commun. 73, 263\u2013270 (2016)","journal-title":"Comput. Commun."},{"key":"33_CR27","unstructured":"Lee, D.: Uber concealed huge data breach (2017). http:\/\/www.bbc.com\/news\/technology-42075306"},{"key":"33_CR28","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-57048-8_6","volume-title":"Tutorials on the Foundations of Cryptography","author":"Y Lindell","year":"2017","unstructured":"Lindell, Y.: How to simulate it \u2013 a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography. ISC, pp. 277\u2013346. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57048-8_6"},{"issue":"4","key":"33_CR29","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s00778-010-0213-7","volume":"20","author":"S Mascetti","year":"2011","unstructured":"Mascetti, S., Freni, D., Bettini, C., Wang, X.S., Jajodia, S.: Privacy in geo-social networks: proximity notification with untrusted service providers and curious buddies. VLDB J. 20(4), 541\u2013566 (2011)","journal-title":"VLDB J."},{"key":"33_CR30","unstructured":"Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.: Location privacy via private proximity testing. In: NDSS (2011)"},{"key":"33_CR31","doi-asserted-by":"crossref","unstructured":"Nielsen, J.D., Pagter, J.I., Stausholm, M.B.: Location privacy via actively secure private proximity testing. In: PerCom Workshops, pp. 381\u2013386. IEEE CS (2012)","DOI":"10.1109\/PerComW.2012.6197514"},{"key":"33_CR32","doi-asserted-by":"crossref","unstructured":"Oleynikov, I., Pagnin, E., Sabelfeld, A.: Where are you Bob? Privacy-preserving proximity testing with a napping party (2020). https:\/\/www.cse.chalmers.se\/research\/group\/security\/olic\/","DOI":"10.1007\/978-3-030-58951-6_33"},{"issue":"4","key":"33_CR33","doi-asserted-by":"crossref","first-page":"93","DOI":"10.2478\/popets-2019-0060","volume":"2019","author":"E Pagnin","year":"2019","unstructured":"Pagnin, E., Gunnarsson, G., Talebi, P., Orlandi, C., Sabelfeld, A.: TOPPool: time-aware optimized privacy-preserving ridesharing. PoPETs 2019(4), 93\u2013111 (2019)","journal-title":"PoPETs"},{"key":"33_CR34","doi-asserted-by":"crossref","unstructured":"Polakis, I., Argyros, G., Petsios, T., Sivakorn, S., Keromytis, A.D.: Where\u2019s wally?: Precise user discovery attacks in location proximity services. In: CCS (2015)","DOI":"10.1145\/2810103.2813605"},{"key":"33_CR35","doi-asserted-by":"crossref","unstructured":"Sakib, M.N., Huang, C.: Privacy preserving proximity testing using elliptic curves. In: ITNAC, pp. 121\u2013126. IEEE Computer Society (2016)","DOI":"10.1109\/ATNAC.2016.7878794"},{"key":"33_CR36","doi-asserted-by":"crossref","unstructured":"Saldamli, G., Chow, R., Jin, H., Knijnenburg, B.P.: Private proximity testing with an untrusted server. In: WISEC. pp. 113\u2013118. ACM (2013)","DOI":"10.1145\/2462096.2462115"},{"key":"33_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-030-12612-4_25","volume-title":"Topics in Cryptology \u2013 CT-RSA 2019","author":"L Schabh\u00fcser","year":"2019","unstructured":"Schabh\u00fcser, L., Butin, D., Buchmann, J.: Context hiding multi-key linearly homomorphic authenticators. In: Matsui, M. (ed.) CT-RSA 2019. LNCS, vol. 11405, pp. 493\u2013513. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12612-4_25"},{"key":"33_CR38","doi-asserted-by":"crossref","unstructured":"Sedenka, J., Gasti, P.: Privacy-preserving distance computation and proximity testing on earth, done right. In: AsiaCCS, pp. 99\u2013110 (2014)","DOI":"10.1145\/2590296.2590307"},{"key":"33_CR39","unstructured":"Sharemind MPC Platform. https:\/\/sharemind.cyber.ee\/sharemind-mpc\/multi-party-computation\/"},{"key":"33_CR40","unstructured":"Shu, C.: Uber reportedly tracked Lyft drivers using a secret software program named \u2018Hell\u2019 (2017). https:\/\/techcrunch.com\/2017\/04\/12\/hell-o-uber\/"},{"key":"33_CR41","doi-asserted-by":"crossref","unstructured":"Siksnys, L., Thomsen, J.R., Saltenis, S., Yiu, M.L.: Private and flexible proximity detection in mobile social networks. In: MDM, pp. 75\u201384 (2010)","DOI":"10.1109\/MDM.2010.43"},{"key":"33_CR42","doi-asserted-by":"crossref","unstructured":"Siksnys, L., Thomsen, J.R., Saltenis, S., Yiu, M.L., Andersen, O.: A location privacy aware friend locator. In: SSTD, pp. 405\u2013410 (2009)","DOI":"10.1007\/978-3-642-02982-0_29"},{"key":"33_CR43","unstructured":"Veytsman, M.: How I was able to track the location of any tinder user (2014). http:\/\/blog.includesecurity.com\/"},{"key":"33_CR44","doi-asserted-by":"crossref","unstructured":"Zhong, G., Goldberg, I., Hengartner, U.: Louis, Lester and Pierre: three protocols for location privacy. In: PET, pp. 62\u201376 (2007)","DOI":"10.1007\/978-3-540-75551-7_5"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58951-6_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:02:54Z","timestamp":1757541774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58951-6_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589509","9783030589516"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58951-6_33","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":"12 September 2020","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":"Guildford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/esorics2020.sccs.surrey.ac.uk\/","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":"366","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":"72","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":"20% - 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,16","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":"9,1","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 held virtually due to the COVID-10 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)"}}]}}