Daily Digest每日摘要View All查看全部

Fuchsbauer et al. proposed doubly aggregatable signatures in their paper, enabling efficient two-layer aggregation with SNARKs for bitmap predicates, applied to incentivizing vote dissemination in consensus.Fuchsbauer等人在论文中提出双重聚合签名原语，允许两层签名者高效聚合，并利用SNARKs实现位图谓词验证，应用于共识协议中的激励投票传播。

Abdolmaleki et al. present the first systematic study of resettable security for NIZKs in their paper, formalizing strong resettable ZK, demonstrating attacks on Fiat-Shamir PIOP SNARKs, and proposing a PRF-based generic compiler defense.Abdolmaleki等人在论文中首次系统研究了NIZK的可重置安全性，形式化了强可重置零知识定义，展示了对Fiat-Shamir编译的PIOP SNARKs等攻击，并提出基于PRF的通用编译器防御方案。

Deressa et al. propose the first ZK proof system achieving asymptotically optimal batched exponentiation proofs with innovations including trace-based square-and-multiply encoding, lazy sumcheck, etc. Constant verification (3.5ms), proof size 160-256B, memory <1.1MB, suitable for zkRollups, anonymous credentials.Deressa等人在中提出首个实现渐进最优批量幂次证明的ZK系统，创新包括基于轨迹的平方乘编码、惰性sumcheck等。验证恒定时间3.5ms，证明大小160-256B，内存低于1.1MB，适用于zkRollup、匿名凭证等场景。

Konara et al. systematically reviewed quantum and post-quantum blockchains, analyzing the integration of post-quantum cryptography and the state of quantum blockchains in their paper.Konara等人在论文中系统综述了量子与后量子区块链，分析了后量子密码集成与量子区块链的研究现状。

Avni et al. introduced the Proof-Carrying Output (PCO) framework in , combining formal proofs, timestamps, and append-only ledgers to provide verifiable and auditable AI outputs.Avni等人在论文中提出Proof-Carrying Output（PCO）框架，通过机器可验证证明、时间戳与追加式账本，为AI输出建立不可抵赖与可审计的合规验证机制。

Cartor et al. proposed a MinRank-based post-quantum signature family in , introducing a new ZK proof system supporting digital signatures, ring signatures, and the first linkable ring signature based on MinRank.Cartor等人在论文中提出了一类基于MinRank问题的后量子签名方案，结合新型ZK证明系统，实现了更优健壮性的数字签名、环签名及首个基于MinRank的可链接环签名。

Abdolmaleki et al. propose tACT, a publicly verifiable threshold anonymous counting token in a distributed-trust setting, and use it to build a Sybil-resistant SSI system with threshold issuance, unlinkable multi-show selective disclosure, improving over CanDID.Abdolmaleki等人提出tACT，一种在分布式信任环境下的可公开验证阈值匿名计数代币，并用于构建抗女巫攻击的自主主权身份系统，支持阈值发行、不可链接多显示选择性披露等特性，相比CanDID提升了效率并减少交互轮数。

Lehmann et al. propose three constructions for device binding of anonymous credentials on legacy phones, using standard ECDSA signatures for proof-of-possession, bridging pairing-friendly curves with P256.Lehmann等人在论文中提出了三种将匿名凭证绑定到传统手机硬件的方法，通过标准ECDSA签名实现证明，解决了配对友好曲线与P256兼容性问题。

The Succinct team (Hemo et al.) introduced a Jagged PCS that commits the entire computation trace as a single polynomial while enabling per-column evaluation proofs, drastically reducing zkVM recursion overhead. It requires only 5 finite field multiplications per element with no additional oracles.Succinct团队（Hemo等人）在论文中提出了一种新型的Jagged PCS，允许将整个计算迹作为一个多项式承诺，同时支持对单个列进行求值证明，极大降低了zkVM递归验证开销。该方案仅需5个有限域乘法/元素，无需额外预言机。

