{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:22:12Z","timestamp":1766049732503,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030842581"},{"type":"electronic","value":"9783030842598"}],"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-84259-8_2","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:21:47Z","timestamp":1628637707000},"page":"34-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0858-9289","authenticated-orcid":false,"given":"Xiao","family":"Liang","sequence":"first","affiliation":[]},{"given":"Omkant","family":"Pandey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s00145-016-9233-9","volume":"30","author":"B Barak","year":"2017","unstructured":"Barak, B., Mahmoody-Ghidary, M.: Merkle\u2019s key agreement protocol is optimal: an $$O(n^2)$$ attack on any key agreement from random oracles. J. Cryptol. 30(3), 699\u2013734 (2017). https:\/\/doi.org\/10.1007\/s00145-016-9233-9","journal-title":"J. Cryptol."},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Chatterjee, R., Liang, X., Pandey, O.: Improved black-box constructions of composable secure computation. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) ICALP 2020. LIPIcs, vol. 168, pp. 28:1\u201328:20. Schloss Dagstuhl, July 2020. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.28","DOI":"10.4230\/LIPIcs.ICALP.2020.28"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: 29th FOCS, pp. 42\u201352. IEEE Computer Society Press, October 1988. https:\/\/doi.org\/10.1109\/SFCS.1988.21920","DOI":"10.1109\/SFCS.1988.21920"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"IB Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416\u2013427. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_39"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11535218_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"I Damg\u00e5rd","year":"2005","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Constant-round multiparty computation using a black-box pseudorandom generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 378\u2013394. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_23"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: 22nd ACM STOC, pp. 416\u2013426. ACM Press (1990). https:\/\/doi.org\/10.1145\/100216.100272","DOI":"10.1145\/100216.100272"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-662-53641-4_19","volume-title":"Theory of Cryptography","author":"S Garg","year":"2016","unstructured":"Garg, S., Gupta, D., Miao, P., Pandey, O.: Secure multiparty RAM computation in constant rounds. In: Hirt, M., Smith, A. (eds.) TCC 2016-B, Part I. LNCS, vol. 9985, pp. 491\u2013520. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_19"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-319-78375-8_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Garg","year":"2018","unstructured":"Garg, S., Kiyoshima, S., Pandey, O.: A new approach to black-box concurrent secure computation. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018, Part II. LNCS, vol. 10821, pp. 566\u2013599. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_19"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-030-57990-6_5","volume-title":"Security and Cryptography for Networks","author":"S Garg","year":"2020","unstructured":"Garg, S., Liang, X., Pandey, O., Visconti, I.: Black-box constructions of bounded-concurrent secure computation. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 87\u2013107. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_5"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-24638-1_15","volume-title":"Theory of Cryptography","author":"R Gennaro","year":"2004","unstructured":"Gennaro, R., Lysyanskaya, A., Malkin, T., Micali, S., Rabin, T.: Algorithmic tamper-proof (ATP) security: theoretical foundations for security against hardware tampering. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 258\u2013277. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_15"},{"key":"2_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools, vol. 1. Cambridge University Press, Cambridge (2001)"},{"key":"2_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"2_CR14","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 (1989). https:\/\/doi.org\/10.1145\/73007.73010","DOI":"10.1145\/73007.73010"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract). In: 27th FOCS, pp. 174\u2013187. IEEE Computer Society Press, October 1986. https:\/\/doi.org\/10.1109\/SFCS.1986.47","DOI":"10.1109\/SFCS.1986.47"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: 17th ACM STOC, pp. 291\u2013304. ACM Press, May 1985. https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Goyal, V.: Constant round non-malleable protocols using one way functions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 695\u2013704. ACM Press, June 2011. https:\/\/doi.org\/10.1145\/1993636.1993729","DOI":"10.1145\/1993636.1993729"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Goyal, V., Lee, C.K., Ostrovsky, R., Visconti, I.: Constructing non-malleable commitments: a black-box approach. In: 53rd FOCS, pp. 51\u201360. IEEE Computer Society Press, October 2012. https:\/\/doi.org\/10.1109\/FOCS.2012.47","DOI":"10.1109\/FOCS.2012.47"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Goyal, V., Ostrovsky, R., Scafuro, A., Visconti, I.: Black-box non-black-box zero knowledge. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 515\u2013524. ACM Press, May\/June 2014. https:\/\/doi.org\/10.1145\/2591796.2591879","DOI":"10.1145\/2591796.2591879"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-78524-8_23","volume-title":"Theory of Cryptography","author":"I Haitner","year":"2008","unstructured":"Haitner, I.: Semi-honest to malicious oblivious transfer\u2014the black-box way. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 412\u2013426. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_23"},{"issue":"4","key":"2_CR21","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-662-53008-5_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Hazay","year":"2016","unstructured":"Hazay, C., Venkitasubramaniam, M.: On the power of secure two-party computation. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part II. LNCS, vol. 9815, pp. 397\u2013429. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_14"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-03807-6_10","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2018","unstructured":"Hazay, C., Venkitasubramaniam, M.: Round-optimal fully black-box zero-knowledge arguments from one-way permutations. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part I. LNCS, vol. 11239, pp. 263\u2013285. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_10"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstracts). In: 21st ACM STOC, pp. 12\u201324. ACM Press, May 1989. https:\/\/doi.org\/10.1145\/73007.73009","DOI":"10.1145\/73007.73009"},{"key":"2_CR25","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":"2_CR26","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions for secure computation. In: Kleinberg, J.M. (ed.) 38th ACM STOC, pp. 99\u2013108. ACM Press, May 2006. https:\/\/doi.org\/10.1145\/1132516.1132531","DOI":"10.1145\/1132516.1132531"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 21\u201330. ACM Press, June 2007. https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"2_CR29","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-03807-6_11","volume-title":"Theory of Cryptography","author":"D Khurana","year":"2018","unstructured":"Khurana, D., Ostrovsky, R., Srinivasan, A.: Round optimal black-box \u201cCommit-and-Prove\u2019\u2019. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part I. LNCS, vol. 11239, pp. 286\u2013313. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_11"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th ACM STOC, pp. 20\u201331. ACM Press, May 1988. https:\/\/doi.org\/10.1145\/62212.62215","DOI":"10.1145\/62212.62215"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-662-44381-1_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S Kiyoshima","year":"2014","unstructured":"Kiyoshima, S.: Round-efficient black-box construction of composable multi-party computation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 351\u2013368. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_20"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-030-56880-1_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Kiyoshima","year":"2020","unstructured":"Kiyoshima, S.: Round-optimal black-box commit-and-prove with succinct communication. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 533\u2013561. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_19"},{"issue":"3","key":"2_CR34","first-page":"115","volume":"9","author":"LA Levin","year":"1973","unstructured":"Levin, L.A.: Universal sequential search problems. Problemy Peredachi Informatsii 9(3), 115\u2013116 (1973)","journal-title":"Problemy Peredachi Informatsii"},{"key":"2_CR35","unstructured":"Liang, X., Pandey, O.: Towards a unified approach to black-box constructions of zero-knowledge proofs. Cryptology ePrint Archive, Report 2021\/836 (2021). https:\/\/eprint.iacr.org\/2021\/836"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-32009-5_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"H Lin","year":"2012","unstructured":"Lin, H., Pass, R.: Black-box constructions of composable protocols without set-up. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 461\u2013478. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_27"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"M Naor","year":"1990","unstructured":"Naor, M.: Bit commitment using pseudo-randomness. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 128\u2013136. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_13"},{"key":"2_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-00457-5_24","volume-title":"Theory of Cryptography","author":"R Pass","year":"2009","unstructured":"Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 403\u2013418. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_24"},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1\u201320. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_1"},{"key":"2_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-32009-5_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"M Rosulek","year":"2012","unstructured":"Rosulek, M.: Must you know the code of f to securely compute f? In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 87\u2013104. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_7"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Wee, H.: Black-box, round-efficient secure computation via non-malleability amplification. In: 51st FOCS, pp. 531\u2013540. IEEE Computer Society Press, October 2010. https:\/\/doi.org\/10.1109\/FOCS.2010.87","DOI":"10.1109\/FOCS.2010.87"},{"issue":"8","key":"2_CR43","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"AD Wyner","year":"1975","unstructured":"Wyner, A.D.: The wire-tap channel. Bell Syst. Tech. J. 54(8), 1355\u20131387 (1975)","journal-title":"Bell Syst. Tech. J."},{"key":"2_CR44","unstructured":"Yerukhimovich, A.B.: A study of separations in cryptography: new results and new models. Ph.D. thesis, University of Maryland, College Park, Maryland, USA (2011)"}],"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-84259-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:03:24Z","timestamp":1723334604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84259-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842581","9783030842598"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84259-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}]}}