Linear-Time, Constant-Depth Blind Polynomial Commitments from Generalized RAA Codes, with an End-to-End Blind SNARK Implementation
Kexi Huang
·
2026-03-09
·
via Cryptology ePrint Archive
In this work, we construct a new and highly efficient blind polynomial commitment scheme (PCS) over non-binar…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。