Direct Range Proofs for Paillier Cryptosystem and Their Applications
Zhikang Xie, Mengling Liu, Haiyang Xue, Man Ho Au, Robert H. Deng, Siu-Ming Yiu
2024年份
7被引次数
1顶会引用
摘要
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.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Batch Range Proof: How to Make Threshold ECDSA More EfficientGuofeng Tang, Shuai Han, Li Lin, Changzheng Wei 等CCS 2024 · 被引用 3 次
- Efficient Zero-Knowledge Arguments For Paillier CryptosystemBorui Gong, Wang Fat Lau, Man Ho Au, Rupeng Yang 等S&P 2024 · 被引用 5 次
- Leveraging Small Message Spaces for CCA1 Security in Additively Homomorphic and BGN-Type EncryptionBenoît LibertEUROCRYPT 2025 · 被引用 4 次
- Sharp: Short Relaxed Range ProofsGeoffroy Couteau, Dahmun Goudarzi, Michael Klooß, Michael ReichleCCS 2022 · 被引用 14 次
- A Succinct Range Proof for Polynomial-based Vector CommitmentRui Gao, Zhiguo Wan, Yuncong Hu, Huaqun WangCCS 2024 · 被引用 3 次
