ZKP Frontier Tracker 🎯
零知识证明 前沿热点追踪 🎯
ZKP フロンティアトラッカー 🎯
Sat 星期六 土曜日
04.18
2026
https://eprint.iacr.org/2026/678
Brakerski et al. propose a new method for mergeable SNARGs in their paper, supporting unbounded recursive merges with security reduction time scaling only with depth, and apply it to construct the first CCA1-secure multi-hop FHE scheme. Brakerski等人在论文中提出了一种可合并SNARG的新方法，支持无限递归合并且安全归约时间仅与合并深度相关，并应用于构建首个CCA1安全的多跳全同态加密方案。 Brakerskiらは、の論文で、unboundedな再帰的マージをサポートし、セキュリティ削減時間が深さのみに依存する新しいmergeable SNARGsの方法を提案し、これを応用して最初のCCA1-secure multi-hop FHEスキームを構築した。
Notes Notes 要点
- First SNARG method supporting unbounded polynomial recursive merges with arbitrary topology
- Security reduction time scales only with merge depth, not tree size (potentially exponential)
- Method applicable to trapdoor languages; trapdoor used only in security reduction, not proof generation/verification
- Constructions from sub-exponential iO yield fully compact proofs; from LWE yield proofs scaling with depth
- Application: first CCA1-secure multi-hop fully homomorphic encryption scheme
- Application: first adaptive multi-hop aggregate signature scheme from LWE
Q&A Deep Dive 💬 今日要点 深入解析 💬 今日の要点 深掘り 💬
Sat 星期六 土曜日
04.18
2026
