Accéder directement au contenu Accéder directement à la navigation
Pré-publication, Document de travail

Verification Protocols with Sub-Linear Communication for Polynomial Matrix Operations

Abstract : We design and analyze new protocols to verify the correctness of various computations on matrices over the ring F[x] of univariate polynomials over a field F. For the sake of efficiency, and because many of the properties we verify are specific to matrices over a principal ideal domain, we cannot simply rely on previously-developed linear algebra protocols for matrices over a field. Our protocols are interactive, often randomized, and feature a constant number of rounds of communication between the Prover and Verifier. We seek to minimize the communication cost so that the amount of data sent during the protocol is significantly smaller than the size of the result being verified, which can be useful when combining protocols or in some multi-party settings. The main tools we use are reductions to existing linear algebra verification protocols and a new protocol to verify that a given vector is in the F[x]-row space of a given matrix.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Littérature citée [46 références]  Voir  Masquer  Télécharger
Contributeur : Vincent Neiger <>
Soumis le : mercredi 11 décembre 2019 - 11:16:35
Dernière modification le : mardi 11 mai 2021 - 11:37:31
Archivage à long terme le : : jeudi 12 mars 2020 - 17:34:32


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01829139, version 2



David Lucas, Vincent Neiger, Clement Pernet, Daniel Roche, Johan Rosenkilde. Verification Protocols with Sub-Linear Communication for Polynomial Matrix Operations. 2018. ⟨hal-01829139v2⟩



Consultations de la notice


Téléchargements de fichiers