Proactive MPC with Low Communication*

Feb 1, 2024

*This paper is a work in progress.

It was shown in [GIOZ19] that enforcing sublinear communication complexity in secure multiparty computation affects the feasibility bounds on the number of corrupted parties that can be tolerated in the setting of information-theoretic security.

We provide an investigation of security in the presence of semi-honest and malicious mobile adversaries with erasures. We prove bounds on the corruptions that can be tolerated, which we also show to be essentially optimal.

Student Researcher

I am a junior at UCLA, conducting research in cryptography with a focus on secure multiparty computation and its applications.