{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:09:54Z","timestamp":1775326194679,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030453732","type":"print"},{"value":"9783030453749","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45374-9_11","type":"book-chapter","created":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T23:05:47Z","timestamp":1588115147000},"page":"309-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Public-Key Puncturable Encryption: Modular and Compact Constructions"],"prefix":"10.1007","author":[{"given":"Shi-Feng","family":"Sun","sequence":"first","affiliation":[]},{"given":"Amin","family":"Sakzad","sequence":"additional","affiliation":[]},{"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[]},{"given":"Joseph K.","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,29]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-030-17653-2_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"N Attrapadung","year":"2019","unstructured":"Attrapadung, N.: Unbounded dynamic predicate compositions in attribute-based encryption. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part I. LNCS, vol. 11476, pp. 34\u201367. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_2"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-319-44618-9_3","volume-title":"Security and Cryptography for Networks","author":"N Attrapadung","year":"2016","unstructured":"Attrapadung, N., Hanaoka, G., Ogawa, K., Ohtake, G., Watanabe, H., Yamada, S.: Attribute-based encryption for range attributes. In: Zikas, V., De Prisco, R. (eds.) SCN 2016. LNCS, vol. 9841, pp. 42\u201361. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44618-9_3"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-642-13013-7_23","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"N Attrapadung","year":"2010","unstructured":"Attrapadung, N., Libert, B.: Functional encryption for inner product: achieving constant-size ciphertexts with adaptive security or support for negation. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 384\u2013402. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_23"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-19379-8_6","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"N Attrapadung","year":"2011","unstructured":"Attrapadung, N., Libert, B., de Panafieu, E.: Expressive key-policy attribute-based encryption with constant-size ciphertexts. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 90\u2013108. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_6"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-25385-0_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"M Bellare","year":"2011","unstructured":"Bellare, M., Cash, D., Miller, R.: Cryptography secure against related-key attacks and tampering. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 486\u2013503. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_26"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-34961-4_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"M Bellare","year":"2012","unstructured":"Bellare, M., Paterson, K.G., Thomson, S.: RKA security beyond the linear barrier: IBE, encryption and signatures. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 331\u2013348. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_21"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: 2007 IEEE Symposium on Security and Privacy (S&P 2007), 20\u201323 May 2007, Oakland, California, USA, pp. 321\u2013334 (2007)","DOI":"10.1109\/SP.2007.11"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-662-44371-2_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"O Blazy","year":"2014","unstructured":"Blazy, O., Kiltz, E., Pan, J.: (Hierarchical) identity-based encryption from affine message authentication. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 408\u2013425. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_23"},{"key":"11_CR9","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":"11_CR10","doi-asserted-by":"crossref","unstructured":"Bost, R., Minaud, B., Ohrimenko, O.: Forward and backward private searchable encryption from constrained cryptographic primitives. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, 30 October\u201303 November 2017, pp. 1465\u20131482 (2017)","DOI":"10.1145\/3133956.3133980"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-39200-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 255\u2013271. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_16"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-662-54388-7_8","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"R Canetti","year":"2017","unstructured":"Canetti, R., Raghuraman, S., Richelson, S., Vaikuntanathan, V.: Chosen-ciphertext secure fully homomorphic encryption. In: Fehr, S. (ed.) PKC 2017, Part II. LNCS, vol. 10175, pp. 213\u2013240. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54388-7_8"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-662-46803-6_20","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Chen","year":"2015","unstructured":"Chen, J., Gay, R., Wee, H.: Improved dual system ABE in prime-order groups via predicate encodings. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 595\u2013624. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_20"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Chen, J., Gong, J., Kowalczyk, L., Wee, H.: Unbounded ABE via bilinear entropy expansion, revisited. IACR Cryptology ePrint Archive 2018, 116 (2018)","DOI":"10.1007\/978-3-319-78381-9_19"},{"issue":"6","key":"11_CR15","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1137\/18M1164834","volume":"47","author":"A Cohen","year":"2018","unstructured":"Cohen, A., Holmgren, J., Nishimaki, R., Vaikuntanathan, V., Wichs, D.: Watermarking cryptographic capabilities. SIAM J. Comput. 47(6), 2157\u20132202 (2018)","journal-title":"SIAM J. Comput."},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"D\u2019Arco, P., Stinson, D.R.: On unconditionally secure robust distributed key distribution centers. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 346\u2013363. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_22","DOI":"10.1007\/3-540-36178-2_22"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-76900-2_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"C Delerabl\u00e9e","year":"2007","unstructured":"Delerabl\u00e9e, C.: Identity-based broadcast encryption with constant size ciphertexts and private keys. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 200\u2013215. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_12"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Derler, D., Gellert, K., Jager, T., Slamanig, D., Striecks, C.: Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange. IACR Cryptology ePrint Archive 2018, 199 (2018)","DOI":"10.1007\/978-3-319-78372-7_14"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-319-78372-7_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"D Derler","year":"2018","unstructured":"Derler, D., Jager, T., Slamanig, D., Striecks, C.: Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part III. LNCS, vol. 10822, pp. 425\u2013455. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_14"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-76578-5_8","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"D Derler","year":"2018","unstructured":"Derler, D., Krenn, S., Lor\u00fcnser, T., Ramacher, S., Slamanig, D., Striecks, C.: Revisiting proxy re-encryption: forward secrecy, improved security, and applications. In: Abdalla, M., Dahab, R. (eds.) PKC 2018, Part I. LNCS, vol. 10769, pp. 219\u2013250. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_8"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 CRYPTO 89 Proceedings","author":"Y Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-46035-7_5","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"Y Dodis","year":"2002","unstructured":"Dodis, Y., Katz, J., Xu, S., Yung, M.: Key-insulated public key cryptosystems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 65\u201382. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_5"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/11681878_28","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2006","unstructured":"Dodis, Y., Yampolskiy, A., Yung, M.: Threshold and proactive pseudo-random permutations. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 542\u2013560. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_28"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/978-3-030-26951-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Gong","year":"2019","unstructured":"Gong, J., Waters, B., Wee, H.: ABE for DFA from k-Lin. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 732\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_25"},{"key":"11_CR25","unstructured":"Green, M., Hohenberger, S., Waters, B.: Outsourcing the decryption of ABE ciphertexts. In: Proceedings of the 20th USENIX Security Symposium, San Francisco, CA, USA, 8\u201312 August 2011 (2011)"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Green, M.D., Miers, I.: Forward secure asynchronous messaging from puncturable encryption. In: 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, 17\u201321 May 2015, pp. 305\u2013320 (2015)","DOI":"10.1109\/SP.2015.26"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-46885-4_5","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 89","author":"CG G\u00fcnther","year":"1990","unstructured":"G\u00fcnther, C.G.: An identity-based key-exchange protocol. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 29\u201337. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_5"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-56617-7_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"F G\u00fcnther","year":"2017","unstructured":"G\u00fcnther, F., Hale, B., Jager, T., Lauer, S.: 0-RTT key exchange with full forward secrecy. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part III. LNCS, vol. 10212, pp. 519\u2013548. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56617-7_18"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-030-17259-6_6","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"S Katsumata","year":"2019","unstructured":"Katsumata, S., Yamada, S.: Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 158\u2013188. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_6"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Lewko, A.B., Sahai, A., Waters, B.: Revocation systems with very small private keys. In: 31st IEEE Symposium on Security and Privacy, S&P 2010, Berleley\/Oakland, California, USA, 16\u201319 May 2010, pp. 273\u2013285 (2010)","DOI":"10.1109\/SP.2010.23"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-24638-1_10","volume-title":"Theory of Cryptography","author":"P MacKenzie","year":"2004","unstructured":"MacKenzie, P., Reiter, M.K., Yang, K.: Alternatives to non-malleability: definitions, constructions, and applications. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 171\u2013190. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_10"},{"issue":"3","key":"11_CR32","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10623-003-1719-4","volume":"36","author":"KM Martin","year":"2005","unstructured":"Martin, K.M., Safavi-Naini, R., Wang, H., Wild, P.R.: Distributing the encryption and decryption of a block cipher. Des. Codes Cryptogr. 36(3), 263\u2013287 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Bloom filters. In: Encyclopedia of Database Systems, Second edn. (2018)","DOI":"10.1007\/978-1-4614-8265-9_751"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-34961-4_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"T Okamoto","year":"2012","unstructured":"Okamoto, T., Takashima, K.: Fully secure unbounded inner-product and attribute-based encryption. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 349\u2013366. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_22"},{"key":"11_CR35","unstructured":"Ostrovsky, R., Sahai, A., Waters, B.: Attribute-based encryption with non-monotonic access structures. In: Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, 28\u201331 October 2007, pp. 195\u2013203 (2007)"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks (extended abstract). In: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, 19\u201321 August 1991, pp. 51\u201359 (1991)","DOI":"10.1145\/112600.112605"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Sun, S., Yuan, X., Liu, J.K., Steinfeld, R., Sakzad, A., Vo, V., Nepal, S.: Practical backward-secure searchable encryption from symmetric puncturable encryption. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 763\u2013780 (2018)","DOI":"10.1145\/3243734.3243782"},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-54631-0_16","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"S Yamada","year":"2014","unstructured":"Yamada, S., Attrapadung, N., Hanaoka, G., Kunihiro, N.: A framework and compact constructions for non-monotonic attribute-based encryption. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 275\u2013292. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_16"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45374-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T00:03:11Z","timestamp":1682726591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45374-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030453732","9783030453749"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45374-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edinburgh","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":"4 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2020\/","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":"IACR Web Review System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"44","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":"24% - 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":"15","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"}]}}