all InfoSec news
Secure Maximum Weight Matching Approximation on General Graphs
Sept. 9, 2022, 3:42 p.m. |
IACR News www.iacr.org
ePrint Report: Secure Maximum Weight Matching Approximation on General Graphs
Andreas Brüggemann, Malte Breuer, Andreas Klinger, Thomas Schneider, Ulrike Meyer
Privacy-preserving protocols for matchings on general graphs can be used for applications such as online dating, bartering, or kidney donor exchange. In addition, they can act as a building blocks for more complex protocols. While privacy preserving protocols for matchings on bipartite graphs are a well-researched topic, the case of general graphs has experienced significantly less attention so far. We …
More from www.iacr.org / IACR News
Warsaw IACR Summer School on Post-Quantum Cryptography
1 day, 8 hours ago |
www.iacr.org
ICMS ZKP Workshop: Foundations and Applications of Zero-Knowledge Proofs
2 days, 8 hours ago |
www.iacr.org
RWC 2025: Real World Crypto Symposium
2 days, 8 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Cyber Systems Administration
@ Peraton | Washington, DC, United States
Android Security Engineer, Public Sector
@ Google | Reston, VA, USA
Lead Electronic Security Engineer, CPP - Federal Facilities - Hybrid
@ Black & Veatch | Denver, CO, US
Profissional Sênior de Compliance & Validação em TI - Montes Claros (MG)
@ Novo Nordisk | Montes Claros, Minas Gerais, BR
Principal Engineer, Product Security Engineering
@ Google | Sunnyvale, CA, USA