Direct Range Proofs for Paillier Cryptosystem and Their Applications
Zhikang Xie, Mengling Liu, Haiyang Xue, Man Ho Au, Robert H. Deng, Siu-Ming Yiu
2024Year
7Citations
1Top-tier citations
Abstract
The Paillier cryptosystem is renowned for its applications in electronic voting, threshold ECDSA, multi-party computation, and more, largely due to its additive homomorphism. In these applications, range proofs for the Paillier cryptosystem are crucial for maintaining security, because of the mismatch between the message space in the Paillier system and the operation space in application scenarios.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Cited by top-tier papers1
Ask how each one uses itRelated papers
- Batch Range Proof: How to Make Threshold ECDSA More EfficientGuofeng Tang, Shuai Han, Li Lin, Changzheng Wei et al.CCS 2024 · 3 citations
- Efficient Zero-Knowledge Arguments For Paillier CryptosystemBorui Gong, Wang Fat Lau, Man Ho Au, Rupeng Yang et al.S&P 2024 · 5 citations
- Leveraging Small Message Spaces for CCA1 Security in Additively Homomorphic and BGN-Type EncryptionBenoît LibertEUROCRYPT 2025 · 4 citations
- Sharp: Short Relaxed Range ProofsGeoffroy Couteau, Dahmun Goudarzi, Michael Klooß, Michael ReichleCCS 2022 · 14 citations
- A Succinct Range Proof for Polynomial-based Vector CommitmentRui Gao, Zhiguo Wan, Yuncong Hu, Huaqun WangCCS 2024 · 3 citations
