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 and co-authored by Wang Fat Lau, Man Ho Au, Rupeng Yang, Haiyang Xue, and Lichun Li, introduces a novel and efficient zero-knowledge proof (ZKP) system designed specifically for the **Paillier cryptosystem** when dealing with structured messages. The core problem addressed is a significant vulnerability in privacy-preserving data aggregation scenarios where a malicious party, acting as a data provider, could subtly manipulate encrypted messages to steal sensitive information from another party, such as age data in a political exit poll analysis.
AI review
This talk presents a critical and highly technical solution to a pervasive data leakage vulnerability in Paillier-based privacy-preserving aggregation. The novel ZKP system efficiently proves structured messages over composite moduli, a notoriously difficult problem, with sub-linear proof sizes and significant performance gains. This isn't just theory; it's a practical, robust defense against subtle data manipulation that every architect using Paillier should implement.