ZKP Frontier Tracker 🎯
零知识证明 前沿热点追踪 🎯
Tue 星期二
02.18
2025
https://eprint.iacr.org/2025/238
Campanelli et al., in their paper , studied cryptographic proof systems with sublinear proving time. The authors propose a simple polynomial commitment scheme based on vector commitments and fast polynomial evaluation preprocessing techniques. Key applications include constructing "index-efficient" SNARKs, where the prover achieves sublinear complexity relative to the index size after preprocessing, and they first realized sublinear prover lookup proofs for unstructured tables. Campanelli等人在论文中研究了具有次线性证明时间的密码学证明系统。作者提出了一种基于向量承诺和快速多项式评估预处理技术的简单多项式承诺构造。主要应用包括构建“索引高效”的SNARKs，使证明者在预处理后对索引大小具有次线性复杂度，并首次实现了对非结构化表的次线性证明者查找论证。
https://www.zksecurity.xyz/blog/posts/zkbugs-website/
The @zksecurityXYZ team announced the launch of the zkBugs website in their blog post . This site is dedicated to documenting and analyzing historical vulnerabilities found in ZK circuits, including a vulnerability directory, reproduction reports, a list of security tools, and tool evaluations. @zksecurityXYZ 团队在博客中分享了zkBugs网站的启动，该网站致力于记录和分析ZK电路中的历史漏洞，包括漏洞目录、复现报告、安全工具列表和工具评估等内容。