{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:48Z","timestamp":1759637628960,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030652760"},{"type":"electronic","value":"9783030652777"}],"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-65277-7_35","type":"book-chapter","created":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T12:17:34Z","timestamp":1607343454000},"page":"786-809","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Choudhury","sequence":"first","affiliation":[]},{"given":"Nikhil","family":"Pappu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,8]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Halpern, J.Y.: An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pp. 405\u2013414. ACM (2008)","DOI":"10.1145\/1400751.1400804"},{"issue":"3","key":"35_CR2","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/3388788","volume":"67","author":"L Bangalore","year":"2020","unstructured":"Bangalore, L., Choudhury, A., Patra, A.: The power of shunning: efficient asynchronous byzantine agreement revisited. J. ACM 67(3), 14:1\u201314:59 (2020)","journal-title":"J. ACM"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-76900-2_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2007","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Simple and efficient perfectly-secure asynchronous MPC. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 376\u2013392. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_23"},{"key":"35_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice (Extended Abstract) Completely asynchronous agreement protocols. In: Proceedings of the second Annual ACM Symposium on Principles of Distributed Computing, 27\u201330. ACM (1983)","DOI":"10.1145\/800221.806707"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 52\u201361. ACM (1993)","DOI":"10.1145\/167088.167109"},{"key":"35_CR8","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA, pp. 1\u201310. ACM (1988)"},{"key":"35_CR9","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience. In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14\u201317, 1994, pp. 183\u2013192. ACM (1994)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An asynchronous [(n-1)\/3]-resilient consensus protocol. In: Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing, pp. 154\u2013162. ACM (1984)","DOI":"10.1145\/800222.806743"},{"key":"35_CR11","unstructured":"Canetti, R.: Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute, Israel (1995)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14\u201317 October 2001, Las Vegas, Nevada, USA, pp. 136\u2013145. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous Byzantine agreement with optimal resilience. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 42\u201351 (1993)","DOI":"10.1145\/167088.167105"},{"key":"35_CR14","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA, pp. 11\u201319. ACM (1988)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Choudhury, A.: Brief announcement: almost-surely terminating asynchronous Byzantine agreement protocols with a constant expected running time. In: Proceedings of the 39th Symposium on Principles of Distributed Computing, pp. 169\u2013171. ACM (2020)","DOI":"10.1145\/3382734.3404503"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-41527-2_27","volume-title":"Distributed Computing","author":"A Choudhury","year":"2013","unstructured":"Choudhury, A., Hirt, M., Patra, A.: Asynchronous multiparty computation with linear communication complexity. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 388\u2013402. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41527-2_27"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Choudhury, A., Patra, A.: Optimally resilient asynchronous mpc with linear communication complexity. In: Proceedings of the International Conference on Distributed Computing and Networking, ICDCN \u201915, New York, NY, USA, 2015. Association for Computing Machinery, pp. 1\u201310 (2015)","DOI":"10.1145\/2684464.2684470"},{"key":"35_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1007\/978-3-662-53890-6_33","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Coretti","year":"2016","unstructured":"Coretti, S., Garay, J., Hirt, M., Zikas, V.: Constant-round asynchronous multi-party computation based on one-way functions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 998\u20131021. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_33"},{"key":"35_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"R Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient multiparty computations secure against an adaptive adversary. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 311\u2013326. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_22"},{"key":"35_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_22"},{"key":"35_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-45249-9_16","volume-title":"Distributed Computing and Networking","author":"V Dani","year":"2014","unstructured":"Dani, V., King, V., Movahedi, M., Saia, J.: Quorums quicken queries: efficient asynchronous secure multiparty computation. In: Chatterjee, M., Cao, J.-N., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 242\u2013256. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-45249-9_16"},{"issue":"2","key":"35_CR22","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"35_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-48000-6_19","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M Fitzi","year":"1999","unstructured":"Fitzi, M., Hirt, M., Maurer, U.: General adversaries in unconditional multi-party computation. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 232\u2013246. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48000-6_19"},{"key":"35_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol. 2. Cambridge University Press, Basic Applications (2004)"},{"key":"35_CR25","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game, or a completeness theorem for protocols with honest majority. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, USA, pp. 218\u2013229. ACM (1987)"},{"key":"35_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-26951-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"V Goyal","year":"2019","unstructured":"Goyal, V., Liu, Y., Song, Y.: Communication-efficient unconditional MPC with guaranteed output delivery. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 85\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_4"},{"key":"35_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 143\u2013161. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_12"},{"key":"35_CR28","unstructured":"Hirt, M.: Multi-Party Computation: Efficient Protocols, General Adversaries, and Voting. PhD thesis, ETH Zurich, September 2001. Reprint as, vol. 3 of ETH Series in Information Security and Cryptography, ISBN 3-89649-747-2, Hartung-Gorre Verlag, Konstanz (2001)"},{"key":"35_CR29","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multi-party computation. In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, PODC 1997, New York, NY, USA. Association for Computing Machinery, pp. 25\u201334 (1997)","DOI":"10.1145\/259380.259412"},{"issue":"1","key":"35_CR30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology 13(1), 31\u201360 (2000). https:\/\/doi.org\/10.1007\/s001459910003","journal-title":"Journal of Cryptology"},{"key":"35_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-70583-3_39","volume-title":"Automata, Languages and Programming","author":"M Hirt","year":"2008","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Asynchronous multi-party computation with quadratic communication. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 473\u2013485. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_39"},{"key":"35_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-42045-0_10","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"M Hirt","year":"2013","unstructured":"Hirt, M., Tschudi, D.: Efficient general-adversary multi-party computation. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 181\u2013200. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_10"},{"key":"35_CR33","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Proceedings of the Eigth Annual Structure in Complexity Theory Conference, pp. 102\u2013111 (1993)"},{"key":"35_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/3-540-45450-0_37","volume-title":"Information Security and Privacy","author":"MVNA Kumar","year":"2002","unstructured":"Kumar, M.V.N.A., Srinathan, K., Rangan, C.P.: Asynchronous perfectly secure computation tolerating generalized adversaries. In: Batten, L., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 497\u2013511. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45450-0_37"},{"key":"35_CR35","volume-title":"Byzantine Fault Tolerance on General Hybrid Adversary Structures","author":"K Kursawe","year":"2005","unstructured":"Kursawe, K., Freiling, F.C.: Byzantine Fault Tolerance on General Hybrid Adversary Structures. Technical Report, RWTH Aachen (2005)"},{"key":"35_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-10879-7_10","volume-title":"Security and Cryptography for Networks","author":"J Lampkins","year":"2014","unstructured":"Lampkins, J., Ostrovsky, R.: Communication-efficient MPC for general adversary structures. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 155\u2013174. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_10"},{"key":"35_CR37","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann (1996)"},{"key":"35_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-36413-7_2","volume-title":"Security in Communication Networks","author":"U Maurer","year":"2003","unstructured":"Maurer, U.: Secure multi-party computation made simple. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 14\u201328. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_2"},{"key":"35_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-03356-8_29","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"A Patra","year":"2009","unstructured":"Patra, A., Choudhary, A., Rabin, T., Rangan, C.P.: The round complexity of verifiable secret sharing revisited. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 487\u2013504. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_29"},{"issue":"2","key":"35_CR40","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-013-0200-5","volume":"27","author":"A Patra","year":"2013","unstructured":"Patra, A., Choudhury, A., Rangan, C.P.: Asynchronous byzantine agreement with optimal resilience. Distrib. Comput. 27(2), 111\u2013146 (2013). https:\/\/doi.org\/10.1007\/s00446-013-0200-5","journal-title":"Distrib. Comput."},{"key":"35_CR41","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, USA, 7\u20139 November 1983, pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"35_CR42","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14\u201317, 1989, Seattle, Washigton, USA, pp. 73\u201385. ACM (1989)"},{"issue":"11","key":"35_CR43","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(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"35_CR44","unstructured":"Smith, A., Stiglic, A.: Multiparty computation unconditionally secure against $$Q^2$$ adversary structures. arXiv preprint cs\/9902010 (1999)"},{"key":"35_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-44495-5_11","volume-title":"Progress in Cryptology \u2014INDOCRYPT 2000","author":"K Srinathan","year":"2000","unstructured":"Srinathan, K., Pandu Rangan, C.: Efficient asynchronous secure multiparty distributed computation. In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 117\u2013129. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44495-5_11"},{"key":"35_CR46","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3\u20135 November 1982, pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65277-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T22:33:15Z","timestamp":1617921195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65277-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030652760","9783030652777"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65277-7_35","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":"8 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangalore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"13 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/indocrypt2020.iiitb.ac.in\/","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":"84","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":"39","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":"3","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":"46% - 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.0","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":"4.3","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)"}}]}}