Central AsianResearch Index

MCTPROOFS: A NEW MATRIX COMMITMENT SCHEME BASED ON HIERARCHICAL DATA STRUCTURES AND BILINEAR FORMS

We present a novel matrix commitment scheme, MCTproofs, which allows a committer to commit to a matrix along with its submatrices and generate proofs for an arbitrary subset of matrix elements. The scheme achieves efficient proof generation and verification by employing tree-based structures in its algorithms. MCTproofs builds upon the foundational principles of Matproofs, offering a significant enhancement over the original scheme. Notably, MCTproofs is aggregatable, maintainable, and updatable, achieving an average performance improvement of 10 × in proof aggregation and 3 × in verification. Additionally, the size of aggregated proofs in MCTproofs is O(1), compared to that of Matproofs, which has a complexity of O(min{b, √ n}). We further demonstrate the applicability of MCTproofs in payment-only stateless cryptocurrencies and compare its performance against Matproofs and Hyperproofs. Experimental results show that MCTproofs outperforms both in aggregation and verification while maintaining comparable efficiency in other operations.

Сведения

Опубликовано
2025 · Т. 13, № 4, С. 53-74
Язык
Английский
ISSN
2306-6172 · 2308-9822
Издатель
L. N. Gumilyov Eurasian National University