VESPo: Verified Evaluation of Secret Polynomials - INRIA - Institut National de Recherche en Informatique et en Automatique Access content directly
Preprints, Working Papers, ... Year : 2022

VESPo: Verified Evaluation of Secret Polynomials


We consider the problem of efficiently evaluating a secret polynomial at a given public point, when the polynomial is stored on an untrusted server. The server performs the evaluation and returns a certificate, and the client can efficiently check that the evaluation is correct using some pre-computed keys. Our protocols support two important features: the polynomial itself can be encrypted on the server, and it can be dynamically updated by changing individual coefficients cheaply without redoing the entire setup. As an important application, we show how these new techniques can be used to instantiate a Dynamic Proof of Retrievability (DPoR) for arbitrary outsourced data storage that achieves low server storage size and audit complexity. Our methods rely only on linearly homomorphic encryption and pairings, and preliminary timing results indicate reasonable performance for polynomials with millions of coefficients, and efficient DPoR with for instance 1TB size databases.
Fichier principal
Vignette du fichier
vespo.pdf (607.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03365854 , version 1 (05-10-2021)
hal-03365854 , version 2 (20-01-2022)
hal-03365854 , version 3 (21-02-2022)
hal-03365854 , version 4 (09-05-2022)
hal-03365854 , version 5 (13-03-2023)



Jean-Guillaume Dumas, Aude Maignan, Clément Pernet, Daniel S. Roche. VESPo: Verified Evaluation of Secret Polynomials: with application to low-storage dynamic proofs of retrievability. 2022. ⟨hal-03365854v2⟩
207 View
139 Download



Gmail Facebook X LinkedIn More