{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T20:19:00Z","timestamp":1790626740448,"version":"4.1.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030269500","type":"print"},{"value":"9783030269517","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26951-7_3","type":"book-chapter","created":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T19:02:47Z","timestamp":1565290967000},"page":"61-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kasper Green","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"issue":"2","key":"3_CR1","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":"3_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-319-96878-0_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"I Cascudo","year":"2018","unstructured":"Cascudo, I., Cramer, R., Xing, C., Yuan, C.: Amortized complexity of information-theoretically secure MPC revisited. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 395\u2013426. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_14"},{"issue":"4","key":"3_CR4","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":"3_CR5","unstructured":"Couteau, G.: A note on the communication complexity of multiparty computation in the correlated randomness model. Cryptology ePrint Archive, Report 2018\/465 (2018)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-85174-5_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J.B., Smith, A.D.: Scalable multiparty computation with nearly optimal work and resilience. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 241\u2013261. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_14"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-662-49896-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"I Damg\u00e5rd","year":"2016","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Ostrovsky, R., Ros\u00e9n, A.: Unconditionally secure computation with reduced interaction. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 420\u2013447. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_15"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-662-53008-5_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"I Damg\u00e5rd","year":"2016","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Polychroniadou, A., Raskin, M.A.: On the communication required for unconditionally secure multiplication. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 459\u2013488. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_16"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1109\/18.669255","volume":"44","author":"I Damg\u00e5rd","year":"1998","unstructured":"Damg\u00e5rd, I., Pedersen, T.P., Pfitzmann, B.: Statistical secrecy and multibit commitments. IEEE Trans. Inf. Theory 44(3), 1143\u20131151 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-662-44381-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Data","year":"2014","unstructured":"Data, D., Prabhakaran, M.M., Prabhakaran, V.M.: On the communication complexity of secure computation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 199\u2013216. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_12"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract), pp. 554\u2013563 (1994)","DOI":"10.1145\/195058.195408"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract), pp. 699\u2013710 (1992)","DOI":"10.1145\/129712.129780"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"G\u00e1l, A., Ros\u00e9n, A.: Lower bounds on the amount of randomness in private computation, pp. 659\u2013666 (2003)","DOI":"10.1145\/780542.780638"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-36594-2_34","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2013","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the power of correlated randomness in secure computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 600\u2013620. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_34"},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S0895480196306130","volume":"10","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Mansour, Y.: Randomness in private computations. SIAM J. Discrete Math. 10(4), 647\u2013661 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ros\u00e9n, A.: A randomnesss-rounds tradeoff in private computation, pp. 397\u2013410 (1994)","DOI":"10.1007\/3-540-48658-5_36"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0405021","volume":"5","author":"E Kushilevitz","year":"1992","unstructured":"Kushilevitz, E.: Privacy and communication complexity. SIAM J. Discrete Math. 5(2), 273\u2013284 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Wegener, I.: The complexity of Boolean functions (1987). https:\/\/eccc.weizmann.ac.il\/static\/books\/The_Complexity_of_Boolean_Functions\/","DOI":"10.1007\/3-540-18170-9_185"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26951-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:25:10Z","timestamp":1710332710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26951-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030269500","9783030269517"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26951-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2019\/","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":"IACR websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"378","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":"81","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":"21% - 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":"22","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)"}}]}}