Efficient Zero-Knowledge Arguments For Paillier Cryptosystem
Borui Gong, Wang Fat Lau, Man Ho Au, Rupeng Yang, Haiyang Xue, Lichun Li
IEEE Symposium on Security and Privacy 2024 · Day 2 · Continental Ballroom 6
This talk, presented by Borui Gong at IEEE S&P, introduces a novel and efficient construction for **Zero-Knowledge Arguments (ZKAs)** tailored specifically for the **Paillier cryptosystem**. The core problem addressed is the inherent vulnerability in secure multi-party computation (MPC) scenarios where a malicious party, despite using a homomorphic encryption scheme like Paillier, could deviate from agreed-upon message structures to surreptitiously extract sensitive data from other participants. The research focuses on designing a ZKA that can prove both the correctness of Paillier encryptions and the adherence to predefined message structures, particularly for messages containing binary records arranged in specific slots.
AI review
This research delivers a crucial and highly efficient Zero-Knowledge Argument for Paillier, directly patching a critical vulnerability in MPC where malicious parties could leak data via structured message manipulation. Its novel techniques for composite moduli and sublinear proof sizes make verifiable privacy-preserving aggregation practical and robust, representing a significant advancement in the field.