{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:39:45Z","timestamp":1743021585119,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030578077"},{"type":"electronic","value":"9783030578084"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57808-4_3","type":"book-chapter","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T21:03:47Z","timestamp":1598475827000},"page":"45-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Secure and Efficient Delegation of Elliptic-Curve Pairing"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[]},{"given":"Matluba","family":"Khodjaeva","sequence":"additional","affiliation":[]},{"given":"Delaram","family":"Kahrobaei","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Shpilrain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-540-40061-5_29","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"SS Al-Riyami","year":"2003","unstructured":"Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452\u2013473. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40061-5_29"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.3233\/JCS-1997-5105","volume":"5","author":"N Asokan","year":"1997","unstructured":"Asokan, N., Tsudik, G., Waidner, M.: Server-supported signatures. J. Comput. Secur. 5(1), 91\u2013108 (1997)","journal-title":"J. Comput. Secur."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0065-2458(01)80019-X","volume":"54","author":"M Atallah","year":"2002","unstructured":"Atallah, M., Pantazopoulos, K., Rice, J., Spafford, E.: Secure outsourcing of scientific computations. Adv. Comput. 54, 215\u2013272 (2002)","journal-title":"Adv. Comput."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Atallah, M., Frikken, K.: Securely outsourcing linear algebra computations. In: Proceedings of 5th ACM ASIACCS, pp. 48\u201359 (2010)","DOI":"10.1145\/1755688.1755695"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-22174-8_14","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"PSLM Barreto","year":"2015","unstructured":"Barreto, P.S.L.M., Costello, C., Misoczki, R., Naehrig, M., Pereira, G.C.C.F., Zanon, G.: Subgroup security in pairing-based cryptography. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 245\u2013265. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_14"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Benjamin, D., Atallah, M.: Private and cheating-free outsourcing of algebraic computations. In: 6th Sixth Annual Conference on Privacy, Security and Trust, pp. 240\u2013245 (2008)","DOI":"10.1109\/PST.2008.12"},{"key":"3_CR7","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":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-662-43414-7_22","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"JW Bos","year":"2014","unstructured":"Bos, J.W., Costello, C., Naehrig, M.: Exponentiating in pairing groups. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 438\u2013455. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7_22"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-319-07536-5_32","volume-title":"Applied Cryptography and Network Security","author":"S Canard","year":"2014","unstructured":"Canard, S., Devigne, J., Sanders, O.: Delegating a pairing can be both secure and efficient. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 549\u2013565. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_32"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-24837-0_10","volume-title":"Radio Frequency Identification","author":"B Cavallo","year":"2015","unstructured":"Cavallo, B., Di Crescenzo, G., Kahrobaei, D., Shpilrain, V.: Efficient and secure delegation of group exponentiation to a single server. In: Mangard, S., Schaumont, P. (eds.) RFIDSec 2015. LNCS, vol. 9440, pp. 156\u2013173. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24837-0_10"},{"issue":"9","key":"3_CR13","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2013.180","volume":"25","author":"X Chen","year":"2014","unstructured":"Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. IEEE Trans. Parallel Distrib. Syst. 25(9), 2386\u20132396 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR14","unstructured":"Chevallier-Mames, B., Coron, J.S., McCullagh, N., Naccache, D., Scott, M.: Secure delegation of elliptic-curve pairing. Cryptology ePrint Archive. In report 2005\/150 (2005). http:\/\/eprint.iacr.org\/2005\/150"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-12510-2_3","volume-title":"Smart Card Research and Advanced Application","author":"B Chevallier-Mames","year":"2010","unstructured":"Chevallier-Mames, B., Coron, J.-S., McCullagh, N., Naccache, D., Scott, M.: Secure delegation of elliptic-curve pairing. In: Gollmann, D., Lanet, J.-L., Iguchi-Cartigny, J. (eds.) CARDIS 2010. LNCS, vol. 6035, pp. 24\u201335. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12510-2_3"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-45744-4_13","volume-title":"Computer Security \u2013 ESORICS 2016","author":"C Chevalier","year":"2016","unstructured":"Chevalier, C., Laguillaumie, F., Vergnaud, D.: Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9878, pp. 261\u2013278. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45744-4_13"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-14623-7_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"K-M Chung","year":"2010","unstructured":"Chung, K.-M., Kalai, Y., Vadhan, S.: Improved delegation of computation using fully homomorphic encryption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 483\u2013501. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_26"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Practical and secure outsourcing of discrete log group exponentiation to a single malicious server. In: Proceedings of 9th ACM CCSW, pp. 17\u201328 (2017)","DOI":"10.1145\/3140649.3140657"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-96418-8_17","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"G Di Crescenzo","year":"2018","unstructured":"Di Crescenzo, G., Kahrobaei, D., Khodjaeva, M., Shpilrain, V.: Efficient and secure delegation to a single malicious server: exponentiation over non-abelian groups. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 137\u2013146. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96418-8_17"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: Secure delegation to a single malicious server: exponentiation in RSA-type groups. In: Proceedings of IEEE CNS, pp. 1\u20139 (2019)","DOI":"10.1109\/CNS.2019.8802691"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10623-005-3710-8","volume":"39","author":"M Dijk","year":"2006","unstructured":"Dijk, M., Clarke, D., Gassend, B., Suh, G., Devadas, S.: Speeding up exponentiation using an untrusted computational resource. Des. Codes Crypt. 39(2), 253\u2013273 (2006)","journal-title":"Des. Codes Crypt."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Proceedings of ACM CCS Conference, pp. 501\u2013512 (2012)","DOI":"10.1145\/2382196.2382250"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/11593447_33","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"M Girault","year":"2005","unstructured":"Girault, M., Lefranc, D.: Server-aided verification: theory and practice. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 605\u2013623. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593447_33"},{"issue":"4","key":"3_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699436","volume":"62","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser, S., Tauman Kalai, Y., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. J. ACM (JACM) 62(4), 1\u201364 (2015)","journal-title":"J. ACM (JACM)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-16763-3_12","volume-title":"Smart Card Research and Advanced Applications","author":"A Guillevic","year":"2015","unstructured":"Guillevic, A., Vergnaud, D.: Algorithms for outsourcing pairing computation. In: Joye, M., Moradi, A. (eds.) CARDIS 2014. LNCS, vol. 8968, pp. 193\u2013211. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16763-3_12"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-36492-7_20","volume-title":"Selected Areas in Cryptography","author":"F Hess","year":"2003","unstructured":"Hess, F.: Efficient identity based signature schemes based on pairings. In: Nyberg, K., Heys, H. (eds.) SAC 2002. LNCS, vol. 2595, pp. 310\u2013324. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36492-7_20"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-30576-7_15","volume-title":"Theory of Cryptography","author":"S Hohenberger","year":"2005","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 264\u2013282. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_15"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie\u2013Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385\u2013393. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722028_23"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"EJ Kachisa","year":"2008","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 126\u2013135. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_9"},{"key":"3_CR31","unstructured":"Kang, B.G., Lee, M.S., Park, J.H.: Efficient delegation of pairing computation. In: IACR Cryptology ePrint Archive, no. 259 (2005)"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Liu, J.K., Au, M.H., Susilo, W.: Self-generated-certificate public key cryptography and certificateless signature\/encryption scheme in the standard model. In: Proceedings of the ACM Symposium on Information, Computer and Communications Security. ACM Press (2007)","DOI":"10.1145\/1229285.1266994"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Ma, X., Li, J., Zhang, F.: Outsourcing computation of modular exponentiations in cloud computing. Cluster Comput. 16, 787\u2013796 (2013). (also INCoS 2012)","DOI":"10.1007\/s10586-013-0252-0"},{"key":"3_CR34","unstructured":"Matsumoto, T., Kato, K., Imai, H.: An improved algorithm for secure outsourcing of modular exponentiations. In: Proceedings of CRYPTO 1988, pp. 497\u2013506. LNCS, Springer, Cham (1988)"},{"key":"3_CR35","unstructured":"Scott, M.: Unbalancing pairing-based key exchange protocols. In: IACR Cryptology ePrint Archive, no. 688 (2013)"},{"key":"3_CR36","unstructured":"Shi, Y., Li, J.: Provable efficient certificateless public key encryption. In: IACR Cryptology ePrint Archive, no. 284 (2005)"},{"issue":"1","key":"3_CR37","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for secure computations. In: Proceedings of 23rd IEEE FOCS, pp. 160\u2013168 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57808-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T04:15:21Z","timestamp":1668053721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57808-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030578077","9783030578084"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57808-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/ACNS2020","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"214","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":"46","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":"21% - 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.7","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":"10","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to COVID-19 pandemy the confernce was helt virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}