{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T13:33:26Z","timestamp":1769520806647,"version":"3.49.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030842512","type":"print"},{"value":"9783030842529","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-84252-9_22","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:04:26Z","timestamp":1628636666000},"page":"656-686","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Asymptotically-Good Arithmetic Secret Sharing over $$\\mathbb {Z}\/p^{\\ell }\\mathbb {Z}$$ with Strong Multiplication and Its Applications to Efficient MPC"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[]},{"given":"Matthieu","family":"Rambaud","sequence":"additional","affiliation":[]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Abspoel, M., Cramer, R., Damg\u00e5rd, I., Escudero, D., Yuan, C.: Efficient information-theoretic secure multiparty computation over $$\\mathbb{Z}\/p^k\\mathbb{Z}$$ via\u00a0Galois rings. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 471\u2013501. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_19","DOI":"10.1007\/978-3-030-36030-6_19"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Abspoel, M., Dalskov, A., Escudero, D., Nof, A.: An efficient passive-to-active compiler for honest-majority MPC over rings. In: Sako, K., Tippenhauer, N.O. (eds.) ACNS 2021. LNCS, vol. 12727, pp. 122\u2013152. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78375-4_6","DOI":"10.1007\/978-3-030-78375-4_6"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-64840-4_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Abspoel","year":"2020","unstructured":"Abspoel, M., et al.: Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over $$\\mathbb{Z}\/p^k\\mathbb{Z} $$. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 151\u2013180. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_6"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Araki, T., et al.: Generalizing the SPDZ compiler for other protocols. In: CCS (2018)","DOI":"10.1145\/3243734.3243854"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-32009-5_39","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"E Ben-Sasson","year":"2012","unstructured":"Ben-Sasson, E., Fehr, S., Ostrovsky, R.: Near-linear unconditionally-secure multiparty computation with a dishonest minority. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 663\u2013680. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_39"},{"key":"22_CR6","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":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-030-05378-9_20","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2018","author":"AR Block","year":"2018","unstructured":"Block, A.R., Maji, H.K., Nguyen, H.H.: Secure computation with constant communication overhead using multiplication embeddings. In: Chakraborty, D., Iwata, T. (eds.) INDOCRYPT 2018. LNCS, vol. 11356, pp. 375\u2013398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05378-9_20"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-03356-8_28","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Cascudo","year":"2009","unstructured":"Cascudo, I., Chen, H., Cramer, R., Xing, C.: Asymptotically good ideal linear secret sharing with strong multiplication over any fixed finite field. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 466\u2013486. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_28"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-319-96878-0_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"I Cascudo","year":"2018","unstructured":"Cascudo, I., Cramer, R., Xing, C., Yuan, C.: Amortized complexity of information-theoretically secure MPC revisited. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 395\u2013426. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_14"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-40189-8_7","volume-title":"Pursuit of the Universal","author":"I Cascudo","year":"2016","unstructured":"Cascudo, I.: Secret sharing schemes with algebraic properties and applications. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 68\u201377. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40189-8_7"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/11818175_31","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"H Chen","year":"2006","unstructured":"Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 521\u2013536. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_31"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/978-3-642-22792-9_39","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"I Cascudo","year":"2011","unstructured":"Cascudo, I., Cramer, R., Xing, C.: The torsion-limit for algebraic function fields and its application to arithmetic secret sharing. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 685\u2013705. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_39"},{"key":"22_CR13","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":"22_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, New York (2015)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-030-64378-2_23","volume-title":"Theory of Cryptography","author":"I Cascudo","year":"2020","unstructured":"Cascudo, I., Gundersen, J.S.: A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 652\u2013682. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_23"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-319-96881-0_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"R Cramer","year":"2018","unstructured":"Cramer, R., Damg\u00e5rd, I., Escudero, D., Scholl, P., Xing, C.: SPD$$\\mathbb{Z}_{2^k}$$: efficient MPC mod $$2^k$$ for dishonest majority. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 769\u2013798. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_26"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01390768","volume":"6","author":"AR Calderbank","year":"1995","unstructured":"Calderbank, A.R., Sloane, N.J.A.: Modular and p-adic cyclic codes. Des. Codes Crypt. 6, 21\u201335 (1995). https:\/\/doi.org\/10.1007\/BF01390768","journal-title":"Des. Codes Crypt."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds MPC for equality, comparison, bits and exponentiation. In: TCC (2006)","DOI":"10.1007\/11681878_15"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"22_CR20","unstructured":"Damg\u00e5rd, I., Escudero, D., Frederiksen, T., Keller, M., Scholl, P., Volgushev, N.: New primitives for actively-secure MPC over rings. In: IEEE S&P (2019)"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-26951-7_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"I Damg\u00e5rd","year":"2019","unstructured":"Damg\u00e5rd, I., Larsen, K.G., Nielsen, J.B.: Communication lower bounds for statistically secure MPC, with or without preprocessing. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 61\u201384. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_3"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-64840-4_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"A Dalskov","year":"2020","unstructured":"Dalskov, A., Lee, E., Soria-Vazquez, E.: Circuit amortization friendly encodings and their application to statistically secure multiparty computation. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 213\u2013243. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_8"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/978-3-319-96881-0_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"I Damg\u00e5rd","year":"2018","unstructured":"Damg\u00e5rd, I., Orlandi, C., Simkin, M.: Yet another compiler for active security or: efficient MPC over arbitrary rings. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 799\u2013829. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_27"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Franklin, M., Yung, M.: Communication complexity of secure computation (extended abstract). In: STOC (1992)","DOI":"10.1145\/129712.129780"},{"key":"22_CR25","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory 45, 1757\u20131767 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-030-56880-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"V Goyal","year":"2020","unstructured":"Goyal, V., Song, Y., Zhu, C.: Guaranteed output delivery comes free in honest majority MPC. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 618\u2013646. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_22"},{"key":"22_CR27","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1006\/jsco.2001.0513","volume":"35","author":"F Hess","year":"2002","unstructured":"Hess, F.: Computing Riemann-Roch spaces in algebraic function fields and related topics. J. Symb. Comput. 35, 425\u2013445 (2002)","journal-title":"J. Symb. Comput."},{"key":"22_CR28","unstructured":"Illusie, L.: Grothendieck\u2019s existence theorem in formal geometry. In: Fundamental Algebraic Geometry: Grothendieck\u2019s FGA Explained. Ed. by AMS (2005)"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC (2007)","DOI":"10.1145\/1250790.1250794"},{"issue":"245","key":"22_CR30","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1090\/S0025-5718-03-01567-9","volume":"73","author":"K Khuri-Makdisi","year":"2004","unstructured":"Khuri-Makdisi, K.: Linear algebra algorithms for divisors on an algebraic curve. Math. Comput. 73(245), 333\u2013357 (2004)","journal-title":"Math. Comput."},{"key":"22_CR31","unstructured":"Narayanan, A.K., Weidner, M.: Subquadratic time encodable codes beating the Gilbert-Varshamov bound. CoRR (2017). http:\/\/arxiv.org\/abs\/1712.10052"},{"key":"22_CR32","unstructured":"Keskinkurt Paksoy, \u0130., Cenk, M.: TMVP-based multiplication for polynomial quotient rings. eprint 2020\/1302 (2020)"},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Patra, A., Suresh, A.: BLAZE: blazing fast privacy-preserving machine learning. In: NDSSS (2020)","DOI":"10.14722\/ndss.2020.24202"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/978-3-030-77886-6_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"A Polychroniadou","year":"2021","unstructured":"Polychroniadou, A., Song, Y.: Constant-overhead unconditionally secure multiparty computation over binary fields. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 812\u2013841. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_28"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: STOC (1989)","DOI":"10.1145\/73007.73014"},{"key":"22_CR36","volume-title":"Codes and Rings","author":"M Shi","year":"2017","unstructured":"Shi, M., Alahmadi, A., Sol\u00e9, P.: Codes and Rings. Academic Press, Cambridge (2017)"},{"key":"22_CR37","doi-asserted-by":"publisher","first-page":"2399","DOI":"10.1090\/mcom\/3517","volume":"89","author":"P-J Spaenlehauer","year":"2020","unstructured":"Spaenlehauer, P.-J., le Gluher, A.: A fast randomized geometric algorithm for computing Riemann-Roch spaces. Math. Comput. 89, 2399\u20132433 (2020)","journal-title":"Math. Comput."},{"key":"22_CR38","unstructured":"Grothendieck, A.: SGA 1. LNM, vol. 224. Springer, Heidelberg (1964)"},{"key":"22_CR39","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1109\/18.945244","volume":"47","author":"KW Shum","year":"2001","unstructured":"Shum, K.W., Aleshnikov, I., Kumar, P.V., Stichtenoth, H., Deolalikar, V.: A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. IEEE Trans. Inf. Theory 47, 2225\u20132241 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR40","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic Function Fields and Codes","author":"H Stichtenoth","year":"2009","unstructured":"Stichtenoth, H.: Algebraic Function Fields and Codes. GTM, vol. 254, 2nd edn. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-76878-4","edition":"2"},{"key":"22_CR41","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/18.748993","volume":"45","author":"MA Shokrollahi","year":"1999","unstructured":"Shokrollahi, M.A., Wasserman, H.: List decoding of algebraicgeometric codes. IEEE Trans. Inf. Theory 45, 432\u2013437 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"22_CR42","unstructured":"Walker, J.: Algebraic geometry codes over rings. Ph.D. thesis. Univ Illinois Champain (1996)"},{"issue":"1","key":"22_CR43","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0022-4049(98)00047-4","volume":"144","author":"JL Walker","year":"1999","unstructured":"Walker, J.L.: Algebraic geometric codes over rings. J. Pure Appl. Algebra 144(1), 91\u2013110 (1999)","journal-title":"J. Pure Appl. Algebra"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84252-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:10:43Z","timestamp":1723335043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84252-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842512","9783030842529"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84252-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2021\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"426","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":"103","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","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":"20.9","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":"1 invited paper is also included.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}