Secure Maximum Weight Matching Approximation on General Graphs-Reference-Cited by-同舟云学术

Secure Maximum Weight Matching Approximation on General Graphs

Published:2022-11-07 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 21st Workshop on Privacy in the Electronic Society
language:
Short-container-title:

Author:

Brüggemann Andreas¹,Breuer Malte²,Klinger Andreas²,Schneider Thomas¹,Meyer Ulrike²

Affiliation:

1. Technical University of Darmstadt, Darmstadt, Germany

2. RWTH Aachen University, Aachen, Germany

Funder

Deutsche Forschungsgemeinschaft

European Research Council

German Federal Ministry of Education and Research and the Hessen State Ministry for Higher Education, Research and the Arts

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3559613.3563209

Reference36 articles.

1. Balamurugan Anandan and Chris Clifton . 2017 . Secure Minimum Weighted Bipartite Matching. In 2017 IEEE Conference on Dependable and Secure Computing. 60--67 . https://doi.org/10.1109/DESEC.2017.8073798 10.1109/DESEC.2017.8073798 Balamurugan Anandan and Chris Clifton. 2017. Secure Minimum Weighted Bipartite Matching. In 2017 IEEE Conference on Dependable and Secure Computing. 60--67. https://doi.org/10.1109/DESEC.2017.8073798

2. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority

3. Secure Graph Analysis at Scale

4. A survey of heuristics for the weighted matching problem

5. 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 ). 384--406. https://doi.org/10.1007/978--3--319--24174--6_20 10.1007/978--3--319--24174--6_20