{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:42:38Z","timestamp":1755999758421,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T00:00:00Z","timestamp":1718755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["2236\/2"],"award-info":[{"award-number":["2236\/2"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,19]]},"DOI":"10.1145\/3626232.3653258","type":"proceedings-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T18:20:25Z","timestamp":1718043625000},"page":"7-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Estimating the Runtime and Global Network Traffic of SMPC Protocols"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0896-9110","authenticated-orcid":false,"given":"Andreas","family":"Klinger","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0031-8988","authenticated-orcid":false,"given":"Vincent","family":"Ehrmanntraut","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2569-1042","authenticated-orcid":false,"given":"Ulrike","family":"Meyer","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2024,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/DESEC.2017.8073798"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"Ethan Blanton Vern Paxson and Mark Allman. 2009. TCP Congestion Control. RFC 5681. https:\/\/doi.org\/10.17487\/RFC5681","DOI":"10.17487\/RFC5681"},{"volume-title":"Computer Security -- ESORICS 2015 (Lecture Notes in Computer Science)","author":"Blanton Marina","key":"e_1_3_2_1_3_1","unstructured":"Marina Blanton and Siddharth Saraph. 2015. Oblivious Maximum Bipartite Matching Size Algorithm with Applications to Secure Fingerprint Identification. In Computer Security -- ESORICS 2015 (Lecture Notes in Computer Science). Springer International Publishing, 384--406."},{"key":"e_1_3_2_1_4_1","volume-title":"Ivan Damg\u00e5rd, Martin Geisler, Thomas Jakobsen, Mikkel Kr\u00f8igaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael Schwartzbach, and Tomas Toft.","author":"Bogetoft Peter","year":"2009","unstructured":"Peter Bogetoft, Dan Lund Christensen, Ivan Damg\u00e5rd, Martin Geisler, Thomas Jakobsen, Mikkel Kr\u00f8igaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael Schwartzbach, and Tomas Toft. 2009. Secure Multiparty Computation Goes Live. In Financial Cryptography and Data Security (Lecture Notes in Computer Science). Springer, 325--343."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2866575"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243786"},{"key":"e_1_3_2_1_7_1","volume-title":"EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning. In 2019 IEEE European Symposium on Security and Privacy (EuroS&P). 496--511","author":"Chandran Nishanth","year":"2019","unstructured":"Nishanth Chandran, Divya Gupta, Aseem Rastogi, Rahul Sharma, and Shardul Tripathi. 2019. EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning. In 2019 IEEE European Symposium on Security and Privacy (EuroS&P). 496--511."},{"key":"e_1_3_2_1_8_1","volume-title":"Silph: A Framework for Scalable and Accurate Generation of Hybrid MPC Protocols.","author":"Chen Edward","year":"2023","unstructured":"Edward Chen, Jinhao Zhu, Alex Ozdemir, Riad S. Wahby, Fraser Brown, and Wenting Zheng. 2023. Silph: A Framework for Scalable and Accurate Generation of Hybrid MPC Protocols."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4108"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Jerry Chu Nandita Dukkipati Yuchung Cheng and Matt Mathis. 2013. Increasing TCP's Initial Window. RFC 6928. https:\/\/doi.org\/10.17487\/RFC6928","DOI":"10.17487\/RFC6928"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP53844.2022.00017"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48989-6_16"},{"volume-title":"Automated Reasoning (Lecture Notes in Computer Science)","author":"Frohn Florian","key":"e_1_3_2_1_13_1","unstructured":"Florian Frohn and J\u00fcrgen Giesl. 2022. Proving Non-Termination and\u00a0Lower Runtime Bounds with\u00a0LoAT (System Description). In Automated Reasoning (Lecture Notes in Computer Science). Springer International Publishing, 712--722."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3410331"},{"volume-title":"Foundations of Cryptography: Basic Applications","author":"Goldreich Oded","key":"e_1_3_2_1_15_1","unstructured":"Oded Goldreich. 2004. Foundations of Cryptography: Basic Applications. Cambridge University Press."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11889663_5"},{"key":"e_1_3_2_1_17_1","volume-title":"Porter","author":"Gujarati Damodar N.","year":"2009","unstructured":"Damodar N. Gujarati and Dawn C. Porter. 2009. Basic econometrics. McGraw-Hill Irwin."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--44618--9_9"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"volume-title":"MPC for the Real World: Improving Performance and Usability via Program Analysis, and Applications to Decentralized Finance. Ph.,D. Dissertation","author":"Ishaq Muhammad","key":"e_1_3_2_1_20_1","unstructured":"Muhammad Ishaq. 2023. MPC for the Real World: Improving Performance and Usability via Program Analysis, and Applications to Decentralized Finance. Ph.,D. Dissertation. Purdue University Graduate School."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339818"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417872"},{"volume-title":"Applied Cryptography and Network Security (Lecture Notes in Computer Science)","author":"Kerschbaum Florian","key":"e_1_3_2_1_23_1","unstructured":"Florian Kerschbaum, Thomas Schneider, and Axel Schr\u00f6pfer. 2014. Automatic Protocol Selection in Secure Two-Party Computations. In Applied Cryptography and Network Security (Lecture Notes in Computer Science). Springer International Publishing, 566--584."},{"key":"e_1_3_2_1_24_1","volume-title":"Ross","author":"Kurose James F.","year":"2013","unstructured":"James F. Kurose and Keith W. Ross. 2013. Computer networking: a top-down approach. Pearson."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623181"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935065"},{"volume-title":"Data and Applications Security and Privacy XXX (Lecture Notes in Computer Science)","author":"Pattuk Erman","key":"e_1_3_2_1_27_1","unstructured":"Erman Pattuk, Murat Kantarcioglu, Huseyin Ulusoy, and Bradley Malin. 2016. CheapSMC: A Framework to Minimize Secure Multiparty Computation Cost in the Cloud. In Data and Applications Security and Privacy XXX (Lecture Notes in Computer Science). Springer International Publishing, 285--294."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2011.33"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2104.01281"},{"volume-title":"Financial Cryptography and Data Security (Lecture Notes in Computer Science)","author":"Toft Tomas","key":"e_1_3_2_1_31_1","unstructured":"Tomas Toft. 2009. Solving Linear Programs Using Multiparty Computation. In Financial Cryptography and Data Security (Lecture Notes in Computer Science). Springer, 90--107."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","unstructured":"Lisong Xu Sangtae Ha Injong Rhee Vidhi Goel and Lars Eggert. 2023. CUBIC for Fast and Long-Distance Networks. RFC 9438. https:\/\/doi.org\/10.17487\/RFC9438","DOI":"10.17487\/RFC9438"}],"event":{"name":"CODASPY '24: Fourteenth ACM Conference on Data and Application Security and Privacy","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Porto Portugal","acronym":"CODASPY '24"},"container-title":["Proceedings of the Fourteenth ACM Conference on Data and Application Security and Privacy"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626232.3653258","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626232.3653258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T19:50:24Z","timestamp":1755892224000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626232.3653258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,19]]},"references-count":32,"alternative-id":["10.1145\/3626232.3653258","10.1145\/3626232"],"URL":"https:\/\/doi.org\/10.1145\/3626232.3653258","relation":{},"subject":[],"published":{"date-parts":[[2024,6,19]]},"assertion":[{"value":"2024-06-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}