{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:07:24Z","timestamp":1766279244752,"version":"3.48.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031223648"},{"type":"electronic","value":"9783031223655"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22365-5_11","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"300-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Four-Round Black-Box Non-malleable Schemes from\u00a0One-Way Permutations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5062-0388","authenticated-orcid":false,"given":"Michele","family":"Ciampi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1917-1833","authenticated-orcid":false,"given":"Emmanuela","family":"Orsini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1813-1132","authenticated-orcid":false,"given":"Luisa","family":"Siniscalchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-319-96881-0_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Badrinarayanan","year":"2018","unstructured":"Badrinarayanan, S., Goyal, V., Jain, A., Kalai, Y.T., Khurana, D., Sahai, A.: Promise zero knowledge and its applications to round optimal MPC. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 459\u2013487. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_16"},{"key":"11_CR2","unstructured":"Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: FOCS (2002)"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: 22nd Annual ACM Symposium on Theory of Computing, pp. 503\u2013513. ACM Press, Baltimore, MD, USA (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-13013-7_12","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"Z Cao","year":"2010","unstructured":"Cao, Z., Visconti, I., Zhang, Z.: Constant-round concurrent non-malleable statistically binding commitments and decommitments. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 193\u2013208. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_12"},{"key":"11_CR5","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: 47th International Colloquium on Automata, Languages and Programming. LIPIcs, vol. 168, pp. 28:1\u201328:20. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Saarbr\u00fccken, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.28","DOI":"10.4230\/LIPIcs.ICALP.2020.28"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium on Foundations of Computer Science, pp. 383\u2013395. IEEE Computer Society Press, Portland, Oregon (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.64","DOI":"10.1109\/SFCS.1985.64"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-030-64378-2_11","volume-title":"Theory of Cryptography","author":"A Rai Choudhuri","year":"2020","unstructured":"Rai Choudhuri, A., Ciampi, M., Goyal, V., Jain, A., Ostrovsky, R.: Round optimal secure multiparty computation from minimal assumptions. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 291\u2013319. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_11"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-662-53015-3_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Ciampi","year":"2016","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Concurrent non-malleable commitments (and more) in 3 rounds. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 270\u2013299. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_10"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-63715-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"M Ciampi","year":"2017","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Four-round concurrent non-malleable commitments from one-way functions. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 127\u2013157. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_5"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-319-70500-2_23","volume-title":"Theory of Cryptography","author":"M Ciampi","year":"2017","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Round-optimal secure two-party computation from trapdoor permutations. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 678\u2013710. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_23"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-030-57990-6_33","volume-title":"Security and Cryptography for Networks","author":"M Ciampi","year":"2020","unstructured":"Ciampi, M., Parisella, R., Venturi, D.: On adaptive security of delayed-input sigma protocols and fiat-shamir nizks. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 670\u2013690. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_33"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-662-49099-0_5","volume-title":"Theory of Cryptography","author":"M Ciampi","year":"2016","unstructured":"Ciampi, M., Persiano, G., Scafuro, A., Siniscalchi, L., Visconti, I.: Improved or-composition of sigma-protocols. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 112\u2013141. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_5"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-031-06944-4_12","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"M Ciampi","year":"2022","unstructured":"Ciampi, M., Ravi, D., Siniscalchi, L., Waldner, H.: Round-optimal multi-party computation with identifiable abort. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13275, pp. 335\u2013364. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_12"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-42033-7_17","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Dachman-Soled","year":"2013","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Venkitasubramaniam, M.: Adaptive and concurrent secure computation from new adaptive, non-malleable commitments. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8269, pp. 316\u2013336. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_17"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: 23rd Annual ACM Symposium on Theory of Computing, pp. 542\u2013552. ACM Press, New Orleans, LA, USA (1991). https:\/\/doi.org\/10.1145\/103418.103474","DOI":"10.1145\/103418.103474"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string. In: 31st Annual Symposium on Foundations of Computer Science, pp. 308\u2013317. IEEE Computer Society Press, St. Louis, MO, USA (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89549","DOI":"10.1109\/FSCS.1990.89549"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: 33rd Annual ACM Symposium on Theory of Computing, pp. 580\u2013589. ACM Press, Crete, Greece (2001). https:\/\/doi.org\/10.1145\/380752.380853","DOI":"10.1145\/380752.380853"},{"key":"11_CR18","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2006","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. 1. Cambridge University Press, New York (2006)"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 14\u201317 May 1989, Seattle, Washigton, USA, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Goyal, V.: Constant round non-malleable protocols using one way functions. In: STOC (2011)","DOI":"10.1145\/1993636.1993729"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Goyal, V., Khurana, D., Sahai, A.: Breaking the three round barrier for non-malleable commitments. In: 57th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2016. IEEE (2016)","DOI":"10.1109\/FOCS.2016.12"},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Goyal, V., Lee, C.K., Ostrovsky, R., Visconti, I.: Constructing non-malleable commitments: a black-box approach. In: 53rd Annual Symposium on Foundations of Computer Science, pp. 51\u201360. IEEE Computer Society Press, New Brunswick, NJ, USA (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.47","DOI":"10.1109\/FOCS.2012.47"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Goyal, V., Richelson, S.: Non-malleable commitments using Goldreich-Levin list decoding. In: Zuckerman, D. (ed.) 60th Annual Symposium on Foundations of Computer Science, pp. 686\u2013699. IEEE Computer Society Press, Baltimore, MD, USA (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00047","DOI":"10.1109\/FOCS.2019.00047"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Goyal, V., Richelson, S., Rosen, A., Vald, M.: An algebraic approach to non-malleability. In: 55th Annual Symposium on Foundations of Computer Science, pp. 41\u201350. IEEE Computer Society Press, Philadelphia, PA, USA (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.13","DOI":"10.1109\/FOCS.2014.13"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Goyal, V., Richelson, S., Rosen, A., Vald, M.: An algebraic approach to non-malleability. Cryptology ePrint Archive, Paper 2014\/586 (2014). https:\/\/eprint.iacr.org\/2014\/586","DOI":"10.1109\/FOCS.2014.13"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-319-96881-0_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Halevi","year":"2018","unstructured":"Halevi, S., Hazay, C., Polychroniadou, A., Venkitasubramaniam, M.: Round-optimal secure multi-party computation. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 488\u2013520. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_17"},{"key":"11_CR27","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. LNCS, vol. 9815, pp. 397\u2013429. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_14"},{"key":"11_CR28","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 Annual ACM Symposium on Theory of Computing, pp. 21\u201330. ACM Press, San Diego, CA, USA (2007). https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-319-70503-3_5","volume-title":"Theory of Cryptography","author":"D Khurana","year":"2017","unstructured":"Khurana, D.: Round optimal concurrent non-malleability from polynomial hardness. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 139\u2013171. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_5"},{"key":"11_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 Commit-and-Prove. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 286\u2013313. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_11"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R.: Constant-round non-malleable commitments from any one-way function. In: Fortnow, L., Vadhan, S.P. (eds.) Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, 6\u20138 June 2011, San Jose, CA, USA, pp. 705\u2013714. ACM (2011)","DOI":"10.1145\/1993636.1993730"},{"issue":"1","key":"11_CR32","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/2699446","volume":"62","author":"H Lin","year":"2015","unstructured":"Lin, H., Pass, R.: Constant-round nonmalleable commitments from any one-way function. J. ACM 62(1), 5:1-5:30 (2015)","journal-title":"J. ACM"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-78524-8_31","volume-title":"Theory of Cryptography","author":"H Lin","year":"2008","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: Concurrent non-malleable commitments from any one-way function. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 571\u2013588. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_31"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-642-32009-5_41","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"M Mahmoody","year":"2012","unstructured":"Mahmoody, M., Pass, R.: The curious case of non-interactive commitments \u2013 on the power of black-box vs. non-black-box use of primitives. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 701\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_41"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-00457-5_7","volume-title":"Theory of Cryptography","author":"R Ostrovsky","year":"2009","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Simulation-based concurrent non-malleable commitments and decommitments. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 91\u2013108. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_7"},{"key":"11_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-36594-2_19","volume-title":"Theory of Cryptography","author":"R Pass","year":"2013","unstructured":"Pass, R.: Unprovable security of perfect nizk and non-interactive non-malleable commitments. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 334\u2013354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_19"},{"key":"11_CR37","unstructured":"Pass, R., Rosen, A.: Bounded-concurrent secure two-party computation in a constant number of rounds. In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11\u201314 October 2003, Cambridge, MA, USA, Proceedings, pp. 404\u2013413. IEEE Computer Society (2003)"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23\u201325 October 2005, Pittsburgh, PA, USA, pp. 563\u2013572 (2005)","DOI":"10.1109\/SFCS.2005.27"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: STOC (2005)","DOI":"10.1145\/1060590.1060670"},{"issue":"6","key":"11_CR40","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1137\/060661880","volume":"37","author":"R Pass","year":"2008","unstructured":"Pass, R., Rosen, A.: Concurrent nonmalleable commitments. SIAM J. Comput. 37(6), 1891\u20131925 (2008)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR41","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/060671553","volume":"38","author":"R Pass","year":"2008","unstructured":"Pass, R., Rosen, A.: New and improved constructions of nonmalleable cryptographic protocols. SIAM J. Comput. 38(2), 702\u2013752 (2008)","journal-title":"SIAM J. Comput."},{"key":"11_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-642-13190-5_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"R Pass","year":"2010","unstructured":"Pass, R., Wee, H.: Constant-round non-malleable commitments from sub-exponential one-way functions. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 638\u2013655. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_32"},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"Wee, H.: Black-box, round-efficient secure computation via non-malleability amplification. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, 23\u201326 October 2010, Las Vegas, Nevada, USA, pp. 531\u2013540. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.87"},{"key":"11_CR44","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Space-time tradeoff for answering range queries. In: 14th Annual ACM Symposium on Theory of Computing, pp. 128\u2013136. ACM Press, San Francisco, CA, USA (1982). https:\/\/doi.org\/10.1145\/800070.802185","DOI":"10.1145\/800070.802185"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22365-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:27Z","timestamp":1766278947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22365-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223648","9783031223655"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22365-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"139","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":"60","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":"43% - 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.1","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":"9.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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}