{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:01:13Z","timestamp":1769281273301,"version":"3.49.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030299583","type":"print"},{"value":"9783030299590","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-29959-0_12","type":"book-chapter","created":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T23:04:10Z","timestamp":1568502250000},"page":"234-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Generic Traceable Proxy Re-encryption and Accountable Extension in Consensus Network"],"prefix":"10.1007","author":[{"given":"Hui","family":"Guo","sequence":"first","affiliation":[]},{"given":"Zhenfeng","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Mingyuan","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,15]]},"reference":[{"key":"12_CR1","unstructured":"Nucypher. https:\/\/www.nucypher.com\/"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/11787006_26","volume-title":"Automata, Languages and Programming","author":"M Abdalla","year":"2006","unstructured":"Abdalla, M., Catalano, D., Dent, A.W., Malone-Lee, J., Neven, G., Smart, N.P.: Identity-based encryption gone wild. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 300\u2013311. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_26"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Fu, K., Green, M., Hohenberger, S.: Improved proxy re-encryption schemes with applications to secure distributed storage. In: NDSS (2005)","DOI":"10.1145\/1127345.1127346"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0054122","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"M Blaze","year":"1998","unstructured":"Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 127\u2013144. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054122"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Traitor tracing with constant size ciphertext. In: Proceedings of the 15th ACM conference on Computer and communications security, pp. 501\u2013510. ACM (2008)","DOI":"10.1145\/1455770.1455834"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.future.2016.10.013","volume":"71","author":"C Borcea","year":"2017","unstructured":"Borcea, C., Polyakov, Y., Rohloff, K., Ryan, G., et al.: Picador: end-to-end encrypted publish-subscribe information distribution with proxy re-encryption. Future Gener. Comput. Syst. 71, 177\u2013191 (2017)","journal-title":"Future Gener. Comput. Syst."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Hohenberger, S.: Chosen-ciphertext secure proxy re-encryption. In: Proceedings of the 14th ACM conference on Computer and communications security, pp. 185\u2013194. ACM (2007)","DOI":"10.1145\/1315245.1315269"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-54631-0_6","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"N Chandran","year":"2014","unstructured":"Chandran, N., Chase, M., Liu, F.-H., Nishimaki, R., Xagawa, K.: Re-encryption, functional re-encryption, and multi-hop re-encryption: a framework for achieving obfuscation-based security and instantiations from lattices. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 95\u2013112. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_6"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-642-28914-9_23","volume-title":"Theory of Cryptography","author":"N Chandran","year":"2012","unstructured":"Chandran, N., Chase, M., Vaikuntanathan, V.: Functional re-encryption and collusion-resistant obfuscation. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 404\u2013421. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_23"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-030-17259-6_10","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"A Cohen","year":"2019","unstructured":"Cohen, A.: What about Bob? the inadequacy of CPA security for proxy reencryption. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 287\u2013316. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_10"},{"key":"12_CR11","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. LNCS, vol. 10769, pp. 219\u2013250. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_8"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-17259-6_11","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"G Fuchsbauer","year":"2019","unstructured":"Fuchsbauer, G., Kamath, C., Klein, K., Pietrzak, K.: Adaptively secure proxy re-encryption. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 317\u2013346. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_11"},{"key":"12_CR13","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"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Goyal, V., Lu, S., Sahai, A., Waters, B.: Black-box accountable authority identity-based encryption. In: Proceedings of the 15th ACM conference on Computer and communications security, pp. 427\u2013436. ACM (2008)","DOI":"10.1145\/1455770.1455824"},{"issue":"4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1093\/comjnl\/bxy096","volume":"62","author":"H Guo","year":"2019","unstructured":"Guo, H., Zhang, Z., Xu, J., An, N.: Non-transferable proxy re-encryption. Comput. J. 62(4), 490\u2013506 (2019). https:\/\/doi.org\/10.1093\/comjnl\/bxy096","journal-title":"Comput. J."},{"key":"12_CR16","unstructured":"Guo, H., Zhang, Z., Xu, J., An, N., Lan, X.: Accountable proxy re-encryption for secure data sharing. IEEE Trans. Dependable Secure Comput. (2018)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-12280-9_2","volume-title":"Cryptology and Network Security","author":"H Guo","year":"2014","unstructured":"Guo, H., Zhang, Z., Zhang, J.: Proxy re-encryption with unforgeable re-encryption keys. In: Gritzalis, D., Kiayias, A., Askoxylakis, I. (eds.) CANS 2014. LNCS, vol. 8813, pp. 20\u201333. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12280-9_2"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-25141-2_14","volume-title":"Advances in Information and Computer Security","author":"R Hayashi","year":"2011","unstructured":"Hayashi, R., Matsushita, T., Yoshida, T., Fujii, Y., Okada, K.: Unforgeability of re-encryption keys against collusion attack in proxy re-encryption. In: Iwata, T., Nishigaki, M. (eds.) IWSEC 2011. LNCS, vol. 7038, pp. 210\u2013229. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25141-2_14"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-70936-7_13","volume-title":"Theory of Cryptography","author":"S Hohenberger","year":"2007","unstructured":"Hohenberger, S., Rothblum, G.N., Shelat, A., Vaikuntanathan, V.: Securely obfuscating re-encryption. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 233\u2013252. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_13"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-24174-6_17","volume-title":"Computer Security \u2013 ESORICS 2015","author":"A Kiayias","year":"2015","unstructured":"Kiayias, A., Tang, Q.: Making any identity-based encryption accountable, efficiently. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9326, pp. 326\u2013346. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24174-6_17"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-36095-4_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"J Lai","year":"2013","unstructured":"Lai, J., Deng, R.H., Zhao, Y., Weng, J.: Accountable authority identity-based encryption with public traceability. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 326\u2013342. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36095-4_21"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-319-98989-1_26","volume-title":"Computer Security","author":"J Lai","year":"2018","unstructured":"Lai, J., Tang, Q.: Making any attribute-based encryption accountable, efficiently. In: Lopez, J., Zhou, J., Soriano, M. (eds.) ESORICS 2018. LNCS, vol. 11099, pp. 527\u2013547. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98989-1_26"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-85538-5_22","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"B Libert","year":"2008","unstructured":"Libert, B., Vergnaud, D.: Tracing malicious proxies in proxy re-encryption. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 332\u2013353. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_22"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-78440-1_21","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"B Libert","year":"2008","unstructured":"Libert, B., Vergnaud, D.: Unidirectional chosen-ciphertext secure proxy re-encryption. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 360\u2013379. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78440-1_21"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-00468-1_14","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"B Libert","year":"2009","unstructured":"Libert, B., Vergnaud, D.: Towards black-box accountable authority IBE with short ciphertexts and private keys. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 235\u2013255. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_14"},{"key":"12_CR26","unstructured":"Myers, S., Shull, A.: Efficient hybrid proxy re-encryption for practical revocation and key rotation. Technical report, Cryptology ePrint Archive, Report 2017\/833 (2017)"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-76953-0_9","volume-title":"Topics in Cryptology \u2013 CT-RSA 2018","author":"S Myers","year":"2018","unstructured":"Myers, S., Shull, A.: Practical revocation and key rotation. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 157\u2013178. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_9"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-24177-7_14","volume-title":"Computer Security \u2013 ESORICS 2015","author":"J Ning","year":"2015","unstructured":"Ning, J., Dong, X., Cao, Z., Wei, L.: Accountable authority ciphertext-policy attribute-based encryption with white-box traceability and public auditing in the cloud. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9327, pp. 270\u2013289. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24177-7_14"},{"key":"12_CR29","doi-asserted-by":"crossref","unstructured":"Pehlivanoglu, S.: An asymmetric fingerprinting code for collusion-resistant buyer-seller watermarking. In: Proceedings of the first ACM workshop on Information hiding and multimedia security, pp. 35\u201344. ACM (2013)","DOI":"10.1145\/2482513.2482525"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-68339-9_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1996","author":"B Pfitzmann","year":"1996","unstructured":"Pfitzmann, B., Schunter, M.: Asymmetric fingerprinting. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 84\u201395. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_8"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-19379-8_19","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"A Sahai","year":"2011","unstructured":"Sahai, A., Seyalioglu, H.: Fully Secure accountable-authority identity-based encryption. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 296\u2013316. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19379-8_19"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Taban, G., C\u00e1rdenas, A.A., Gligor, V.D.: Towards a secure and interoperable drm architecture. In: Proceedings of the ACM workshop on Digital rights management, pp. 69\u201378. ACM (2006)","DOI":"10.1145\/1179509.1179524"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-89754-5_11","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"Q Tang","year":"2008","unstructured":"Tang, Q.: Type-based proxy re-encryption and its construction. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 130\u2013144. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89754-5_11"},{"issue":"3","key":"12_CR34","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s11432-010-0047-3","volume":"53","author":"J Weng","year":"2010","unstructured":"Weng, J., Chen, M., Yang, Y., Deng, R., Chen, K., Bao, F.: CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles. Sci. China Inf. Sci. 53(3), 593\u2013606 (2010)","journal-title":"Sci. China Inf. Sci."},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Xu, P., Xu, J., Wang, W., Jin, H., Susilo, W., Zou, D.: Generally hybrid proxy re-encryption: a secure data sharing among cryptographic clouds. In: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, pp. 913\u2013918. ACM (2016)","DOI":"10.1145\/2897845.2897923"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, J., Zhang, Z., Chen, Y.: PRE: Stronger security notions and efficient construction with non-interactive opening. In: Theoretical Computer Science (2014)","DOI":"10.1016\/j.tcs.2014.04.028"},{"issue":"11","key":"12_CR37","doi-asserted-by":"publisher","first-page":"3222","DOI":"10.1109\/TMC.2017.2687931","volume":"16","author":"J Zhang","year":"2017","unstructured":"Zhang, J., Zhang, Z., Guo, H.: Towards secure data distribution systems in mobile cloud computing. IEEE Trans. Mob. Comput. 16(11), 3222\u20133235 (2017)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-319-40253-6_31","volume-title":"Information Security and Privacy","author":"Y Zhang","year":"2016","unstructured":"Zhang, Y., Li, J., Zheng, D., Chen, X., Li, H.: Accountable large-universe attribute-based encryption supporting any monotone access structures. In: Liu, J.K.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9722, pp. 509\u2013524. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40253-6_31"},{"issue":"1","key":"12_CR39","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/TIFS.2017.2746000","volume":"13","author":"C Zuo","year":"2018","unstructured":"Zuo, C., Shao, J., Liu, J.K., Wei, G., Ling, Y.: Fine-grained two-factor protection mechanism for data sharing in cloud storage. IEEE Trans. Inf. Forensics Secur. 13(1), 186\u2013196 (2018)","journal-title":"IEEE Trans. Inf. Forensics Secur."}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29959-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T00:04:33Z","timestamp":1726358673000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29959-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030299583","9783030299590"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29959-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 September 2019","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":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf.laas.fr\/esorics\/","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":"344","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":"67","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,2","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":"11","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"}]}}