{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:20Z","timestamp":1750220060482,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T00:00:00Z","timestamp":1682294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["2236\/2"],"award-info":[{"award-number":["2236\/2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,24]]},"DOI":"10.1145\/3577923.3583654","type":"proceedings-article","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T10:57:59Z","timestamp":1681988279000},"page":"105-116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Preserving Fully Online Matching with Deadlines"],"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\/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":[[2023,4,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0436-0"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/DESEC.2017.8073798"},{"key":"e_1_3_2_1_3_1","volume-title":"Completeness Theorems For Non-Cryptographic Fault-Tolerant Distributed Computation. In Symposium on Theory of Computing. ACM, 1--10","author":"Ben-Or Michael","year":"1988","unstructured":"Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness Theorems For Non-Cryptographic Fault-Tolerant Distributed Computation. In Symposium on Theory of Computing. ACM, 1--10."},{"volume-title":"Computer Security -- ESORICS 2015 (Lecture Notes in Computer Science )","author":"Blanton Marina","key":"e_1_3_2_1_4_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_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3508398.3511509"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_7_1","volume-title":"Universally Composable Security: A New Paradigm for Cryptographic Protocols. In International Conference on Cluster Computing. 136--145","author":"Canetti Ran","year":"2001","unstructured":"Ran Canetti. 2001. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In International Conference on Cluster Computing. 136--145."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3402457"},{"volume-title":"Security and Cryptography for Networks (Lecture Notes in Computer Science )","author":"Catrina Octavian","key":"e_1_3_2_1_9_1","unstructured":"Octavian Catrina and Sebastiaan de Hoogh. 2010. Improved Primitives for Secure Multiparty Integer Computation. In Security and Cryptography for Networks (Lecture Notes in Computer Science ). Springer, 182--199."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029561"},{"key":"e_1_3_2_1_13_1","volume-title":"Online Matching with General Arrivals. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). 26--37","author":"Gamlath Buddhima","year":"2019","unstructured":"Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, and David Wajc. 2019. Online Matching with General Arrivals. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). 26--37."},{"volume-title":"Foundations of Cryptography: Basic Applications","author":"Goldreich Oded","key":"e_1_3_2_1_14_1","unstructured":"Oded Goldreich. 2004. Foundations of Cryptography: Basic Applications. Cambridge University Press."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11889663_5"},{"volume-title":"Formal Aspects in Security and Trust","author":"Heather James","key":"e_1_3_2_1_17_1","unstructured":"James Heather and David Lundin. 2009. The Append-Only Web Bulletin Board. In Formal Aspects in Security and Trust. Springer, 242--256."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188858"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3390890"},{"volume-title":"An Optimal Algorithm for On-line Bipartite Matching. In Symposium on Theory of Computing (STOC '90)","author":"Karp R. M.","key":"e_1_3_2_1_20_1","unstructured":"R. M. Karp, U. V. Vazirani, and V. V. Vazirani. 1990. An Optimal Algorithm for On-line Bipartite Matching. In Symposium on Theory of Computing (STOC '90). ACM, 352--358."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_3_2_1_22_1","volume-title":"Towards Secure Evaluation of Online Functionalities. In The 16th International Conference on Availability, Reliability and Security (ARES","author":"Klinger Andreas","year":"2021","unstructured":"Andreas Klinger and Ulrike Meyer. 2021. Towards Secure Evaluation of Online Functionalities. In The 16th International Conference on Availability, Reliability and Security (ARES 2021). Association for Computing Machinery."},{"key":"e_1_3_2_1_23_1","unstructured":"Andreas Klinger and Ulrike Meyer. 2022. Towards Secure Evaluation of Online Functionalities (Corrected and Extended Version). Cryptology ePrint Archive Paper 2022\/1755."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935065"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"volume-title":"Financial Cryptography and Data Security (Lecture Notes in Computer Science )","author":"Toft Tomas","key":"e_1_3_2_1_26_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_27_1","volume-title":"Using Secure Graph Algorithms for the Privacy-Preserving Identification of Optimal Bartering Opportunities. In Workshop on Privacy in the Electronic Society. ACM, 123--132","author":"W\u00fcller Stefan","year":"2017","unstructured":"Stefan W\u00fcller, Michael Vu, Ulrike Meyer, and Susanne Wetzel. 2017. Using Secure Graph Algorithms for the Privacy-Preserving Identification of Optimal Bartering Opportunities. In Workshop on Privacy in the Electronic Society. ACM, 123--132."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"CODASPY '23: Thirteenth ACM Conference on Data and Application Security and Privacy","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Charlotte NC USA","acronym":"CODASPY '23"},"container-title":["Proceedings of the Thirteenth ACM Conference on Data and Application Security and Privacy"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3577923.3583654","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3577923.3583654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:41Z","timestamp":1750183721000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3577923.3583654"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,24]]},"references-count":26,"alternative-id":["10.1145\/3577923.3583654","10.1145\/3577923"],"URL":"https:\/\/doi.org\/10.1145\/3577923.3583654","relation":{},"subject":[],"published":{"date-parts":[[2023,4,24]]},"assertion":[{"value":"2023-04-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}