2000 character limit reached
Secure Query Processing with Linear Complexity
Published 20 Mar 2024 in cs.CR and cs.DB | (2403.13492v2)
Abstract: 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.
- Secure graph analysis at scale. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, page 610–629. Association for Computing Machinery, 2021.
- Efficient secure three-party sorting with applications to data analysis and heavy hitters. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, page 125–138. Association for Computing Machinery, 2022.
- Secure statistical analysis on multiple datasets: Join and group-by. In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, page 3298–3312, 2023.
- Faq: Questions asked frequently. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, page 13–28, 2016.
- On acyclic conjunctive queries and constant delay enumeration. In Jacques Duparc and Thomas A. Henzinger, editors, Computer Science Logic, pages 208–222, Berlin, Heidelberg, 2007. Springer Berlin Heidelberg.
- Secret-shared joins with multiplicity from aggregation trees. In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, page 209–222. Association for Computing Machinery, 2022.
- Smcql: Secure querying for federated databases. Proceedings of the VLDB Endowment, 10(6):673–684, 2017.
- Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, page 1–10, 1988.
- Ran Canetti. Security and composition of multiparty cryptographic protocols. J. Cryptol., 13(1):143–202, jan 2000.
- Secret-shared shuffle. In Advances in Cryptology – ASIACRYPT 2020, pages 342–372, 2020.
- David Chaum. Blind Signature System, pages 153–153. 1984.
- A Pragmatic Introduction to Secure Multi-Party Computation. 2018.
- How to play any mental game. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, page 218–229, 1987.
- Practically efficient multi-party sorting protocols from comparison sort algorithms. In Information Security and Cryptology – ICISC 2012, pages 202–216, 2013.
- Scape: Scalable collaborative analytics system on private database with malicious security. In 2022 IEEE 38th International Conference on Data Engineering (ICDE), pages 1740–1753, 2022.
- Ajar: Aggregations and joins over annotated relations. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, page 91–106, 2016.
- Marcel Keller. Mp-spdz: A versatile framework for multi-party computation. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, page 1575–1590, 2020.
- Rev2: Fraudulent user prediction in rating platforms. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pages 333–341. ACM, 2018.
- Efficient oblivious database joins. Proc. VLDB Endow., 13(12):2132–2145, 2020.
- Edge weight prediction in weighted signed networks. In Data Mining (ICDM), 2016 IEEE 16th International Conference on, pages 221–230. IEEE, 2016.
- Parallel prefix computation. J. ACM, 27(4):831–838, 1980.
- SECRECY: secure collaborative analytics in untrusted clouds. In Mahesh Balakrishnan and Manya Ghobadi, editors, 20th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2023, Boston, MA, April 17-19, 2023, pages 1031–1056. USENIX Association, 2023.
- Dániel Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. J. ACM, 60(6), nov 2013.
- Aby3: A mixed protocol framework for machine learning. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, page 35–52. Association for Computing Machinery, 2018.
- Fast database joins and psi for secret shared data. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, page 1271–1287. Association for Computing Machinery, 2020.
- Size bounds for factorised representations of query results. ACM Trans. Database Syst., 40(1), mar 2015.
- Senate: A maliciously-secure MPC platform for collaborative analytics. In Proceedings of the 30th Conference on USENIX Security Symposium, 2021.
- Yilei Wang and Ke Yi. Secure yannakakis: Join-aggregate queries over private data. In Proceedings of the 2021 International Conference on Management of Data, page 1969–1981. Association for Computing Machinery, 2021.
- Yilei Wang and Ke Yi. Query evaluation by circuits. In Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, page 67–78. Association for Computing Machinery, 2022.
- Mihalis Yannakakis. Algorithms for acyclic database schemes. In Proceedings of the Seventh International Conference on Very Large Data Bases - Volume 7, page 82–94. VLDB Endowment, 1981.
- Andrew C Yao. Protocols for secure computations. In 23rd Annual Symposium on Foundations of Computer Science, pages 160–164. IEEE, 1982.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.