Core Concepts
LINQ introduces a join protocol with linear complexity for secure query processing, outperforming existing protocols.
Abstract
The article introduces LINQ, a novel join protocol under the secure multi-party computation model. LINQ supports free-connex queries efficiently, achieving linear complexity in both running time and communication. The authors present technical insights into the challenges of executing queries involving multiple relations owned by different parties. By combining hash-sort-merge-join algorithms, LINQ achieves significant performance improvements over state-of-the-art protocols. Experimental results demonstrate LINQ's superiority in query processing efficiency.
Introduction
Secure Multi-Party Computation (MPC) transforms from theory to practice.
Collaborative analysis without sharing private data is enabled.
Example Scenario
Collaborative analysis across insurance, medical, and banking sectors.
Select-join-aggregate query executed securely on private data.
Technical Challenges
Join operator complexities in MPC settings.
Achieving linear time complexity for free-connex queries.
Contributions
Introduction of LINQ as the first linear complexity query processing protocol under 3PC model.
Support for all free-connex queries efficiently.
Join Protocol Details
Consistent sort based on hash functions for efficient sorting.
Extension to support multi-way joins and group-by-aggregation operations.
Performance Evaluation
Experimental results show significant performance gains over existing protocols.
Comparison with Prior Works
LINQ achieves linear complexity compared to nested-loop and sort-merge-join algorithms.
Future Implications
Bringing MPC query processing closer to practicality with improved efficiency.
Stats
LINQ brings MPC query processing closer to practicality by finishing a query on three relations with an output size of 1 million tuples in around 100s in the LAN setting.