{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:24:33Z","timestamp":1767338673767,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T00:00:00Z","timestamp":1649894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1646999"],"award-info":[{"award-number":["CCF-1646999"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["419340256"],"award-info":[{"award-number":["419340256"]}],"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":[[2022,4,14]]},"DOI":"10.1145\/3508398.3511509","type":"proceedings-article","created":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T04:13:31Z","timestamp":1650082411000},"page":"53-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Privacy-Preserving Maximum Matching on General Graphs and its Application to Enable Privacy-Preserving Kidney Exchange"],"prefix":"10.1145","author":[{"given":"Malte","family":"Breuer","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Ulrike","family":"Meyer","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[{"name":"Stevens Institute of Technology, Hoboken, NJ, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,4,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250954"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1257\/pandp.20181077"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_21"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/DESEC.2017.8073798"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/restud\/rdz018"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1111\/ajt.14566"},{"volume-title":"Itai Ashlagi and Alvin E Roth","year":"2021","key":"e_1_3_2_1_7_1","unstructured":", Itai Ashlagi and Alvin E Roth . 2021 . Kidney Exchange : An Operations Perspective . Technical Report. National Bureau of Economic Research . , Itai Ashlagi and Alvin E Roth. 2021. Kidney Exchange: An Operations Perspective . Technical Report. National Bureau of Economic Research."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.43.9.842"},{"key":"e_1_3_2_1_10_1","volume-title":"Transplantation","volume":"103","author":"P\u00e9ter Bir\u00f3","year":"2019","unstructured":"P\u00e9ter Bir\u00f3 , Bernadette Haase-Kromwijk , Tommy Andersson , Eyj\u00f3lfur Ingi \u00c1sgeirsson , Tatiana Baltesov\u00e1 , Ioannis Boletis , Catarina Bolotinha , Gregor Bond , Georg B\u00f6hmig , Lisa Burnapp , 2019 a. Building Kidney Exchange Programmes in Europe -- An Overview of Exchange Practice and Activities . Transplantation , Vol. 103 , 7 (2019). P\u00e9ter Bir\u00f3 , Bernadette Haase-Kromwijk, Tommy Andersson, Eyj\u00f3lfur Ingi \u00c1sgeirsson, Tatiana Baltesov\u00e1, Ioannis Boletis, Catarina Bolotinha, Gregor Bond, Georg B\u00f6hmig, Lisa Burnapp, et almbox. 2019 a. Building Kidney Exchange Programmes in Europe -- An Overview of Exchange Practice and Activities. Transplantation , Vol. 103, 7 (2019)."},{"volume-title":"European Journal of Operational Research","author":"Bir\u00f3 P\u00e9ter","key":"e_1_3_2_1_11_1","unstructured":"P\u00e9ter Bir\u00f3 , Joris van de Klundert , David Manlove , William Pettersson , Tommy Andersson , Lisa Burnapp , Pavel Chromy , Pablo Delgado , Piotr Dworczak , Bernadette Haase , et almbox. 2019 b. Modelling and optimisation in european kidney exchange programmes . In European Journal of Operational Research . Elsevier . P\u00e9ter Bir\u00f3, Joris van de Klundert, David Manlove, William Pettersson, Tommy Andersson, Lisa Burnapp, Pavel Chromy, Pablo Delgado, Piotr Dworczak, Bernadette Haase, et almbox. 2019 b. Modelling and optimisation in european kidney exchange programmes. In European Journal of Operational Research. Elsevier."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24174-6_20"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484341"},{"volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Blum Norbert","key":"e_1_3_2_1_14_1","unstructured":"Norbert Blum . 1990. A new approach to maximum matching in general graphs . In International Colloquium on Automata, Languages, and Programming . Springer . Norbert Blum. 1990. A new approach to maximum matching in general graphs. In International Colloquium on Automata, Languages, and Programming. Springer."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47854-7_14"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Malte Breuer Ulrike Meyer and Susanne Wetzel. 2022. Privacy-Preserving Maximum Matching on General Graphs and its Application to Kidney Exchange (Extended Version). arXiv preprint arXiv:2201.06446 .  Malte Breuer Ulrike Meyer and Susanne Wetzel. 2022. Privacy-Preserving Maximum Matching on General Graphs and its Application to Kidney Exchange (Extended Version). arXiv preprint arXiv:2201.06446 .","DOI":"10.1145\/3508398.3511509"},{"key":"e_1_3_2_1_18_1","unstructured":"Malte Breuer Ulrike Meyer and Susanne Wetzel. Source Code. https:\/\/gitlab.com\/rwth-itsec\/crossover-exchange .  Malte Breuer Ulrike Meyer and Susanne Wetzel. Source Code. https:\/\/gitlab.com\/rwth-itsec\/crossover-exchange ."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3411497.3420213"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_13"},{"key":"e_1_3_2_1_21_1","volume-title":"Transplantation","volume":"99","author":"Cole Edward H","year":"2015","unstructured":"Edward H Cole , Peter Nickerson , Patricia Campbell , Kathy Yetzer , Nick Lahaie , Jeffery Zaltzman , and John S Gill . 2015 . The Canadian kidney paired donation program: a national program to increase living donor transplantation . Transplantation , Vol. 99 , 5 (2015). Edward H Cole, Peter Nickerson, Patricia Campbell, Kathy Yetzer, Nick Lahaie, Jeffery Zaltzman, and John S Gill. 2015. The Canadian kidney paired donation program: a national program to increase living donor transplantation. Transplantation , Vol. 99, 5 (2015)."},{"key":"e_1_3_2_1_22_1","unstructured":"DESMOJ DESMO-J. http:\/\/desmoj.sourceforge.net. Accessed 30-Sep-2021.  DESMOJ DESMO-J. http:\/\/desmoj.sourceforge.net. Accessed 30-Sep-2021."},{"key":"e_1_3_2_1_23_1","volume-title":"Management Science","volume":"65","author":"Dickerson John P.","year":"2019","unstructured":"John P. Dickerson , Ariel D. Procaccia , and Tuomas Sandholm . 2019 . Failure-Aware Kidney Exchange . Management Science , Vol. 65 , 4 (2019). John P. Dickerson, Ariel D. Procaccia, and Tuomas Sandholm. 2019. Failure-Aware Kidney Exchange. Management Science , Vol. 65, 4 (2019)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978373"},{"key":"e_1_3_2_1_25_1","volume-title":"Canadian Journal of mathematics","author":"Edmonds Jack","year":"1965","unstructured":", Jack Edmonds . 1965. Paths, Trees, and Flowers. Canadian Journal of mathematics , Vol. 17 ( 1965 ). , Jack Edmonds. 1965. Paths, Trees, and Flowers. Canadian Journal of mathematics , Vol. 17 (1965)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1093\/ndt\/gfu309"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321942"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/115234.115366"},{"volume-title":"Foundations of Cryptography","author":"Goldreich Oded","key":"e_1_3_2_1_29_1","unstructured":", Oded Goldreich . 2004. Foundations of Cryptography : Volume 2 - Basic Applications .Cambridge University Press . , Oded Goldreich. 2004. Foundations of Cryptography: Volume 2 - Basic Applications .Cambridge University Press."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11889663_5"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller. 2020. MP-SPDZ: A Versatile Framework for Multi-Party Computation. In Computer and Communications Security. ACM. Marcel Keller. 2020. MP-SPDZ: A Versatile Framework for Multi-Party Computation. In Computer and Communications Security. ACM.","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45608-8_27"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364556"},{"key":"e_1_3_2_1_34_1","volume-title":"Symposium on Foundations of Computer Science . IEEE.","author":"Micali Silvio","year":"1980","unstructured":"Silvio Micali and Vijay V Vazirani . 1980 . An O($sqrtvert V vert vert E vert $) Algorithm for Finding Maximum Matching in General Graphs . In Symposium on Foundations of Computer Science . IEEE. Silvio Micali and Vijay V Vazirani. 1980. An O($sqrtvert V vert vert E vert $) Algorithm for Finding Maximum Matching in General Graphs. In Symposium on Foundations of Computer Science . IEEE."},{"key":"e_1_3_2_1_35_1","unstructured":"World Health Organization. Top 10 Causes of Death. https:\/\/www.who.int\/news-room\/fact-sheets\/detail\/the-top-10-causes-of-death . Accessed 30-Sep-2021.  World Health Organization. Top 10 Causes of Death. https:\/\/www.who.int\/news-room\/fact-sheets\/detail\/the-top-10-causes-of-death . Accessed 30-Sep-2021."},{"key":"e_1_3_2_1_36_1","volume-title":"Maximales Matching in Graphen. Ausgew\"ahlte Operations Research Software in FORTRAN","author":"Pape U","year":"1980","unstructured":"U Pape and D Conradt . 1980. Maximales Matching in Graphen. Ausgew\"ahlte Operations Research Software in FORTRAN ( 1980 ). U Pape and D Conradt. 1980. Maximales Matching in Graphen. Ausgew\"ahlte Operations Research Software in FORTRAN (1980)."},{"key":"e_1_3_2_1_37_1","unstructured":"Organ Procurement and Transplantation Network. https:\/\/optn.transplant.hrsa.gov\/data\/view-data-reports\/national-data\/. Accessed 30-Sep-2021 .  Organ Procurement and Transplantation Network. https:\/\/optn.transplant.hrsa.gov\/data\/view-data-reports\/national-data\/. Accessed 30-Sep-2021 ."},{"key":"e_1_3_2_1_38_1","first-page":"1","article-title":"Toward Practical Secure Stable Matching","volume":"2017","author":"Riazi M Sadegh","year":"2017","unstructured":"M Sadegh Riazi , Ebrahim M Songhori , Ahmad-Reza Sadeghi , Thomas Schneider , and Farinaz Koushanfar . 2017 . Toward Practical Secure Stable Matching . Proc. Priv. Enhancing Technol. , Vol. 2017 , 1 . M Sadegh Riazi, Ebrahim M Songhori, Ahmad-Reza Sadeghi, Thomas Schneider, and Farinaz Koushanfar. 2017. Toward Practical Secure Stable Matching. Proc. Priv. Enhancing Technol. , Vol. 2017, 1.","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"volume-title":"Discrete Optimization Algorithms with Pascal Programs","author":"Syslo Maciej","key":"e_1_3_2_1_40_1","unstructured":"Maciej Syslo , Narsingh Deo , and Janusz S Kowalik . 1983. Discrete Optimization Algorithms with Pascal Programs . Prentice Hall . Maciej Syslo, Narsingh Deo, and Janusz S Kowalik. 1983. Discrete Optimization Algorithms with Pascal Programs .Prentice Hall."},{"key":"e_1_3_2_1_41_1","volume-title":"Using Secure Graph Algorithms for the Privacy-Preserving Identification of Optimal Bartering Opportunities. Workshop on Privacy in the Electronic Society .","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. Workshop on Privacy in the Electronic Society . Stefan W\u00fcller, Michael Vu, Ulrike Meyer, and Susanne Wetzel. 2017. Using Secure Graph Algorithms for the Privacy-Preserving Identification of Optimal Bartering Opportunities. Workshop on Privacy in the Electronic Society ."}],"event":{"name":"CODASPY '22: Twelveth ACM Conference on Data and Application Security and Privacy","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Baltimore MD USA","acronym":"CODASPY '22"},"container-title":["Proceedings of the Twelfth ACM Conference on Data and Application Security and Privacy"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3508398.3511509","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3508398.3511509","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3508398.3511509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:39Z","timestamp":1750188639000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3508398.3511509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,14]]},"references-count":41,"alternative-id":["10.1145\/3508398.3511509","10.1145\/3508398"],"URL":"https:\/\/doi.org\/10.1145\/3508398.3511509","relation":{},"subject":[],"published":{"date-parts":[[2022,4,14]]},"assertion":[{"value":"2022-04-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}