{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:17:29Z","timestamp":1771705049312,"version":"3.50.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319998060","type":"print"},{"value":"9783319998077","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-99807-7_36","type":"book-chapter","created":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T13:44:46Z","timestamp":1536155086000},"page":"559-577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A New Insight\u2014Proxy Re-encryption Under LWE with Strong Anti-collusion"],"prefix":"10.1007","author":[{"given":"Wei","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaoyan","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenmin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengping","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,6]]},"reference":[{"key":"36_CR1","unstructured":"Agrawal, S., Boyen, X.: Identity-based encryption from lattices in the standard model. Manuscript, July 2009"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 553\u2013572. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_28"},{"key":"36_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":"36_CR5","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"3\/4","key":"36_CR6","first-page":"38","volume":"3","author":"K Singh","year":"2013","unstructured":"Singh, K., Rangan, C.P., Banerjee, A.K.: Lattice based identity based proxy re-encryption scheme. J. Internet Serv. Inf. Secur. 3(3\/4), 38\u201351 (2013)","journal-title":"J. Internet Serv. Inf. Secur."},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-54631-0_5","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Kirshanova","year":"2014","unstructured":"Kirshanova, E.: Proxy re-encryption from lattices. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 77\u201394. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_5"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-75496-1_13","volume-title":"Information Security","author":"C-K Chu","year":"2007","unstructured":"Chu, C.-K., Tzeng, W.-G.: Identity-based proxy re-encryption without random oracles. In: Garay, J.A., Lenstra, A.K., Mambo, M., Peralta, R. (eds.) ISC 2007. LNCS, vol. 4779, pp. 189\u2013202. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75496-1_13"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-03515-4_1","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2013","author":"Y Aono","year":"2013","unstructured":"Aono, Y., Boyen, X., Phong, L.T., Wang, L.: Key-private proxy re-encryption under LWE. In: Paul, G., Vaudenay, S. (eds.) INDOCRYPT 2013. LNCS, vol. 8250, pp. 1\u201318. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03515-4_1"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-72738-5_19","volume-title":"Applied Cryptography and Network Security","author":"M Green","year":"2007","unstructured":"Green, M., Ateniese, G.: Identity-based proxy re-encryption. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 288\u2013306. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72738-5_19"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.04.028","volume":"542","author":"Z Jiang","year":"2014","unstructured":"Jiang, Z., Zhenfeng, Z., Chen, Y.: PRE: stronger security notions and efficient construction with non-interactive opening. Theor. Comput. Sci. 542, 1\u201316 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR12","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 (2007)","DOI":"10.1145\/1315245.1315269"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E.: How to delegate a lattice basis. IACR Cryptology ePrint Archive, p. 351 (2009)","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88702-7_5"},{"key":"36_CR16","unstructured":"Xagawa, D.K.: Cryptography with lattices (2010)"},{"key":"36_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0897-7","volume-title":"Complexity of Lattice Problems: A Cryptographic Perspective","author":"M Daniele","year":"2002","unstructured":"Daniele, M., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-0897-7"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996)","DOI":"10.1145\/237814.237838"},{"issue":"6","key":"36_CR19","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM (JACM) 56(6), 34 (2009)","journal-title":"J. ACM (JACM)"},{"key":"36_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-03356-8_11","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"R Cramer","year":"2009","unstructured":"Cramer, R., Damg\u00e5rd, I.: On the amortized complexity of zero-knowledge protocols. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 177\u2013191. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_11"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, pp. 372\u2013381 (2004)","DOI":"10.1109\/FOCS.2004.72"},{"issue":"1","key":"36_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1127345.1127346","volume":"9","author":"F Ateniese Giuseppe","year":"2006","unstructured":"Ateniese Giuseppe, F., Kevin, G.M., Susan, H.: Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Trans. Inf. Syst. Secur. (TISSEC) 9(1), 1\u201330 (2006)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"36_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-00862-7_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"G Ateniese","year":"2009","unstructured":"Ateniese, G., Benson, K., Hohenberger, S.: Key-private proxy re-encryption. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol. 5473, pp. 279\u2013294. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00862-7_19"},{"key":"36_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"},{"issue":"6","key":"36_CR25","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"36_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"36_CR27","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"issue":"1","key":"36_CR28","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/BF01445125","volume":"296","author":"B Wojciech","year":"1993","unstructured":"Wojciech, B.: New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen 296(1), 625\u2013635 (1993)","journal-title":"Mathematische Annalen"},{"issue":"1","key":"36_CR29","first-page":"217","volume":"13","author":"B Wojciech","year":"1995","unstructured":"Wojciech, B.: Inequalities for convex bodies and polar reciprocal lattices in $$R^{n}$$. Discret. Comput. Geom. 13(1), 217\u2013231 (1995)","journal-title":"Discret. Comput. Geom."},{"key":"36_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 114\u2013127. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_7"},{"issue":"24","key":"36_CR31","doi-asserted-by":"publisher","first-page":"5077","DOI":"10.1016\/j.ins.2010.08.017","volume":"180","author":"J Weng","year":"2010","unstructured":"Weng, J., Deng, R.H., Liu, S., Chen, K.: Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings. Inf. Sci. 180(24), 5077\u20135089 (2010)","journal-title":"Inf. Sci."},{"key":"36_CR32","unstructured":"Xagawa, K., Tanaka, K.: Proxy re-encryption based on learning with errors. In: Proceedings of the 2010 Symposium on Cryptography and Information Security, pp. 29\u201335 (2010)"},{"key":"36_CR33","doi-asserted-by":"crossref","unstructured":"Nunez, D., Agudo, I., Lopez, J.: NTRUReEncrypt: an efficient proxy re-encryption scheme based on NTRU. In: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, pp. 179\u2013189 (2015)","DOI":"10.1145\/2714576.2714585"},{"issue":"3","key":"36_CR34","first-page":"13","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 13 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"36_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-642-55032-4_58","volume-title":"Information and Communication Technology","author":"K Singh","year":"2014","unstructured":"Singh, K., Rangan, C.P., Banerjee, A.K.: Cryptanalysis of unidirectional proxy re-encryption scheme. In: Linawati, M.M.S., Neuhold, E.J., Tjoa, A.M., You, I. (eds.) ICT-EurAsia 2014. LNCS, vol. 8407, pp. 564\u2013575. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55032-4_58"},{"issue":"1","key":"36_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/JCN.2013.000003","volume":"18","author":"KS Kim","year":"2016","unstructured":"Kim, K.S., Jeong, I.R.: Collusion-resistant unidirectional proxy re-encryption scheme from lattices. J. Commun. Netw. 18(1), 1\u20137 (2016)","journal-title":"J. Commun. Netw."},{"key":"36_CR37","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.jnca.2017.03.005","volume":"87","author":"D Nu\u00f1ez","year":"2017","unstructured":"Nu\u00f1ez, D., et al.: Proxy re-encryption: analysis of constructions and its application to secure access delegation. J. Netw. Comput. Appl. 87, 193\u2013209 (2017)","journal-title":"J. Netw. Comput. Appl."},{"issue":"2","key":"36_CR38","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1002\/sec.109","volume":"4","author":"J Shao","year":"2011","unstructured":"Shao, J.: SCCR: a generic approach to simultaneously achieve CCA security and collusion resistance in proxy re encryption. Secur. Commun. Netw. 4(2), 122\u2013135 (2011)","journal-title":"Secur. Commun. Netw."},{"key":"36_CR39","series-title":"Lecture Notes on Data Engineering and Communications Technologies","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/978-3-319-49106-6_86","volume-title":"Advances on Broad-Band Wireless Computing, Communication and Applications","author":"L Zhang","year":"2017","unstructured":"Zhang, L., Ma, H., Liu, Z., Dong, E.: Security analysis and improvement of a collusion-resistant identity-based proxy re-encryption scheme. In: Barolli, L., Xhafa, F., Yim, K. (eds.) BWCCA 2016. LNDECT, vol. 2, pp. 839\u2013846. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-49106-6_86"},{"key":"36_CR40","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.future.2015.11.012","volume":"62","author":"Y Lu","year":"2016","unstructured":"Lu, Y., Li, J.: A pairing-free certificate-based proxy re-encryption scheme for secure data sharing in public clouds. Future Gener. Comput. Syst. 62, 140\u2013147 (2016)","journal-title":"Future Gener. Comput. Syst."},{"key":"36_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.csi.2016.12.005","volume":"52","author":"C Ge","year":"2017","unstructured":"Ge, C.: Identity-based conditional proxy re-encryption with fine grain policy. Comput. Stand. Interfaces 52, 1\u20139 (2017)","journal-title":"Comput. Stand. Interfaces"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99807-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T21:56:02Z","timestamp":1751838962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99807-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319998060","9783319998077"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99807-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ISPEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security Practice and Experience","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ispec2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.risk.tsukuba.ac.jp\/ispec2018\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34% - 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"}},{"value":"3.0","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2 invited papers were accepted for publication","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}