{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:54Z","timestamp":1766281014885,"version":"3.41.0"},"publisher-location":"Cham","reference-count":31,"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_28","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:09:51Z","timestamp":1653696591000},"page":"797-827","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Secure Non-interactive Reduction and\u00a0Spectral Analysis of\u00a0Correlations"],"prefix":"10.1007","author":[{"given":"Pratyush","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Varun","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shreya","family":"Pathak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Prabhakaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7505-5303","authenticated-orcid":false,"given":"Vinod M.","family":"Prabhakaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Ali","family":"Rehan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Narayanan, V., Pathak, S., Prabhakaran, M., Prabhakaran, V.M., Rehan, M.A.: Secure non-interactive reduction and spectral analysis of correlations. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-07082-2_28"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-40041-4_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Agrawal","year":"2013","unstructured":"Agrawal, S., Prabhakaran, M.: On fair exchange, fair coins and fair sampling. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 259\u2013276. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_15"},{"issue":"6","key":"28_CR3","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1214\/aop\/1176995937","volume":"4","author":"R Ahlswede","year":"1976","unstructured":"Ahlswede, R., Gacs, P.: Spreading of sets in product spaces and hypercontraction of the Markov operator. Ann. Probab. 4(6), 925\u2013939 (1976)","journal-title":"Ann. Probab."},{"key":"28_CR4","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":"28_CR5","doi-asserted-by":"crossref","unstructured":"Beigi, S., Gohari, A.: On the duality of additivity and tensorization. In: ISIT, pp. 2381\u20132385. IEEE (2015)","DOI":"10.1109\/ISIT.2015.7282882"},{"key":"28_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":"28_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"},{"key":"28_CR8","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, 225\u2013234 (1982)","journal-title":"Mathematische Zeitschrift"},{"key":"28_CR9","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":"28_CR10","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":"28_CR11","volume-title":"Spectral Graph Theory","author":"FRK Chung","year":"1997","unstructured":"Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, USA (1997)"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"De, A., Mossel, E., Neeman, J.: Non interactive simulation of correlated distributions is decidable. In: SODA 2018, pp. 2728\u20132746. SIAM (2018)","DOI":"10.1137\/1.9781611975031.174"},{"issue":"2","key":"28_CR13","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":"28_CR14","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"},{"key":"28_CR15","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 Computer Society (2016)","DOI":"10.1109\/FOCS.2016.65"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: STOC, pp. 218\u2013229 (1987). See [?, Chap. 7] Goldreich04book for more details","DOI":"10.1145\/28395.28420"},{"key":"28_CR17","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\u2014CRYPTO 1987","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":"28_CR18","doi-asserted-by":"crossref","unstructured":"Hirschfeld, H.O., Wishart, J.: A connection between correlation and contingency. In: Proceedings of the Cambridge Philosophical Society, vol. 31, no. 4, p. 520 (1935)","DOI":"10.1017\/S0305004100013517"},{"key":"28_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in Matrix Analysis","author":"RA Horn","year":"1991","unstructured":"Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991)"},{"key":"28_CR20","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":"28_CR21","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":"28_CR22","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":"28_CR23","unstructured":"Khorasgani, H.A., Maji, H.K., Nguyen, H.H.: Secure non-interactive simulation: feasibility & rate. In: CRYPTO (2022). To appear"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"28_CR25","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":"28_CR26","unstructured":"Maji, H., Prabhakaran, M., Rosulek, M.: Complexity of multi-party computation functionalities, volume 10 of cryptology and information security series, pp. 249\u2013283. IOS Press, Amsterdam (2013)"},{"key":"28_CR27","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":"28_CR28","doi-asserted-by":"crossref","unstructured":"R\u00e8nyi, A.: On measures of dependence. Acta Mathematica Hungarica 10(3\u20134), 441\u2013451 (1959)","DOI":"10.1007\/BF02024507"},{"issue":"1","key":"28_CR29","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":"28_CR30","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":"28_CR31","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","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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:03:14Z","timestamp":1748383394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07082-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031070815","9783031070822"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07082-2_28","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)"}}]}}