Explore a conference talk on secure stable matching algorithms presented at the 23rd ACM Conference on Computer and Communications Security. Delve into the authors' research on privacy-preserving techniques for stable matching problems at scale. Learn about the challenges of maintaining preference privacy, the concept of secure computation, and innovative approaches like Oblivious Linked Lists and Oblivious Linked Multilists. Understand the complexity and real costs associated with these algorithms, including linear scan methods and Yao Gates. Discover the main contributions of this research, potential caveats, and future directions in the field of secure stable matching.
Overview
Syllabus
Intro
Stable Matchings
Privacy of Preferences
Secure computation?
What is the problem?
What can we do better?
Necessary functionality
Oblivious Linked List
Oblivious Linked Multilist
Complexity and Real Cost Linear Scan
Real Cost (Yao Gates)
Main Contributions
Caveats and Next Steps
Secret Sharing
Taught by
ACM CCS
Related Courses
-
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
-
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
-
Amortizing Secure Computation with Penalties
-
Efficient Batched Oblivious PRF with Applications to Private Set Intersection
-
Improvements to Secure Computation
