{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:48:01Z","timestamp":1754160481801,"version":"3.41.2"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031385568"},{"type":"electronic","value":"9783031385575"}],"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-38557-5_17","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:03:06Z","timestamp":1691521386000},"page":"515-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["One-Message Secure Reductions: On the\u00a0Cost of\u00a0Converting Correlations"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[]},{"given":"Mahimna","family":"Kelkar","sequence":"additional","affiliation":[]},{"given":"Varun","family":"Narayanan","sequence":"additional","affiliation":[]},{"given":"Liav","family":"Zafar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Agarwal, P., Narayanan, V., Pathak, S., Prabhakaran, M., Prabhakaran, V.M., Rehan, M.A.: Secure Non-interactive reduction and spectral analysis of correlations. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology\u2013EUROCRYPT 2022. LNCS, vol. 13277, pp. 797\u2013827. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_28","key":"17_CR1","DOI":"10.1007\/978-3-031-07082-2_28"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-030-64840-4_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., et al.: Cryptography from one-way communication: on completeness of\u00a0finite channels. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 653\u2013685. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_22"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-84245-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Agrawal","year":"2021","unstructured":"Agrawal, S., et al.: Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 124\u2013154. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_5"},{"doi-asserted-by":"crossref","unstructured":"Ahlswede, R., Csiszar, I.: Common randomness in information theory and cryptography. II CR capacity. IEEE Trans. Inf. Theory 44(1), 225\u2013240 (1998)","key":"17_CR4","DOI":"10.1109\/18.651026"},{"unstructured":"Anantharam, V., Gohari, A.A., Kamath, S., Nair, C.: On maximal correlation, hypercontractivity, and the data processing inequality studied by Erkip and Cover. CoRR abs\/1304.6133 (2013). https:\/\/arxiv.org\/abs\/1304.6133","key":"17_CR5"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"doi-asserted-by":"crossref","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. Cryptology ePrint Archive, Paper 2010\/514 (2010)","key":"17_CR7","DOI":"10.1007\/978-3-642-20465-4_11"},{"doi-asserted-by":"crossref","unstructured":"Bhushan, K., Misra, A.K., Narayanan, V., Prabhakaran, M.: Secure non-interactive reducibility is decidable. In: TCC (2022)","key":"17_CR8","DOI":"10.1007\/978-3-031-22365-5_15"},{"doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC, pp. 103\u2013112 (1988)","key":"17_CR9","DOI":"10.1145\/62212.62222"},{"issue":"10","key":"17_CR10","doi-asserted-by":"publisher","first-page":"6351","DOI":"10.1109\/TIT.2011.2134067","volume":"57","author":"A Bogdanov","year":"2011","unstructured":"Bogdanov, A., Mossel, E.: On extracting common random bits from correlated sources. IEEE Trans. Inf. Theory 57(10), 6351\u20136355 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-030-77886-6_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"E Boyle","year":"2021","unstructured":"Boyle, E., et al.: Function secret sharing for mixed-mode and fixed-point secure computation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part II. LNCS, vol. 12697, pp. 871\u2013900. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_30"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: ACM CCS, pp. 896\u2013912 (2018)","key":"17_CR12","DOI":"10.1145\/3243734.3243868"},{"doi-asserted-by":"publisher","unstructured":"Boyle, E., et\u00a0al.: Correlated pseudorandomness from expand-accumulate codes. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology\u2013CRYPTO 2022. CRYPTO 2022. LNCS, vol. 13508, pp. pp. 603\u2013633. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_21","key":"17_CR13","DOI":"10.1007\/978-3-031-15979-4_21"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., et\u00a0al.: Efficient two-round OT extension and silent non-interactive secure computation. In: ACM CCS, pp. 291\u2013308 (2019)","key":"17_CR14","DOI":"10.1145\/3319535.3354255"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-56880-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"E Boyle","year":"2020","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient\u00a0pseudorandom\u00a0correlation\u00a0generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 387\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-36030-6_14","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Secure computation with preprocessing via function secret sharing. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019, Part I. LNCS, vol. 11891, pp. 341\u2013371. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_14"},{"doi-asserted-by":"crossref","unstructured":"Canonne, C.L., Guruswami, V., Meka, R., Sudan, M.: Communication with imperfectly shared randomness. In: ITCS, pp. 257\u2013262 (2015)","key":"17_CR18","DOI":"10.1145\/2688073.2688099"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-030-84252-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part III. LNCS, vol. 12827, pp. 502\u2013534. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_17"},{"doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley-Interscience (2006)","key":"17_CR20","DOI":"10.1002\/047174882X"},{"key":"17_CR21","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"},{"doi-asserted-by":"crossref","unstructured":"De, A., Mossel, E., Neeman, J.: Non interactive simulation of correlated distributions is decidable. In: SODA, pp. 2728\u20132746 (2018)","key":"17_CR22","DOI":"10.1137\/1.9781611975031.174"},{"doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY - A framework for efficient mixed-protocol secure two-party computation. In: NDSS 2015 (2015)","key":"17_CR23","DOI":"10.14722\/ndss.2015.23113"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-030-84259-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"I Dinur","year":"2021","unstructured":"Dinur, I., et al.: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 517\u2013547. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_18"},{"doi-asserted-by":"crossref","unstructured":"Doerner, J., Shelat, A.: Scaling ORAM for secure computation. In: ACM CCS, pp. 523\u2013535 (2017)","key":"17_CR25","DOI":"10.1145\/3133956.3133967"},{"issue":"2","key":"17_CR26","first-page":"149","volume":"2","author":"P G\u00e1cs","year":"1973","unstructured":"G\u00e1cs, P., K\u00f6rner, J.: Common information is far less than mutual information. Probl. Control Inf. Theory 2(2), 149\u2013162 (1973)","journal-title":"Probl. Control Inf. Theory"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-48000-7_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Garg","year":"2015","unstructured":"Garg, S., Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with one-way communication. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part II. LNCS, vol. 9216, pp. 191\u2013208. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_10"},{"doi-asserted-by":"crossref","unstructured":"Ghazi, B., Jayram, T.S.: Resource-efficient common randomness and secret-key schemes. In: SODA, pp. 1834\u20131853 (2018)","key":"17_CR28","DOI":"10.1137\/1.9781611975031.120"},{"doi-asserted-by":"crossref","unstructured":"Ghazi, B., Kamath, P., Sudan, M.: Decidability of non-interactive simulation of joint distributions. In: FOCS, pp. 545\u2013554 (2016)","key":"17_CR29","DOI":"10.1109\/FOCS.2016.65"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218\u2013229 (1987)","key":"17_CR30","DOI":"10.1145\/28395.28420"},{"doi-asserted-by":"crossref","unstructured":"Goyal, S., Narayanan, V., Prabhakaran, M.: Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions. In: TCC, pp. 89\u2013118 (2022)","key":"17_CR31","DOI":"10.1007\/978-3-031-22368-6_4"},{"unstructured":"Guruswami, V., Radhakrishnan, J.: Tight bounds for communication-assisted agreement distillation. In: CCC, pp. 1\u201317 (2016)","key":"17_CR32"},{"doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: FOCS, pp. 294\u2013304 (2000)","key":"17_CR33","DOI":"10.1109\/SFCS.2000.892118"},{"key":"17_CR34","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"},{"issue":"6","key":"17_CR35","doi-asserted-by":"publisher","first-page":"3419","DOI":"10.1109\/TIT.2016.2553672","volume":"62","author":"S Kamath","year":"2016","unstructured":"Kamath, S., Anantharam, V.: On non-interactive simulation of joint distributions. IEEE Trans. Inf. Theory 62(6), 3419\u20133435 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"publisher","unstructured":"Khorasgani, H.A., Maji, H.K., Nguyen, H.H.: Secure non-interactive simulation: feasibility and rate. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology\u2013EUROCRYPT 2022. LNCS, vol. 13277, pp. 767\u2013796. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_27","key":"17_CR36","DOI":"10.1007\/978-3-031-07082-2_27"},{"doi-asserted-by":"crossref","unstructured":"Khorasgani, H.A., Maji, H.K., Nguyen, H.H.: Secure non-interactive simulation from arbitrary joint distributions. In: TCC, pp. 378\u2013407 (2022)","key":"17_CR37","DOI":"10.1007\/978-3-031-22365-5_14"},{"doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding crytpography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","key":"17_CR38","DOI":"10.1145\/62212.62215"},{"doi-asserted-by":"crossref","unstructured":"Narayanan, V., Prabhakaran, M., Prabhakaran, V.M.: Zero-communication reductions. In: TCC, pp. 274\u2013304 (2020)","key":"17_CR39","DOI":"10.1007\/978-3-030-64381-2_10"},{"issue":"1","key":"17_CR40","first-page":"291","volume":"2022","author":"T Ryffel","year":"2022","unstructured":"Ryffel, T., Tholoniat, P., Pointcheval, D., Bach, F.R.: Ariann: low-interaction privacy-preserving deep learning via function secret sharing. Proc. Priv. Enhanc. Technol. 2022(1), 291\u2013316 (2022)","journal-title":"Proc. Priv. Enhanc. Technol."},{"unstructured":"Storrier, K., Vadapalli, A., Lyons, A., Henry, R.: Grotto: screaming fast $$(2 + 1)$$-pc for $$\\mathbb{Z} _{2^{n}}$$ via (2, 2)-DPFs. Cryptology ePrint Archive, Paper 2023\/108 (2023). https:\/\/eprint.iacr.org\/2023\/108","key":"17_CR41"},{"issue":"1","key":"17_CR42","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.2019.2946364","volume":"66","author":"M Sudan","year":"2020","unstructured":"Sudan, M., Tyagi, H., Watanabe, S.: Communication for generating correlation: a unifying survey. IEEE Trans. Inf. Theory 66(1), 5\u201337 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"17_CR43","first-page":"351","volume":"2022","author":"S Wagh","year":"2022","unstructured":"Wagh, S.: PIKA: secure computation using function secret sharing over rings. Proc. Priv. Enhanc. Technol. 2022(4), 351\u2013377 (2022)","journal-title":"Proc. Priv. Enhanc. Technol."},{"issue":"1","key":"17_CR44","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/0128010","volume":"28","author":"HS Witsenhausen","year":"1975","unstructured":"Witsenhausen, H.S.: On sequences of pairs of dependent random variables. SIAM J. Appl. Math. 28(1), 100\u2013113 (1975)","journal-title":"SIAM J. Appl. Math."},{"issue":"8","key":"17_CR45","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."},{"doi-asserted-by":"crossref","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: Fast extension for correlated OT with small communication. In: CCS, pp. 1607\u20131626 (2020)","key":"17_CR46","DOI":"10.1145\/3372297.3417276"},{"unstructured":"Yang, P., et\u00a0al.: FssNN: communication-efficient secure neural network training via function secret sharing. Cryptology ePrint Archive, Paper 2023\/073 (2023). https:\/\/eprint.iacr.org\/2023\/073","key":"17_CR47"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: SFCS, pp. 160\u2013164 (1982)","key":"17_CR48","DOI":"10.1109\/SFCS.1982.38"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: SFCS, pp. 162\u2013167 (1986)","key":"17_CR49","DOI":"10.1109\/SFCS.1986.25"},{"doi-asserted-by":"crossref","unstructured":"Zhao, L., Chia, Y.K.: The efficiency of common randomness generation. In: Allerton, pp. 944\u2013950 (2011)","key":"17_CR50","DOI":"10.1109\/Allerton.2011.6120268"}],"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-38557-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:02:14Z","timestamp":1753567334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38557-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385568","9783031385575"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38557-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}