Efficient Actively Secure Multi-Party Computation for RAM Programs
Kun Xiong, Wenfang Zhang, Muhammad Khurram Khan
Cloud platforms offer innovative solutions for data processing, and privacy concerns arising from this can be addressed through secure multi-party computation (MPC). MPC in the random access machine (RAM) model leverages Oblivious RAM (ORAM) to conceal memory access patterns, rendering it more suitable for data storage and aggregation in cloud environments, where cloud servers can infer user privacy based on observed access patterns. However, most existing RAM-based MPC protocols only ensure semi-honest security; the few actively secure alternatives have limitations in efficiency or input leakage. To address this gap, this paper proposes an efficient active-secure RAM-based MPC protocol without input leakage. Specifically, we first present a new actively secure, reactive MPC protocol with communication of 2(n−1) bits per gate. As the building blocks, we design the (i) multi-party distributed BitGC garbling scheme and (ii) multi-party somewhat homomorphic encryption (SWHE) scheme with distributed decryption. In particular, we then build a RAM-based MPC protocol on top of the above new building blocks with Circuit ORAM and present the check mechanism to achieve secure memory accesses. The implementation shows that our protocol outperforms the prior actively secure RAM-based MPC without leakage by one to two orders of magnitude in both LAN and WAN networks. Compared with the state-of-the-art actively secure RAM-based 2PC with one bit leakage, ours is slightly less efficient in most cases (not all), but supports the multi-party setting and offers a superior alternative for highly confidential environments.
IEEE Transactions on Cloud Computing•Jan 1, 2026•0 citations