三角等价和秩分布的基于消除的证书
Elimination-based certificates for triangular equivalence and rank profiles
摘要:
在本文中,我们给出了新的证明三角等价和秩配置文件。这些证书使某人能够验证行或列秩配置文件或整个秩配置文件矩阵,比重新计算它们更快,总开销可以忽略不计。我们首先提供二次时间和空间非交互式证书保存以前已知的对数因子。然后,我们提出了交互式证书相同的问题,其蒙特卡洛验证的复杂性需要一个小的常数矩阵向量乘法,线性空间,和线性数量的额外字段操作,与线性数量的相互作用。作为一个应用程序,我们还给出了一个交互式协议,证明行列式或签名的密集矩阵,速度比以前最好的已知的证明。最后给出了行秩剖面和列秩剖面的线性空间和常数圆证明。
英文摘要:
In this paper, we give novel certificates for triangular equivalence and rank profiles. These certificates enable somebody to verify the row or column rank profiles or the whole rank profile matrix faster than recomputing them, with a negligible overall overhead. We first provide quadratic time and space non-interactive certificates saving the logarithmic factors of previously known ones. Then we propose interactive certificates for the same problems whose Monte Carlo verification complexity requires a small constant number of matrix-vector multiplications, a linear space, and a linear number of extra field operations , with a linear number of interactions. As an application we also give an interactive protocol, certifying the determinant or the signature of dense matrices, faster for the Prover than the best previously known one. Finally we give linear space and constant round certificates for the row or column rank profiles.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。