{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:08:23Z","timestamp":1766279303633,"version":"3.48.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031223174"},{"type":"electronic","value":"9783031223181"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22318-1_21","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"588-617","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["IBE with Incompressible Master Secret and Small Identity Secrets"],"prefix":"10.1007","author":[{"given":"Nico","family":"D\u00f6ttling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjam","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sruthi","family":"Sekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-13190-5_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J Alwen","year":"2010","unstructured":"Alwen, J., Dodis, Y., Naor, M., Segev, G., Walfish, S., Wichs, D.: Public-key encryption in the bounded-retrieval model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 113\u2013134. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_6"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-03356-8_3","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"J Alwen","year":"2009","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 36\u201354. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_3"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_29"},{"key":"21_CR5","unstructured":"Braverman, M., Hassidim, A., Kalai, Y.T.: Leaky pseudo-entropy functions. In: Chazelle, B. (ed.) ICS 2011, pp. 353\u2013366. Tsinghua University Press, January 2011"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-28914-9_14","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z., Kalai, Y.T.: A parallel repetition theorem for leakage resilience. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 248\u2013265. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_14"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-662-53018-4_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Bellare","year":"2016","unstructured":"Bellare, M., Kane, D., Rogaway, P.: Big-key symmetric encryption: resisting key exfiltration. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 373\u2013402. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_14"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-64378-2_13","volume-title":"Theory of Cryptography","author":"F Benhamouda","year":"2020","unstructured":"Benhamouda, F., Lin, H.: Mr NISC: multiparty reusable non-interactive secure computation. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 349\u2013378. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_13"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-70936-7_26","volume-title":"Theory of Cryptography","author":"D Cash","year":"2007","unstructured":"Cash, D., Ding, Y.Z., Dodis, Y., Lee, W., Lipton, R., Walfish, S.: Intrusion-resilient key exchange in the bounded retrieval model. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 479\u2013498. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_26"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-63715-0_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"C Cho","year":"2017","unstructured":"Cho, C., D\u00f6ttling, N., Garg, S., Gupta, D., Miao, P., Polychroniadou, A.: Laconic oblivious transfer and its applications. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 33\u201365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_2"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Chow, S.S.M., Dodis, Y., Rouselakis, Y., Waters, B.: Practical leakage-resilient identity-based encryption from simple assumptions. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM CCS 2010, pp. 152\u2013161. ACM Press, October 2010. https:\/\/doi.org\/10.1145\/1866307.1866325","DOI":"10.1145\/1866307.1866325"},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/WCL.2012.120211.110130","volume":"1","author":"AC-F Chan","year":"2012","unstructured":"Chan, A.C.-F.: Distributed private key generation for identity based cryptosystems in ad hoc networks. IEEE Wirel. Commun. Lett. 1(1), 46\u201348 (2012). https:\/\/doi.org\/10.1109\/WCL.2012.120211.110130","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Camurati, G., Poeplau, S., Muench, M., Hayes, T., Francillon, A.: Screaming channels: when electromagnetic side channels meet radio transceivers. In: Lie, D., Mannan, M., Backes, M., Wang, X.F. (eds.) ACM CCS 2018, pp. 163\u2013177. ACM Press, October 2018. https:\/\/doi.org\/10.1145\/3243734.3243802","DOI":"10.1145\/3243734.3243802"},{"issue":"12","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1002\/sec.827","volume":"9","author":"Yu Chen","year":"2016","unstructured":"Chen, Yu., Zhang, Z., Lin, D., Cao, Z.: Generalized (identity-based) hash proof system and its applications. Secur. Commun. Netw. 9(12), 1698\u20131716 (2016)","journal-title":"Secur. Commun. Netw."},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-74143-5_20","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"IB Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Renner, R., Salvail, L., Schaffner, C.: A tight high-order entropic quantum uncertainty relation with applications. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 360\u2013378. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_20"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-319-70500-2_13","volume-title":"Theory of Cryptography","author":"N D\u00f6ttling","year":"2017","unstructured":"D\u00f6ttling, N., Garg, S.: From selective IBE to full IBE and selective HIBE. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 372\u2013408. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_13"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-319-63688-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"N D\u00f6ttling","year":"2017","unstructured":"D\u00f6ttling, N., Garg, S.: Identity-based encryption from the Diffie-Hellman assumption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 537\u2013569. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_18"},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Garg, S., Goyal, V., Malavolta, G.: Laconic conditional disclosure of secrets and applications. In: Zuckerman, D. (ed.) 60th FOCS, pp. 661\u2013685. IEEE Computer Society Press, November 2019. https:\/\/doi.org\/10.1109\/FOCS.2019.00046","DOI":"10.1109\/FOCS.2019.00046"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-76578-5_1","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"N D\u00f6ttling","year":"2018","unstructured":"D\u00f6ttling, N., Garg, S., Hajiabadi, M., Masny, D.: New constructions of identity-based and key-dependent message secure encryption schemes. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 3\u201331. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_1"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/11681878_12","volume-title":"Theory of Cryptography","author":"G Di Crescenzo","year":"2006","unstructured":"Di Crescenzo, G., Lipton, R., Walfish, S.: Perfectly secure password protocols in the bounded retrieval model. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 225\u2013244. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_12"},{"issue":"1","key":"21_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.D.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"21_CR22","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":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11818175_15","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"S Dziembowski","year":"2006","unstructured":"Dziembowski, S.: On forward-secure storage. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 251\u2013270. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_15"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-17259-6_3","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"S Garg","year":"2019","unstructured":"Garg, S., Hajiabadi, M., Mahmoody, M., Rahimi, A., Sekar, S.: Registration-based encryption from standard assumptions. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 63\u201393. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_3"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-030-03807-6_25","volume-title":"Theory of Cryptography","author":"S Garg","year":"2018","unstructured":"Garg, S., Hajiabadi, M., Mahmoody, M., Rahimi, A.: Registration-based encryption: removing private-key generator from IBE. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 689\u2013718. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_25"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-540-74143-5_24","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"V Goyal","year":"2007","unstructured":"Goyal, V.: Reducing trust in the PKG in identity based cryptosystems. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 430\u2013447. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_24"},{"issue":"4","key":"21_CR27","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)","journal-title":"SIAM J. Comput."},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-38348-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"C Hazay","year":"2013","unstructured":"Hazay, C., L\u00f3pez-Alt, A., Wee, H., Wichs, D.: Leakage-resilient cryptography from minimal assumptions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 160\u2013176. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_10"},{"key":"21_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-19571-6_5","volume-title":"Theory of Cryptography","author":"A Jain","year":"2011","unstructured":"Jain, A., Pietrzak, K.: Parallel repetition for leakage resilience amplification revisited. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 58\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_5"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-642-15317-4_27","volume-title":"Security and Cryptography for Networks","author":"A Kate","year":"2010","unstructured":"Kate, A., Goldberg, I.: Distributed private-key generators for identity-based cryptography. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 436\u2013453. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_27"},{"key":"21_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-19571-6_6","volume-title":"Theory of Cryptography","author":"A Lewko","year":"2011","unstructured":"Lewko, A., Rouselakis, Y., Waters, B.: Achieving leakage resilience through dual system encryption. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 70\u201388. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_6"},{"key":"21_CR32","doi-asserted-by":"publisher","unstructured":"Lewko, A.B., Waters, On the insecurity of parallel repetition for leakage resilience. In: 51st FOCS, pp. 521\u2013530. IEEE Computer Society Press, October 2010. https:\/\/doi.org\/10.1109\/FOCS.2010.57","DOI":"10.1109\/FOCS.2010.57"},{"key":"21_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-030-56784-2_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"T Moran","year":"2020","unstructured":"Moran, T., Wichs, D.: Incompressible Encodings. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 494\u2013523. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_17"},{"key":"21_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-030-17253-4_16","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"R Nishimaki","year":"2019","unstructured":"Nishimaki, R., Yamakawa, T.: Leakage-resilient identity-based encryption in bounded retrieval model with nearly optimal leakage-ratio. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11442, pp. 466\u2013495. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17253-4_16"}],"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-031-22318-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:24Z","timestamp":1766278944000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22318-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223174","9783031223181"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22318-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 December 2022","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":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"139","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":"60","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":"43% - 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.1","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.9","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"}]}}