Morphic Accumulators and Applications: Optimal Range Proofs, Polynomial Commitments, and Ring Signatures
Dimitrios Papadopoulos, Hong Kong University of Science and Tech
·
2026-06-08
·
via Cryptology ePrint Archive
Cryptographic accumulators based on groups of unknown order (GUO) provide constant-size set membership proofs…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。