{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:53Z","timestamp":1766281013131,"version":"3.48.0"},"publisher-location":"Cham","reference-count":29,"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_15","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"408-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Secure Non-interactive Reducibility is Decidable"],"prefix":"10.1007","author":[{"given":"Kaartik","family":"Bhushan","sequence":"first","affiliation":[]},{"given":"Ankit Kumar","family":"Misra","sequence":"additional","affiliation":[]},{"given":"Varun","family":"Narayanan","sequence":"additional","affiliation":[]},{"given":"Manoj","family":"Prabhakaran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Agarwal, P., et al.: Secure non-interactive reduction and spectral analysis of correlations. In: Dunkelman, O., Dziembowski, S. (eds) Advances in Cryptology EUROCRYPT 2022. Lecture Notes in Computer Science, vol. 13277, pp. 797\u2013827. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_28","DOI":"10.1007\/978-3-031-07082-2_28"},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Amini Khorasgani, H., Maji, H.K., Nguyen, H.H.: Secure non-interactive simulation: feasibility and rate. In: Dunkelman, O., Dziembowski, S. (eds) Advances in Cryptology - EUROCRYPT 2022. EUROCRYPT 2022. Lecture Notes in Computer Science, vol. 13277, pp 767\u2013796. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_27","DOI":"10.1007\/978-3-031-07082-2_27"},{"key":"15_CR3","unstructured":"Anantharam, V., Gohari, A., Kamath, S., Nair, C.: On maximal correlation, hypercontractivity, and the data processing inequality studied by Erkip and cover. CoRR, abs\/1304.6133 (2013)"},{"key":"15_CR4","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":"15_CR5","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"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bhushan, K., Misra, A.K., Narayanan, V., Prabhakaran, M.: Secure non-interactive reducibility is decidable. Cryptol. ePrint Arch. (2022)","DOI":"10.1007\/978-3-031-22365-5_15"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"De, A., Mossel, E., Neeman, J.: Non interactive simulation of correlated distributions is decidable. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, USA, pp. 2728\u20132746. Society for Industrial and Applied Mathematics (2018)","DOI":"10.1137\/1.9781611975031.174"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: STOC, pp. 554\u2013563 (1994)","DOI":"10.1145\/195058.195408"},{"key":"15_CR9","unstructured":"Filmus, Y.: A simple proof of the Kindler-Safra theorem. https:\/\/yuvalfilmus.cs.technion.ac.il\/Manuscripts\/KindlerSafra.pdf (2022)"},{"issue":"2","key":"15_CR10","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. Prob. Control Inf. Theory 2(2), 149\u2013162 (1973)","journal-title":"Prob. Control Inf. Theory"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Ghazi, B., Kamath, P., Sudan, M.: Decidability of non-interactive simulation of joint distributions. In: FOCS, pp. 545\u2013554. IEEE (2016)","DOI":"10.1109\/FOCS.2016.65"},{"key":"15_CR12","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. Cambridge University Press, Cambridge (2004)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Micali, S., Goldreich, O., Wigderson, A.: How to play any mental game. In: STOC, pp. 218\u2013229 (1987). See [12, Chap. 7] for more details","DOI":"10.1145\/28395.28420"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-48184-2_6","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"O Goldrcich","year":"1988","unstructured":"Goldrcich, O., Vainish, R.: How to solve any protocol problem - an efficiency improvement (extended abstract). In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 73\u201386. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_6"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Goyal, S., Narayanan, V., Prabhakaran, M.: Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions. In: these proceedings (2022)","DOI":"10.1007\/978-3-031-22368-6_4"},{"key":"15_CR16","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":"15_CR17","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"},{"key":"15_CR18","unstructured":"Khorasgani, H.A., Maji, H.K., Nguyen, H.H.: Decidability of secure non-interactive simulation of doubly symmetric binary source. Cryptology ePrint Archive, Report 2021\/190 (2021). https:\/\/eprint.iacr.org\/2021\/190"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"15_CR20","unstructured":"Kindler, G.: Property Testing, PCP, and juntas. PhD thesis, Tel Aviv University (2002)"},{"key":"15_CR21","unstructured":"Kindler, G., Safra, S.: Noise-resistant Boolean functions are juntas. Manuscript available from http:\/\/www.math.tau.ac.il\/~safra\/PapersAndTalks\/nibfj.ps (2002)"},{"key":"15_CR22","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":"15_CR23","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Complexity of multi-party computation functionalities. In: Cryptology and Information Security Series, vol. 10, pp. 249\u2013283. IOS Press, Amsterdam (2013)"},{"key":"15_CR24","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. LNCS, vol. 12552, pp. 274\u2013304. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_10"},{"key":"15_CR25","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. CoRR, abs\/2105.10386 (2021)"},{"issue":"1","key":"15_CR26","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":"1","key":"15_CR27","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."},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Witsenhausen, H.: The zero-error side information problem and chromatic numbers (corresp.). IEEE Trans. Inf. Theory 22(5), 592\u2013593 (1976)","DOI":"10.1109\/TIT.1976.1055607"},{"issue":"2","key":"15_CR29","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/TIT.1975.1055346","volume":"21","author":"AD Wyner","year":"1975","unstructured":"Wyner, A.D.: The common information of two dependent random variables. IEEE Trans. Inf. Theory 21(2), 163\u2013179 (1975)","journal-title":"IEEE Trans. Inf. Theory"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:11Z","timestamp":1766278931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22365-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223648","9783031223655"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22365-5_15","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"}]}}