Wei et al. propose aggregate signatures with verifiable key aggregation (ASvKA) and privacy, a generic transformation from multi-signatures, and two instantiations: PP-SpeedyASvKA and PP-BAS.Wei等人提出了带可验证密钥聚合的隐私保护聚合签名ASvKA，给出从多重签名到聚合签名的通用转化，并实例化出两种高效方案PP-SpeedyASvKA和PP-BAS，支持签名压缩与隐私保护。

Kamath et al. propose Titan, an efficient transparent polynomial commitment scheme in their paper , combining IOP-based outer commitments with Pedersen inner commitments, achieving sublinear proof size and verification. They build TitanSnark, a SNARK with O(√n) proof size and verification, improving over Spartan's O(n).Kamath等人在论文中提出了Titan，一种高效的透明设置多项式承诺方案，结合基于群上IOPP的承诺与Pedersen内部承诺，平衡了证明大小和验证效率，并基于此构建了TitanSnark，相比Spartan协议，证明大小和验证复杂度从O(n)降至O(√n)。

Gao et al. proposed Terrae in their paper, a ZK proof system for quantized GBDT training and inference based on KZG commitments, leveraging domain-lifting and interleaving batching to reduce prover time.Gao等人在论文中提出了Terrae，一种基于KZG承诺的用于量化GBDT训练和推理的零知识证明系统，通过域提升批处理等新技术高效约束，显著减少证明生成时间。

Baecker et al. propose two DKG protocols with identifiable abort, proactive key refresh, and adaptive security under UC framework, bridging the gap in adaptive security and key structure compatibility.Baecker等人在论文中提出两种适应不安全通信环境且支持可识别中止和主动密钥刷新的分布式密钥生成协议，弥补了现有方案在自适应安全性与密钥结构兼容性方面的空白。

Garreta et al. propose UCS and Zinc in , enabling SNARKs for multiple polynomial rings with algebraic constraints and ideal membership, using a PIOP compiler and new IPRS codes, achieving 40.6ms for SHA-256+MSM in ECDSA.Garreta等人在论文中提出Universal Constraint Systems (UCS)通用约束系统和Zinc框架，支持同时处理多个多项式环（如Z、Z₂₅₆）的代数约束与理想成员谓词，通过PIOP编译器与新型整数伪Reed-Solomon（IPRS）码实现高效SNARK，证明ECDSA中SHA-256压缩与MSM仅需40.6ms。

Baweja et al. proposed a new family of linear-time encodable field-agnostic codes, ERA, and an efficient IOPP for them, achieving small proof sizes in hash-based SNARKs.Baweja等人在论文中提出了一种新型线性时间可编码的场无关纠错码ERA，并基于此设计了高效的IOPP，实现了哈希基SNARK的小证明尺寸和良好的证明者效率。

Dalton et al. present the first systematic exploration of fault injection attacks against zkSTARK provers, aiming to violate zero-knowledge properties, filling a gap in fault injection research for general-purpose ZK proving systems.Dalton等人在论文中首次系统探索了针对zkSTARK证明者的故障注入攻击，旨在破坏其零知识特性，填补了通用ZK证明系统故障注入研究的空白。

Jo et al. proposed ZEE200, a constant-round ZK system achieving 200 KHz CPU speed on a commodity laptop, supporting a richer ISA and improving over ZEE by ~4000%, demonstrated by proving CVE vulnerabilities in Linux programs.Jo等人在论文中提出了ZEE200，一个恒定轮次ZK系统，在普通笔记本上实现200 KHz的CPU速度，支持更丰富的指令集，比ZEE快约4000%，并成功证明Linux程序CVE漏洞。

Guo et al. proposed LigeSIS, the first distribution-friendly code-based multilinear PCS, achieving sublinear cross-node communication with proof size independent of machine count.Guo等人在论文中提出了首个分布友好的基于纠错码的多线性多项式承诺方案LigeSIS，通过同态子集和哈希实现亚线性跨节点通信，证明大小与机器数量无关。