Secure Query Processing with Linear Complexity
CoRR(2024)
摘要
We present LINQ, the first join protocol with linear complexity (in both
running time and communication) under the secure multi-party computation model
(MPC). It can also be extended to support all free-connex queries, a large
class of select-join-aggregate queries, still with linear complexity. This
matches the plaintext result for the query processing problem, as free-connex
queries are the largest class of queries known to be solvable in linear time in
plaintext. We have then built a query processing system based on LINQ, and the
experimental results show that LINQ significantly outperforms the state of the
art. For example, it can finish a query on three relations with an output size
of 1 million tuples in around 100s in the LAN setting, while existing protocols
that support the query cannot finish in an hour. Thus LINQ brings MPC query
processing closer to practicality.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要