eprint.iacr.orgpaperTruffle: Maliciously Secure Three-Party Shuffles with Applications to Parsing
Truffle is a new three-party maliciously secure shuffle protocol for secure multiparty computation (MPC), matching semi-honest round complexity while adding only sublinear communication via a distributed-verifier zero-knowledge proof checking shuffle correctness. Authors Nidhish Bhimrajka, Yashvanth Kondi, Daniel Noble, and Bhavish Raj Gopal implement and benchmark it, applying it to securely parsing secret-shared strings, with further applications to graph analytics, anonymous communication, Distributed ORAM, aggregate statistics, and secure sorting. Published at ACM CCS 2026.
TL;DR A maliciously-secure three-party MPC shuffle protocol with a distributed-verifier ZK correctness proof, enabling practical secure parsing of secret-shared data; accepted at CCS 2026.
Organisations named here
- Bhavish Raj Gopal
- Daniel Noble
- Nidhish Bhimrajka
- Yashvanth Kondi
Technologies named here
- Truffle
Techniques named here
- Secure shuffle
- Distributed verifier zero-knowledge proof
Related in other
eprint.iacr.orgpaperRerandomizable Garbling for Arithmetic Circuits
aseemshrey.inarticle