ZK Insights | 15th June 2025
Highlights
Zero Knowledge in STARKs
本文深入探讨了 STARKs 中的零知识实现,通过结构化随机性对见证多项式和 DEEP 组合多项式进行掩码,确保验证者无法获取计算细节,同时保持透明性和后量子安全性。
https://hexens.io/blog/zk-in-starks
The fields powering Binius
本文探讨了 Binius 协议背后的数学基础,重点介绍了二进制塔的构造及其在有限域中的元素表示与运算,通过 Karatsuba 算法优化乘法,为高效零知识证明系统提供支持。
https://blog.lambdaclass.com/the-fields-powering-binius/
Circle FFT — Part 1: Building the Circle Domain
本文介绍了 Circle STARKs 的核心算法 Circle FFT,通过构建圆曲线及其群结构,利用双陪集和标准位置陪集实现高效的多项式插值与求值,适用于小域(如 Mersenne 素数 2³¹-1)
https://www.rareskills.io/post/circle-starks
An introduction to Merkle Patricia Trie
本文介绍了以太坊中的 Merkle Patricia Trie(MPT),结合了 Trie 的高效键导航和 Merkle 树的加密验证,用于状态管理和共识验证,支持高效的状态存储、验证和回滚。
https://blog.lambdaclass.com/an-introduction-to-merkle-patricia-trie/
Updates
2025 IBM Quantum Roadmap update
IBM 最新的量子路线图为实现长期寻求的量子计算里程碑制定了清晰的路径,即将推出的 Loon 和 Nighthawk 处理器等新成员将照亮前进的道路。
https://www.youtube.com/watch?v=_y43boNNoVo
Realizing large-scale, fault-tolerant quantum computing
https://www.youtube.com/watch?v=zrZHPil0BTA
Astonishing discovery by computer scientist: how to squeeze space into timeAdd commentMore actions
https://www.youtube.com/watch?app=desktop&v=8JuWdXrCmWg
What we learned reviewing one of the first DKLs23 libraries from Silence Laboratories
Trail of Bits 对 Silence Laboratories 的 DKLs23 阈值签名库 Silent Shard 进行了安全审查,发现并修复了可能导致密钥销毁攻击的严重漏洞,强调了协议实现中的关键安全注意事项。
https://blog.trailofbits.com/2025/06/10/what-we-learned-reviewing-one-of-the-first-dkls23-libraries-from-silence-laboratories/
A bit more on Twitter/X’s new encrypted messaging
本文深入探讨了 Twitter/X 的新加密消息协议 XChat,指出其缺乏前向保密性且用户私钥存储在服务器上,存在安全隐患,建议用户谨慎使用。
https://blog.cryptographyengineering.com/2025/06/09/a-bit-more-on-twitter-xs-new-encrypted-messaging/
Papers
Crypto 2025 Accepted Papers
https://crypto.iacr.org/2025/acceptedpapers.php
Realizing large-scale, fault-tolerant quantum computing
https://www.youtube.com/watch?v=zrZHPil0BTA
Private Signaling Secure Against Actively Corrupted Servers
https://eprint.iacr.org/2025/1056
PICS: Private Intersection over Committed (and reusable) Sets
https://eprint.iacr.org/2025/1071
SmallWood: Hash-Based Polynomial Commitments and Zero-Knowledge Arguments for Relatively Small Instances
https://eprint.iacr.org/2025/1085
Universally Composable Succinct Vector Commitments and Applications
https://eprint.iacr.org/2025/1103
A Framework for Compiling Custom Languages as Efficiently Verifiable Virtual Machines
https://eprint.iacr.org/2025/1110
点击 阅读原文 /Read More ,开启邮箱订阅🔛
【免责声明】市场有风险,投资需谨慎。本文不构成投资建议,用户应考虑本文中的任何意见、观点或结论是否符合其特定状况。据此投资,责任自负。
来源链接

