{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:50:30Z","timestamp":1776955830768,"version":"3.51.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031159848","type":"print"},{"value":"9783031159855","type":"electronic"}],"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-15985-5_17","type":"book-chapter","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T20:02:37Z","timestamp":1665432157000},"page":"483-513","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tight Bounds on\u00a0the\u00a0Randomness Complexity of\u00a0Secure Multiparty Computation"],"prefix":"10.1007","author":[{"given":"Vipul","family":"Goyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifan","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,11]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-96878-0_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"P Ananth","year":"2018","unstructured":"Ananth, P., Ishai, Y., Sahai, A.: Private circuits: a modular approach. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 427\u2013455. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_15"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/978-3-662-49896-5_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Andrychowicz","year":"2016","unstructured":"Andrychowicz, M., Dziembowski, S., Faust, S.: Circuit compilers with $$O(1\/\\log (n))$$ leakage rate. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 586\u2013615. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_21"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Barthe, G., et al.: Strong non-interference and type-directed higher-order masking. In: ACM CCS 2016, pp. 116\u2013129 (2016)","DOI":"10.1145\/2976749.2978427"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"JC Benaloh","year":"1987","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret secret (extended abstract). In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251\u2013260. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_19"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s000370050025","volume":"8","author":"C Blundo","year":"1999","unstructured":"Blundo, C., De Santis, A., Persiano, G., Vaccaro, U.: Randomness complexity of private computation. Comput. Complex. 8(2), 145\u2013168 (1999)","journal-title":"Comput. Complex."},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10207-006-0007-5","volume":"6","author":"C Blundo","year":"2007","unstructured":"Blundo, C., Galdi, C., Persiano, G.: Low-randomness constant-round private XOR computations. Int. J. Inf. Sec. 6(1), 15\u201326 (2007)","journal-title":"Int. J. Inf. Sec."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Bonawitz, K.A., et al.: Practical secure aggregation for privacy-preserving machine learning. In: CCS 2017, pp. 1175\u20131191 (2017)","DOI":"10.1145\/3133956.3133982"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s001459910005","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R., Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Randomness versus fault-tolerance. J. Cryptol. 13(1), 107\u2013142 (2000). https:\/\/doi.org\/10.1007\/s001459910005","journal-title":"J. Cryptol."},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: STOC 1988, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., Hasted, J., Freidmann, J., Rudich, S., Smolensky, R.: The bit extraction problem or t-resilient functions. In: FOCS 1985, pp. 396\u2013407 (1985)","DOI":"10.1109\/SFCS.1985.55"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(93)90120-X","volume":"45","author":"B Chor","year":"1993","unstructured":"Chor, B., Kushilevitz, E.: A communication-privacy tradeoff for modular addition. Inf. Process. Lett. 45(4), 205\u2013210 (1993)","journal-title":"Inf. Process. Lett."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-45727-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"J-S Coron","year":"2020","unstructured":"Coron, J.-S., Greuet, A., Zeitoun, R.: Side-channel masking with pseudo-random generator. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 342\u2013375. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_12"},{"key":"17_CR15","unstructured":"Corrigan-Gibbs, H., Boneh, D.: Prio: private, robust, and scalable computation of aggregate statistics. In: USENIX NSDI 2017, pp. 259\u2013282 (2017)"},{"issue":"7","key":"17_CR16","doi-asserted-by":"publisher","first-page":"3901","DOI":"10.1109\/TIT.2016.2568207","volume":"62","author":"D Data","year":"2016","unstructured":"Data, D., Prabhakaran, V.M., Prabhakaran, M.M.: Communication and randomness lower bounds for secure computation. IEEE Trans. Inf. Theor. 62(7), 3901\u20133929 (2016)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-319-70694-8_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"S Faust","year":"2017","unstructured":"Faust, S., Paglialonga, C., Schneider, T.: Amortizing randomness complexity in private circuits. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 781\u2013810. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_27"},{"issue":"5","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1137\/S0097539701385296","volume":"31","author":"A G\u00e1l","year":"2002","unstructured":"G\u00e1l, A., Ros\u00e9n, A.: A theorem on sensitivity and applications in private computation. SIAM J. Comput. 31(5), 1424\u20131437 (2002)","journal-title":"SIAM J. Comput."},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Goyal, V., Ishai, Y., Song, Y.: Private circuits with\u00a0quasilinear randomness. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 192\u2013221. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_8","DOI":"10.1007\/978-3-031-07082-2_8"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ishai, Y., Song, Y.: Tight bounds on the randomness complexity of secure multiparty computation. Cryptology ePrint Archive, Paper 2022\/799 (2022). https:\/\/eprint.iacr.org\/2022\/799","DOI":"10.1007\/978-3-031-15985-5_17"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"G\u00e1l, A., Ros\u00e9n, A.: $$\\varOmega (\\log n)$$ lower bounds on the amount of randomness in 2-private computation. SIAM J. Comput. 34(4), 946\u2013959 (2005). Earlier version in STOC 2003","DOI":"10.1137\/S0097539703432785"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-642-39206-1_49","volume-title":"Automata, Languages, and Programming","author":"Y Ishai","year":"2013","unstructured":"Ishai, Y., et al.: Robust pseudorandom generators. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 576\u2013588. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_49"},{"issue":"18","key":"17_CR23","doi-asserted-by":"publisher","first-page":"1730","DOI":"10.1016\/j.tcs.2008.12.062","volume":"410","author":"Y Ishai","year":"2009","unstructured":"Ishai, Y., Malkin, T., Strauss, M.J., Wright, R.N.: Private multiparty sampling and approximation of vector combinations. Theor. Comput. Sci. 410(18), 1730\u20131745 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_27"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-36494-3_12","volume-title":"STACS 2003","author":"A Jakoby","year":"2003","unstructured":"Jakoby, A., Li\u015bkiewicz, M., Reischuk, R.: Private computations in networks: topology versus randomness. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 121\u2013132. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36494-3_12"},{"key":"17_CR26","unstructured":"Knuth, D., Yao, A.: The complexity of nonuniform random number generation. In: Algorithms and Complexity: New Directions and Recent Results. Academic Press (1976)"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Mansour, Y.: Randomness in Private Computations. SIAM J. Discrete Math. 10(4), 647\u2013661 (1997). Earlier version in PODC 1996","DOI":"10.1137\/S0895480196306130"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Prouff, E., Ros\u00e9n, A., Thillard, A., Vergnaud, D.: Lower and upper bounds on the randomness complexity of private computations of AND. SIAM J. Discret. Math. 35(1), 465\u2013484 (2021). Earlier version in TCC 2019","DOI":"10.1137\/20M1314197"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Characterizing linear size circuits in terms of privacy. In: STOC 1996, pp. 541\u2013550 (1996)","DOI":"10.1145\/237814.238002"},{"issue":"4","key":"17_CR30","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/S089548010135274X","volume":"16","author":"E Kushilevitz","year":"2003","unstructured":"Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Amortizing randomness in private multiparty computations. SIAM J. Discrete Math. 16(4), 533\u2013544 (2003)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"17_CR31","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/S089548019427634X","volume":"11","author":"E Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Ros\u00e9n, A.: A randomness-rounds tradeoff in private computation. SIAM J. Discrete Math. 11(1), 61\u201380 (1998)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15985-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:04:36Z","timestamp":1760133876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15985-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159848","9783031159855"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15985-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 October 2022","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}