ZKP Frontier Tracker 🎯
零知识证明 前沿热点追踪 🎯
Mon 星期一
11.10
2025
Linear-time and Logarithmically-sound Permutation and Multiset SNARKs https://eprint.iacr.org/2025/1967
Chen et al. proposed a linear-time and logarithmically-sound permutation and multiset SNARK in their paper, eliminating quadratic proof overhead through a linear-algebraic perspective, avoiding auxiliary commitments for efficient verification. Chen等人在论文中提出了一种线性时间且对数可靠的置换和多重集SNARK，通过线性代数视角消除二次证明开销，无需辅助承诺即可实现高效验证。
Notes
- New method avoids auxiliary commitments, reducing soundness errors and enhancing security
- Linear-algebraic perspective allows partial evaluation without additional algebraic costs, optimizing performance
- Supports permutation proofs from provers without preprocessing, enhancing flexibility
- Verifiers can evaluate permutations in O(polylog(n)) time, reducing dependency on provers
- Matches optimal prover bounds, ensuring theoretical efficiency
- Field-independent design extends application scope, improving universality