Name
Abstract | ||
|---|---|---|
Secure Multi-Party Computation (MPC) allows mutually distrusting parties to run joint computations without revealing private data. Current MPC algorithms scale poorly with data size, which makes MPC on "big data" prohibitively slow and inhibits its practical use.
Many relational analytics queries can maintain MPC's end-to-end security guarantee without using cryptographic MPC techniques for all operations. Conclave is a query compiler that accelerates such queries by transforming them into a combination of data-parallel, local cleartext processing and small MPC steps. When parties trust others with specific subsets of the data, Conclave applies new hybrid MPC-cleartext protocols to run additional steps outside of MPC and improve scalability further.
Our Conclave prototype generates code for cleartext processing in Python and Spark, and for secure MPC using the Sharemind and Obliv-C frameworks. Conclave scales to data sets between three and six orders of magnitude larger than state-of-the-art MPC frameworks support on their own. Thanks to its hybrid protocols and additional optimizations, Conclave also substantially outperforms SMCQL, the most similar existing system.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3302424.3303982 | Proceedings of the Fourteenth EuroSys Conference 2019 |
DocType | ISBN | Citations |
Conference | 978-1-4503-6281-8 | 4 |
PageRank | References | Authors |
0.40 | 52 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikolaj Volgushev | 1 | 20 | 3.46 |
| Malte Schwarzkopf | 2 | 575 | 32.18 |
| Ben Getchell | 3 | 4 | 0.40 |
| Mayank Varia | 4 | 110 | 15.89 |
| Andrei Lapets | 5 | 75 | 10.53 |
| Azer Bestavros | 6 | 3791 | 764.82 |