Elimination-based certificates for triangular equivalence and rank profiles

09/11/2019
by   Jean-Guillaume Dumas, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/13/2017

Certificates for triangular equivalence and rank profiles

In this paper, we give novel certificates for triangular equivalence and...
01/08/2016

Fast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition

The row (resp. column) rank profile of a matrix describes the stair-case...
02/18/2022

Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix

Consider a matrix 𝐅∈𝕂[x]^m × n of univariate polynomials over a field 𝕂....
07/03/2018

Verification Protocols with Sub-Linear Communication for Polynomial Matrix Operations

We design and analyze new protocols to verify the correctness of various...
04/19/2021

Linear-time uniform generation of random sparse contingency tables with specified marginals

We give an algorithm that generates a uniformly random contingency table...
09/25/2019

α^α-Rank: Scalable Multi-agent Evaluation through Evolution

Although challenging, strategy profile evaluation in large connected lea...
07/12/2018

Probabilistic verification of all languages

We present three protocols for verifying all languages: (i) For any unar...