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中实现高效证明,减少约束和加速证明时间。
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