Efficient Zero-Knowledge Arguments for Some Matrix Relations over Ring and Non-malleable Enhancement

ePrint Report: Efficient Zero-Knowledge Arguments for Some Matrix Relations over Ring and Non-malleable Enhancement

Yuan Tian

Various matrix relations widely appeared in data-intensive computations, as a result their zero-knowledge proofs/arguments (ZKP/ZKA) are naturally required in large-scale private computing applications.
In the first part of this paper, we concretely establish efficient zero-knowledge arguments for linear matrix relation AU = B and bilinear relation UQV = Y over the residue ring Zm with logarithmic message complexity. We take a direct, matrix-oriented (rather …

eprint report matrix non ring