{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:58Z","timestamp":1766281018529,"version":"3.41.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031070815"},{"type":"electronic","value":"9783031070822"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07082-2_27","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:09:51Z","timestamp":1653696591000},"page":"767-796","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Secure Non-interactive Simulation: Feasibility and\u00a0Rate"],"prefix":"10.1007","author":[{"given":"Hamidreza","family":"Amini Khorasgani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai H.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Agarwal, P., Narayanan, V., Pathak, S., Prabhakaran, M., Prabhakaran, V., Rehan, M.A.: Secure non-interactive reduction and spectral analysis of correlations. To appear at EUROCRYPT 2022 (2022)","key":"27_CR1","DOI":"10.1007\/978-3-031-07082-2_28"},{"key":"27_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":"27_CR3","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1214\/aop\/1176995937","volume":"4","author":"R Ahlswede","year":"1976","unstructured":"Ahlswede, R., G\u00e1cs, P.: Spreading of sets in product spaces and hypercontraction of the Markov operator. Ann. Probab. 4, 925\u2013939 (1976)","journal-title":"Ann. Probab."},{"key":"27_CR4","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\u2014CRYPTO 1991","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":"Beigi, S., Gohari, A.: On the duality of additivity and tensorization. In: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 2381\u20132385. IEEE (2015)","key":"27_CR5","DOI":"10.1109\/ISIT.2015.7282882"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-54242-8_14","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2014","unstructured":"Beimel, A., Ishai, Y., Kumaresan, R., Kushilevitz, E.: On the cryptographic complexity of the worst functions. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 317\u2013342. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_14"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-24638-1_14","volume-title":"Theory of Cryptography","author":"A Beimel","year":"2004","unstructured":"Beimel, A., Malkin, T.: A quantitative approach to reductions in secure computation. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 238\u2013257. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_14"},{"doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS 2008, pp. 257\u2013266. ACM Press (October 2008)","key":"27_CR8","DOI":"10.1145\/1455770.1455804"},{"issue":"10","key":"27_CR9","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"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01318906","volume":"180","author":"C Borell","year":"1982","unstructured":"Borell, C.: Positivity improving operators and hypercontractivity. Mathematische Zeitschrift 180(3), 225\u2013234 (1982)","journal-title":"Mathematische Zeitschrift"},{"key":"27_CR11","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":"27_CR12","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"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"1630","DOI":"10.1109\/TIT.2014.2301155","volume":"60","author":"SO Chan","year":"2014","unstructured":"Chan, S.O., Mossel, E., Neeman, J.: On extracting common random bits from correlated sources on large alphabets. IEEE Trans. Inf. Theory 60(3), 1630\u20131637 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","volume-title":"Advances in Cryptology\u2014CRYPTO 1987","author":"C Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350\u2013354. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_30"},{"doi-asserted-by":"crossref","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)","key":"27_CR15","DOI":"10.1109\/SFCS.1988.21920"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/0-387-34799-2_1","volume-title":"Advances in Cryptology\u2014CRYPTO 1988","author":"C Cr\u00e9peau","year":"1990","unstructured":"Cr\u00e9peau, C., Kilian, J.: Weakening security assumptions and oblivious transfer. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 2\u20137. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_1"},{"key":"27_CR17","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: Czumaj, A. (ed.) 29th SODA, pp. 2728\u20132746. ACM-SIAM (January 2018)","key":"27_CR18","DOI":"10.1137\/1.9781611975031.174"},{"key":"27_CR19","first-page":"180","volume":"24","author":"I Dinur","year":"2017","unstructured":"Dinur, I., Filmus, Y., Harsha, P.: Low degree almost Boolean functions are sparse juntas. Electron. Colloquium Comput. Complex. 24, 180 (2017)","journal-title":"Electron. Colloquium Comput. Complex."},{"issue":"1","key":"27_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.D.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"27_CR21","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":"27_CR22","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":"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)","key":"27_CR23","DOI":"10.1109\/SFCS.2000.892121"},{"unstructured":"Ghazi, B., Kamath, P., Raghavendra, P.: Dimension reduction for polynomials over Gaussian space and applications. In: Servedio, R.A. (ed.) 33rd Computational Complexity Conference, CCC 2018, June 22\u201324, 2018, San Diego, CA, USA, volume 102 of LIPIcs, pp. 28: 1\u201328: 37. Schloss Dagstuhl - Leibniz Center for \"u r Computer Science (2018)","key":"27_CR24"},{"doi-asserted-by":"crossref","unstructured":"Ghazi, B., Kamath, P., Sudan, M.: Decidability of non-interactive simulation of joint distributions. In: Dinur, I. (ed.) 57th FOCS, pp. 545\u2013554. IEEE Computer Society Press (October 2016)","key":"27_CR25","DOI":"10.1109\/FOCS.2016.65"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press (May 1987)","key":"27_CR26","DOI":"10.1145\/28395.28420"},{"doi-asserted-by":"crossref","unstructured":"Kamath, S., Anantharam, V.: Non-interactive simulation of joint distributions: the hirschfeld-gebelein-r\u00e9nyi maximal correlation and the hypercontractivity ribbon. In: 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1057\u20131064. IEEE (2012)","key":"27_CR27","DOI":"10.1109\/Allerton.2012.6483335"},{"issue":"6","key":"27_CR28","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"},{"unstructured":"Khorasgani, H.A., Maji, H.K., Nguyen, H.H.: Secure non-interactive simulation: feasibility & rate. Cryptology ePrint Archive, Report 2020\/252 (2020). https:\/\/ia.cr\/2020\/252","key":"27_CR29"},{"doi-asserted-by":"crossref","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation. In: 32nd ACM STOC, pp. 316\u2013324. ACM Press (May 2000)","key":"27_CR30","DOI":"10.1145\/335305.335342"},{"unstructured":"Kindler, G.: Property Testing PCP. Ph.D. thesis, Tel-Aviv University (2002)","key":"27_CR31"},{"unstructured":"Kindler, G., Safra, S.: Noise-resistant Boolean functions are juntas. preprint (2002)","key":"27_CR32"},{"key":"27_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-642-55220-5_36","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Kraschewski","year":"2014","unstructured":"Kraschewski, D., Maji, H.K., Prabhakaran, M., Sahai, A.: A full characterization of completeness for two-party randomized function evaluation. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 659\u2013676. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_36"},{"key":"27_CR34","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes, vol. 16. Elsevier, Amsterdam (1977)"},{"doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Maji, H.K., Prabhakaran, M.: Limits of random oracles in secure computation. In: Naor, M. (ed.) ITCS 2014, pp. 23\u201334. ACM (January 2014)","key":"27_CR35","DOI":"10.1145\/2554797.2554801"},{"key":"27_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-54242-8_11","volume-title":"Theory of Cryptography","author":"M Mahmoody","year":"2014","unstructured":"Mahmoody, M., Maji, H.K., Prabhakaran, M.: On the power of public-key encryption in secure computation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 240\u2013264. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_11"},{"unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Complexity of multi-party computation functionalities. In: Prabhakaran, M., Sahai, A. (eds.) Secure Multi-Party Computation, volume 10 of Cryptology and Information Security Series, pp. 249\u2013283. IOS Press (2013)","key":"27_CR37"},{"unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: Blaze, M. (ed.) USENIX Security 2004, pp. 287\u2013302. USENIX Association (August 2004)","key":"27_CR38"},{"doi-asserted-by":"crossref","unstructured":"Mossel, E.: Gaussian bounds for noise correlation of functions and tight analysis of long codes. In: 49th FOCS, pp. 156\u2013165. IEEE Computer Society Press (October 2008)","key":"27_CR39","DOI":"10.1109\/FOCS.2008.44"},{"issue":"4","key":"27_CR40","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1002\/rsa.20062","volume":"26","author":"E Mossel","year":"2005","unstructured":"Mossel, E., O\u2019Donnell, R.: Coin flipping from a cosmic source: on error correction of truly random bits. Random Struct. Algorithms 26(4), 418\u2013436 (2005)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"27_CR41","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF02773611","volume":"154","author":"E Mossel","year":"2006","unstructured":"Mossel, E., O\u2019Donnell, R., Regev, O., Steif, J.E., Sudakov, B.: Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality. Israel J. Math. 154(1), 299\u2013336 (2006)","journal-title":"Israel J. Math."},{"issue":"3","key":"27_CR42","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1007\/s00039-013-0229-4","volume":"23","author":"E Mossel","year":"2013","unstructured":"Mossel, E., Oleszkiewicz, K., Sen, A.: On reverse hypercontractivity. Geom. Funct. Anal. 23(3), 1062\u20131097 (2013)","journal-title":"Geom. Funct. Anal."},{"doi-asserted-by":"crossref","unstructured":"Nair, C., Wang, Y.N.: Reverse hypercontractivity region for the binary erasure channel. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 938\u2013942. IEEE (2017)","key":"27_CR43","DOI":"10.1109\/ISIT.2017.8006666"},{"key":"27_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-030-64381-2_10","volume-title":"Theory of Cryptography","author":"V Narayanan","year":"2020","unstructured":"Narayanan, V., Prabhakaran, M., Prabhakaran, V.M.: Zero-communication reductions. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part III. LNCS, vol. 12552, pp. 274\u2013304. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_10"},{"key":"27_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"JB Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40"},{"key":"27_CR46","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean Functions","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press, Cambridge (2014)"},{"unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Memo TR-81 (1981)","key":"27_CR47"},{"unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Cryptology ePrint Archive, Report 2005\/187 (2005). https:\/\/eprint.iacr.org\/2005\/187","key":"27_CR48"},{"issue":"1","key":"27_CR49","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":"2","key":"27_CR50","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/TIT.1975.1055346","volume":"21","author":"A Wyner","year":"1975","unstructured":"Wyner, A.: The common information of two dependent random variables. IEEE Trans. Inf. Theory 21(2), 163\u2013179 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"27_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-24698-5_26","volume-title":"LATIN 2004: Theoretical Informatics","author":"K Yang","year":"2004","unstructured":"Yang, K.: On the (im)possibility of non-interactive correlation distillation. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 222\u2013231. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_26"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: 23rd FOCS, pp. 160\u2013164. IEEE Computer Society Press (November 1982)","key":"27_CR52","DOI":"10.1109\/SFCS.1982.38"},{"unstructured":"Yin, Z., Park, Y.: Hypercontractivity, maximal correlation and non-interactive simulation (2014)","key":"27_CR53"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07082-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:03:37Z","timestamp":1748383417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07082-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031070815","9783031070822"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07082-2_27","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":"25 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"30 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2022","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":"eurocrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2022\/","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":"372","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":"85","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":"23% - 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":"18","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":"Peer review was double-blind with rebuttal.","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)"}}]}}