{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:49:33Z","timestamp":1778215773689,"version":"3.51.4"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385506","type":"print"},{"value":"9783031385513","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38551-3_22","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:02:27Z","timestamp":1691521347000},"page":"702-730","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the\u00a0Impossibility of\u00a0Algebraic NIZK in\u00a0Pairing-Free Groups"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5294-6648","authenticated-orcid":false,"given":"Emanuele","family":"Giunta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s00145-018-9292-1","volume":"32","author":"M Abe","year":"2018","unstructured":"Abe, M., Camenisch, J., Dowsley, R., Dubovitskaya, M.: On the impossibility of structure-preserving deterministic primitives. J. Cryptology 32(1), 239\u2013264 (2018). https:\/\/doi.org\/10.1007\/s00145-018-9292-1","journal-title":"J. Cryptology"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/0-387-34805-0_19","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Mihir Bellare","year":"1990","unstructured":"Bellare, Mihir, Goldwasser, Shafi: New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs. In: Brassard, Gilles (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 194\u2013211. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_19"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: 20th ACM STOC, pp. 103\u2013112. ACM Press, May 1988. https:\/\/doi.org\/10.1145\/62212.62222","DOI":"10.1145\/62212.62222"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-49896-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Jonathan Bootle","year":"2016","unstructured":"Bootle, Jonathan, Cerulli, Andrea, Chaidos, Pyrros, Groth, Jens, Petit, Christophe: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Fischlin, Marc, Coron, Jean-S\u00e9bastien. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 327\u2013357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12"},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: Short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy. pp. 315\u2013334. IEEE Computer Society Press, May 2018. https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"issue":"4","key":"22_CR6","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM (JACM) 51(4), 557\u2013594 (2004)","journal-title":"J. ACM (JACM)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"Dario Catalano","year":"2013","unstructured":"Catalano, Dario, Fiore, Dario: Vector commitments and their applications. In: Kurosawa, Kaoru, Hanaoka, Goichiro (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"22_CR8","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D., Gennaro, R., Giunta, E.: On the impossibility of algebraic vector commitments in pairing-free groups. In: Theory of Cryptography: 20th International Conference, TCC 2022, Chicago, IL, USA, November 7\u201310, 2022, Proceedings, Part II, pp. 274\u2013299. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_10","DOI":"10.1007\/978-3-031-22365-5_10"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Garg, S., Jain, A., Jin, Z., Zhang, J.: Correlation intractability and snargs from sub-exponential ddh. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-38551-3_20"},{"key":"22_CR10","doi-asserted-by":"publisher","unstructured":"Couteau, G., Hartmann, D.: Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 768\u2013798. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_27","DOI":"10.1007\/978-3-030-56877-1_27"},{"key":"22_CR11","unstructured":"Cramer, R.: Modular design of secure yet practical cryptographic protocols. Ph. D.-thesis, CWI and Uni. of Amsterdam (1996)"},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Hartmann, D., Hofheinz, D., Kiltz, E., Sch\u00e4ge, S., Ursu, B.: On the impossibility of purely algebraic signatures. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part III. LNCS, vol. 13044, pp. 317\u2013349. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_11","DOI":"10.1007\/978-3-030-90456-2_11"},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO\u201986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Ganesh, C., Khoshakhlagh, H., Parisella, R.: Niwi and new notions of extraction for algebraic languages. In: Security and Cryptography for Networks: 13th International Conference, SCN 2022, Amalfi (SA), Italy, September 12\u201314, 2022, Proceedings, pp. 687\u2013710. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_30","DOI":"10.1007\/978-3-031-14791-3_30"},{"key":"22_CR15","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Gertner, Y., Katz, J.: Lower bounds on the efficiency of encryption and digital signature schemes. In: 35th ACM STOC, pp. 417\u2013425. ACM Press, June 2003. https:\/\/doi.org\/10.1145\/780542.780604","DOI":"10.1145\/780542.780604"},{"key":"22_CR16","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: 41st FOCS, pp. 305\u2013313. IEEE Computer Society Press, November 2000. https:\/\/doi.org\/10.1109\/SFCS.2000.892119","DOI":"10.1109\/SFCS.2000.892119"},{"key":"22_CR17","doi-asserted-by":"publisher","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 99\u2013108. ACM Press, June 2011.https:\/\/doi.org\/10.1145\/1993636.1993651","DOI":"10.1145\/1993636.1993651"},{"key":"22_CR18","doi-asserted-by":"publisher","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: 41st FOCS, pp. 325\u2013335. IEEE Computer Society Press, November 2000. https:\/\/doi.org\/10.1109\/SFCS.2000.892121","DOI":"10.1109\/SFCS.2000.892121"},{"key":"22_CR19","doi-asserted-by":"publisher","unstructured":"Gertner, Y., Malkin, T., Reingold, O.: On the impossibility of basing trapdoor functions on trapdoor predicates. In: 42nd FOCS, pp. 126\u2013135. IEEE Computer Society Press, October 2001. https:\/\/doi.org\/10.1109\/SFCS.2001.959887","DOI":"10.1109\/SFCS.2001.959887"},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st ACM STOC, pp. 25\u201332. ACM Press, May 1989. https:\/\/doi.org\/10.1145\/73007.73010","DOI":"10.1145\/73007.73010"},{"key":"22_CR21","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Ostrovsky, R.: Invariant signatures and non-interactive zero-knowledge proofs are equivalent (extended abstract). In: Brickell, E.F. (ed.) CRYPTO\u201992. LNCS, vol. 740, pp. 228\u2013245. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_16","DOI":"10.1007\/3-540-48071-4_16"},{"key":"22_CR22","doi-asserted-by":"publisher","unstructured":"Groth, J.: Simulation-sound NIZK proofs for a practical language and constant size group signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 444\u2013459. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_29","DOI":"10.1007\/11935230_29"},{"key":"22_CR23","doi-asserted-by":"publisher","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Non-interactive zaps and new techniques for NIZK. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 97\u2013111. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_6","DOI":"10.1007\/11818175_6"},{"key":"22_CR24","doi-asserted-by":"publisher","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for NP. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 339\u2013358. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_21","DOI":"10.1007\/11761679_21"},{"key":"22_CR25","doi-asserted-by":"publisher","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"22_CR26","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st ACM STOC. pp. 44\u201361. ACM Press, May 1989. https:\/\/doi.org\/10.1145\/73007.73012","DOI":"10.1145\/73007.73012"},{"key":"22_CR27","doi-asserted-by":"publisher","unstructured":"Jain, A., Jin, Z.: Non-interactive zero knowledge from sub-exponential DDH. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 3\u201332. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_1","DOI":"10.1007\/978-3-030-77870-5_1"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Lombardi, A., Vaikuntanathan, V.: Snargs and ppad hardness from the decisional diffie-hellman assumption. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-30617-4_16"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"Aniket Kate","year":"2010","unstructured":"Kate, Aniket, Zaverucha, Gregory M.., Goldberg, Ian: Constant-size commitments to polynomials and their applications. In: Abe, Masayuki (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"issue":"4","key":"22_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09408-w","volume":"34","author":"S Katsumata","year":"2021","unstructured":"Katsumata, S., Nishimaki, R., Yamada, S., Yamakawa, T.: Compact designated verifier NIZKs from the CDH assumption without pairings. J. Cryptology 34(4), 1\u201371 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09408-w","journal-title":"J. Cryptology"},{"key":"22_CR31","doi-asserted-by":"publisher","unstructured":"Kim, J.H., Simon, D.R., Tetali, P.: Limits on the efficiency of one-way permutation-based hash functions. In: 40th FOCS, pp. 535\u2013542. IEEE Computer Society Press, October 1999. https:\/\/doi.org\/10.1109\/SFFCS.1999.814627","DOI":"10.1109\/SFFCS.1999.814627"},{"key":"22_CR32","doi-asserted-by":"publisher","unstructured":"Libert, B., Ramanna, S.C., Yung, M.: Functional commitment schemes: From polynomial commitments to pairing-based accumulators from simple assumptions. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) ICALP 2016. LIPIcs, vol. 55, pp. 30:1\u201330:14. Schloss Dagstuhl (July 2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.30","DOI":"10.4230\/LIPIcs.ICALP.2016.30"},{"key":"22_CR33","doi-asserted-by":"publisher","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 499\u2013517. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_30","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"Cryptography and Coding","author":"Ueli Maurer","year":"2005","unstructured":"Maurer, Ueli: Abstract models of computation in cryptography. In: Smart, Nigel P.. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_1"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"Maurer, U.M.: Unifying zero-knowledge proofs of knowledge. In: Preneel, B. (ed.) AFRICACRYPT 09. LNCS, vol.\u00a05580, pp. 272\u2013286. Springer, Heidelberg (Jun 2009)","DOI":"10.1007\/978-3-642-02384-2_17"},{"key":"22_CR36","unstructured":"Papakonstantinou, P.A., Rackoff, C., Vahlis, Y.: How powerful are the DDH hard groups? Electron. Colloquium Comput. Complex, p. 167 (2012). https:\/\/eccc.weizmann.ac.il\/report\/2012\/167"},{"key":"22_CR37","doi-asserted-by":"publisher","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 222\u2013242. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_13","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"22_CR38","doi-asserted-by":"publisher","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO\u201991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9","DOI":"10.1007\/3-540-46766-1_9"},{"key":"22_CR39","doi-asserted-by":"publisher","unstructured":"Rotem, L., Segev, G., Shahaf, I.: Generic-group delay functions require hidden-order groups. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part III. LNCS, vol. 12107, pp. 155\u2013180. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_6","DOI":"10.1007\/978-3-030-45727-3_6"},{"key":"22_CR40","doi-asserted-by":"publisher","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO\u201989. LNCS, vol. 435, pp. 239\u2013252. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_22","DOI":"10.1007\/0-387-34805-0_22"},{"key":"22_CR41","doi-asserted-by":"publisher","unstructured":"Schul-Ganz, G., Segev, G.: Generic-Group Identity-Based Encryption: A Tight Impossibility Result. In: Tessaro, S. (ed.) 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 199, pp. 26:1\u201326:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2021.26, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/14345","DOI":"10.4230\/LIPIcs.ITC.2021.26"},{"key":"22_CR42","doi-asserted-by":"publisher","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT\u201997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18","DOI":"10.1007\/3-540-69053-0_18"},{"key":"22_CR43","doi-asserted-by":"publisher","unstructured":"Simon, D.R.: Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT\u201998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054137","DOI":"10.1007\/BFb0054137"},{"key":"22_CR44","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: To label, or not to label (in generic groups). In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part III. LNCS, vol. 13509, pp. 66\u201396. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_3","DOI":"10.1007\/978-3-031-15982-4_3"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38551-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:03:47Z","timestamp":1753567427000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38551-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385506","9783031385513"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38551-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","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":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","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":"479","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":"124","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":"26% - 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":"15","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)"}}]}}