ZKP Frontier Tracker 🎯
零知识证明 前沿热点追踪 🎯
Mon 星期一
01.12
2026
Fully Secure DKG Protocols for Discrete Logarithm Revisited https://eprint.iacr.org/2026/042
Baghery revisits fully secure robust DKG protocols for discrete logarithm in their paper, proposing three more efficient alternatives with O(n) computational complexity and different trade-offs in security, efficiency, and round complexity. Baghery在论文中重新审视了离散对数场景下的完全安全鲁棒DKG协议，提出了三种更高效的替代方案，均实现O(n)计算复杂度，并在安全性、效率和轮数上提供不同权衡。
Notes
- Traditional GJKR protocol has O(n²) cost, limiting scalability.
- Protocol 1: full security, uniformly random public key.
- Protocol 2: better efficiency, indistinguishable public keys.
- Protocol 3: 3 rounds, secure variant of Atapoor et al.
- New 3-round protocol needs only O(n) exponentiations.
- Enables flexible security-efficiency trade-offs for DKG.