ZKP Frontier Tracker 🎯
零知识证明 前沿热点追踪 🎯
Fri 星期五
02.21
2025
https://eprint.iacr.org/2024/1843
Hadas Zeilberger proposed in the paper a method to reduce the communication complexity of code-based SNARKs by utilizing the "related consistency" property of linear codes. This work demonstrates that when the vector $\pi_L + r\pi_R$ is close to a codeword, then $\pi_L$, $\pi_R$, and $\pi_L + r\pi_R$ are also consistent with the codeword at specific positions. This property significantly reduces communication complexity. Hadas Zeilberger在论文中提出了一种降低基于编码的SNARKs通信复杂性的方法，利用线性码的“相关一致性”性质，证明当向量𝜋𝐿 + 𝑟𝜋𝑅接近某个码字时，𝜋𝐿、𝜋𝑅和𝜋𝐿 + 𝑟𝜋𝑅在特定位置上也与码字一致。这一性质能显著降低了通信复杂性。
https://eprint.iacr.org/2025/294
Wilson Nguyen and Srinath Setty introduced Neo in the paper, a novel lattice-based folding scheme for CCS. By adapting the HyperNova folding scheme to lattice settings, Neo addresses the limitations of LatticeFold, provides post-quantum security, and introduces bit-costed commitments. Wilson Nguyen和Srinath Setty在论文中提出了Neo，一种新的基于格的折叠方案，适用于CCS。Neo通过适应HyperNova的折叠方案到格设置，解决了LatticeFold的局限性，提供了后量子安全性，并引入了按位付费的承诺成本。