ZKP Frontier Tracker 🎯
零知识证明 前沿热点追踪 🎯
ZKP フロンティアトラッカー 🎯
Sat 星期六 土曜日
08.30
2025
https://eprint.iacr.org/2025/1503
Groth et al. proposed a constraint-friendly mapping to elliptic curve group relations in paper, avoiding encryption hash functions, achieving efficient proofs in ZKP, reducing constraints and accelerating proof time. Groth等人在论文中提出了一种约束友好的映射到椭圆曲线群关系，绕过加密哈希函数需求，在ZKP中实现高效证明，减少约束和加速证明时间。 Grothらによる論文では、暗号化ハッシュ関数を回避し、ZKPにおける効率的な証明を実現し、制約を削減し、証明時間を短縮する楕円曲線群関係への制約に優しいマッピングが提案されています。
Notes Notes 要点
- Propose constraint-friendly mapping to elliptic curve group relations, replacing traditional hash to curve method
- Analyze security in EC-GGM, support non-deterministic mapping
- Achieve constraint reduction by 23x, proof time acceleration by 50-100x
- Suitable for zkVM memory checks and BLS signature ZKP scenarios
- Open-source implementation based on Noir/Barretenberg, enhancing practical application efficiency
- Provide better cryptographic primitives for ZKP and constraint programming