LORELEI: Locally Rewriting Logic with Ensemble Improvements
Master Thesis
Motivation
Many highly-efficient, but generic MPC protocols reside in specific domains such as arithmetic secret sharing, binary secret sharing, or garbled circuits. Mixing domains and protocols, trying to use the optimal primitives from different domains for each building block of a function, was shown to substantially improve the performance of MPC [1] with many state-of-the-art protocols adapting such techniques. But even without completely switching domains, protocols such as [2,3] internally utilize some intermediate domain during multiplications/ANDs which was later shown useful to compute some functions, e.g., dot products, even more efficiently. The more recent protocols ABY2.0 [4] and ASTRA [5] do not only inherit this behaviour, but can also combine it with multi fan-in multiplications to, e.g., compute lookup tables more efficiently [6]. Yet, in contrast to well-researched domain switching as in [1], the intermediate domain is only used inside low-level building blocks for special functions instead of using its more general power.
Goal
The goal of this thesis is trying to utilize the aforementioned power to a larger extent. First, the priorly implicitly handled intermediate domain has to be made explicit, considering it already for a function/circuit definition. Then, similar to prior protocol mixing works such as Silph [7], it becomes crucial to develop automated tools to optimize protocol performance by function/circuit restructuring to better utilize the newly gained freedom. Concretely, the protocols ABY2.0 [4] and ASTRA [5] shall be considered and extended, followed by an analysis of how well the novel techniques are able to improve their performance, compared to the original as well as improvements such as [6] that should be superseded by the new approach.
Requirements
- Experience in working with MPC
- Experience in term rewriting and discrete optimization
- Good programming skills in C++ or Rust
- High motivation & ability to work independently
- Knowledge of the English language, Git, LaTeX, etc.
References
- [1] D. Demmler, T. Schneider, and M. Zohner. (opens in new tab) In NDSS, 2015. ABY – A Framework for Efficient Mixed-Protocol Secure Two-Party Computation.
- [2] M. Ben-Or, S. Goldwasser, and A. Wigderson. In STOC, 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation.
- [3] T. Araki, J. Furukawa, Y. Lindell, A. Nof, and K. Ohara. (opens in new tab) In CCS, 2016. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority.
- [4] A. Patra, T. Schneider, A. Suresh, and H. Yalame. (opens in new tab) In USENIX Security, 2021. ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation.
- [5] H. Chaudhari, A. Choudhury, A. Patra, and A. Suresh. In CCSW@CCS, 2019. ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction.
- [6] A. Brüggemann, R. Hundt, T. Schneider, A. Suresh, and H. Yalame. (opens in new tab) In S&P, 2023. FLUTE: Fast and Secure Lookup Table Evaluations.
- [7] E. Chen, J. Zhu, A. Ozdemir, R. S. Wahby, F. Brown, and W. Zhen. (opens in new tab) In S&P, 2023. Silph: A Framework for Scalable and Accurate Generation of Hybrid MPC Protocols.
Supervisors
