{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:05:04Z","timestamp":1777287904442,"version":"3.51.4"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030842413","type":"print"},{"value":"9783030842420","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-84242-0_11","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:06:57Z","timestamp":1628636817000},"page":"282-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Compact Ring Signatures from Learning with Errors"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Sanjam","family":"Garg","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Hajiabadi","sequence":"additional","affiliation":[]},{"given":"Dakshita","family":"Khurana","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[]},{"given":"Omkant","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"Sina","family":"Shiehian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-36178-2_26","volume-title":"Advances in Cryptology","author":"M Abe","year":"2002","unstructured":"Abe, M., Ohkubo, M., Suzuki, K.: 1-out-of-n signatures from a variety of keys. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 415\u2013432. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_26"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-030-17659-4_10","volume-title":"Advances in Cryptology","author":"M Backes","year":"2019","unstructured":"Backes, M., D\u00f6ttling, N., Hanzlik, L., Kluczniak, K., Schneider, J.: Ring signatures: logarithmic-size, no setup\u2014from standard assumptions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 281\u2013311. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_10"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-03329-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"M Backes","year":"2018","unstructured":"Backes, M., Hanzlik, L., Kluczniak, K., Schneider, J.: Signatures with flexible public key: introducing equivalence classes for public keys. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 405\u2013434. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_14"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-030-45727-3_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Badrinarayanan","year":"2020","unstructured":"Badrinarayanan, S., Fernando, R., Jain, A., Khurana, D., Sahai, A.: Statistical ZAP arguments. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 642\u2013667. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_22"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Baum, C., Lin, H., Oechsner, S.: Towards practical lattice-based one-time linkable ring signatures. In: ICICS, pp. 303\u2013322 (2018)","DOI":"10.1007\/978-3-030-01950-1_18"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bender, A., Katz, J., Morselli, R.: Ring signatures: stronger definitions, and constructions without random Oracles. In: TCC, pp. 60\u201379 (2006)","DOI":"10.1007\/11681878_4"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-64834-3_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"W Beullens","year":"2020","unstructured":"Beullens, W., Katsumata, S., Pintore, F.: Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 464\u2013492. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_16"},{"key":"11_CR8","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1987)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_26"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Boyen, X., Haines, T.: Forward-secure linkable ring signatures. In: ACISP, pp. 245\u2013264 (2018)","DOI":"10.1007\/978-3-319-93638-3_15"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., D\u00f6ttling, N.: Two-message statistically sender-private OT from LWE. In: TCC, pp. 370\u2013390 (2018)","DOI":"10.1007\/978-3-030-03810-6_14"},{"key":"11_CR12","unstructured":"Brakerski, Z., Kalai, Y.T.: A framework for efficient signatures, ring signatures and identity based encryption in the standard model. Cryptology ePrint Archive, Report 2010\/086 (2010). https:\/\/eprint.iacr.org\/2010\/086"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: STOC, pp. 575\u2013584 (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: STOC (2019, to appear)","DOI":"10.1145\/3313276.3316380"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Chandran, N., Groth, J., Sahai, A.: Ring signatures of sub-linear size without random Oracles. In: ICALP, pp. 423\u2013434 (2007)","DOI":"10.1007\/978-3-540-73420-8_38"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Chow, S.S.M., Wei, V.K., Liu, J.K., Yuen, T.H.: Ring signatures without random Oracles. In: ASIACCS, pp. 297\u2013302 (2006)","DOI":"10.1145\/1128817.1128861"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-540-24676-3_36","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Kiayias, A., Nicolosi, A., Shoup, V.: Anonymous identification in Ad Hoc groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 609\u2013626. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_36"},{"issue":"6","key":"11_CR18","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1137\/S0097539703426817","volume":"36","author":"C Dwork","year":"2007","unstructured":"Dwork, C., Naor, M.: Zaps and their applications. SIAM J. Comput. 36(6), 1513\u20131543 (2007)","journal-title":"SIAM J. Comput."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Esgin, M.F., Zhao, R.K., Steinfeld, R., Liu, J.K., Liu, D.: Matrict: efficient, scalable and post-quantum blockchain confidential transactions protocol. In: CCS, pp. 567\u2013584 (2019)","DOI":"10.1145\/3319535.3354200"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009). http:\/\/crypto.stanford.edu\/craig","DOI":"10.1145\/1536414.1536440"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206 (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Ghadafi, E.: Sub-linear blind ring signatures without random Oracles. In: IMACC, pp. 304\u2013323 (2013)","DOI":"10.1007\/978-3-642-45239-0_18"},{"key":"11_CR24","unstructured":"Gonz\u00e1lez, A.: A ring signature of size $$\\Theta $$(sqrt[3]n) without random oracles (2017). https:\/\/eprint.iacr.org\/2017\/905"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/978-3-030-45727-3_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"V Goyal","year":"2020","unstructured":"Goyal, V., Jain, A., Jin, Z., Malavolta, G.: Statistical zaps and new oblivious transfer protocols. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 668\u2013699. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_23"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-662-46803-6_9","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Groth","year":"2015","unstructured":"Groth, J., Kohlweiss, M.: One-out-of-many proofs: or how to leak a secret and spend a coin. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 253\u2013280. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_9"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-24582-7_20","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"J Herranz","year":"2003","unstructured":"Herranz, J., S\u00e1ez, G.: Forking lemmas for ring signature schemes. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 266\u2013279. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24582-7_20"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-49896-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"B Libert","year":"2016","unstructured":"Libert, B., Ling, S., Nguyen, K., Wang, H.: Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 1\u201331. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_1"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Libert, B., Peters, T., Qian, C.: Logarithmic-size ring signatures with tight security from the DDH assumption. In: ESORICS, pp. 288\u2013308 (2018)","DOI":"10.1007\/978-3-319-98989-1_15"},{"key":"11_CR30","unstructured":"Libert, B., Nguyen, K., Peters, T., Yung, M.: One-shot fiat-shamir-based nizk arguments of composite residuosity in the standard model. Cryptology ePrint Archive, Report 2020\/1334 (2020). https:\/\/eprint.iacr.org\/2020\/1334"},{"key":"11_CR31","unstructured":"Lombardi, A., Vaikuntanathan, V., Wichs, D.: 2-message publicly verifiable WI from (subexponential) LWE. Cryptology ePrint Archive, Report 2019\/808, p. 808 (2019). https:\/\/eprint.iacr.org\/2019\/808"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Lyubashevsky, V., Nguyen, N.K., Seiler, G.: SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions. In: CRYPTO (2021, to appear)","DOI":"10.1007\/978-3-030-84245-1_21"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-319-70697-9_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"G Malavolta","year":"2017","unstructured":"Malavolta, G., Schr\u00f6der, D.: Efficient ring signatures in the standard model. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 128\u2013157. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_5"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"RC Merkle","year":"1988","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369\u2013378. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Micciancio, D.: Duality in lattice cryptography. In: Public Key Cryptography (2010). Invited talk","DOI":"10.1007\/978-1-4419-5906-5_417"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC, pp. 427\u2013437 (1990)","DOI":"10.1145\/100216.100273"},{"key":"11_CR37","unstructured":"Noether, S.: Ring signature confidential transactions for monero (2015). https:\/\/eprint.iacr.org\/2015\/1098"},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-662-44371-2_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"R Ostrovsky","year":"2014","unstructured":"Ostrovsky, R., Paskin-Cherniavsky, A., Paskin-Cherniavsky, B.: Maliciously circuit-private FHE. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 536\u2013553. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_30"},{"key":"11_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-26954-8_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"S Park","year":"2019","unstructured":"Park, S., Sealfon, A.: It wasn\u2019t me! - repudiability and claimability of ring signatures. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 159\u2013190. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_6"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: STOC, pp. 333\u2013342 (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Peikert, C., Regev, O., Stephens-Davidowitz, N.: Pseudorandomness of Ring-LWE for any ring and modulus. In: STOC, pp. 461\u2013473 (2017)","DOI":"10.1145\/3055399.3055489"},{"key":"11_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-26948-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"C Peikert","year":"2019","unstructured":"Peikert, C., Shiehian, S.: Noninteractive zero knowledge for NP from (plain) learning with errors. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 89\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_4"},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009). Preliminary version in STOC 2005","DOI":"10.1145\/1568318.1568324"},{"key":"11_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"RL Rivest","year":"2001","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552\u2013565. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_32"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Sch\u00e4ge, S., Schwenk, J.: A CDH-based ring signature scheme with short signatures and public keys. In: Financial Cryptography and Data Security, pp. 129\u2013142 (2010)","DOI":"10.1007\/978-3-642-14577-3_12"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Shacham, H., Waters, B.: Efficient ring signatures without random oracles. In: PKC, pp. 166\u2013180 (2007)","DOI":"10.1007\/978-3-540-71677-8_12"},{"key":"11_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-319-93638-3_32","volume-title":"Information Security and Privacy","author":"WA Alberto Torres","year":"2018","unstructured":"Alberto Torres, W.A., et al.: Post-quantum one-time linkable ring signature and application to ring confidential transactions in blockchain (Lattice RingCT v1.0). In: Susilo, W., Yang, G. (eds.) ACISP 2018. LNCS, vol. 10946, pp. 558\u2013576. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93638-3_32"}],"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-84242-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:04:02Z","timestamp":1723334642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84242-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842413","9783030842420"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84242-0_11","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"}]}}