Morphic Accumulators and Applications: Optimal Range Proofs, Polynomial Commitments, and Ring Signatures↗ (원문, 새 창)

본문 미리보기

Cryptographic accumulators based on groups of unknown order (GUO) provide constant-size set membership proofs. For security purposes, existing works require first encoding set elements via division-intractable (DI) hash functions, typically instantiated as random oracles that destroy any algebraic structure. This confines GUO-based accumulators to a purely set-membership role, making them "incompatible" with various existing cryptographic proof techniques over committed integers in the same gro