Universal equivalence and majority of probabilistic programs over finite fields - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2020

Universal equivalence and majority of probabilistic programs over finite fields

Abstract

We study decidability problems for equivalence of probabilistic programs, for a core probabilistic programming language over finite fields of fixed characteristic. The programming language supports uniform sampling, addition, multiplication and conditionals and thus is sufficiently expressive to encode boolean and arithmetic circuits. We consider two variants of equivalence: the first one considers an interpretation over a fixed finite field, while the second one, which we call universal equivalence, verifies equivalence over all extensions of a finite field. The universal variant typically arises in provable cryptography when one wishes to prove equivalence for any length of bitstrings, i.e., elements of extensions of the boolean field. While the first problem is obviously decidable, we establish its exact complexity which lies in the counting hierarchy. To show decidability, and a doubly exponential upper bound, of the universal variant we rely on results from algorithmic number theory and the possibility to compare local zeta functions associated to given polynomials. Finally we study several variants of the equivalence problem, including a problem we call majority, motivated by differential privacy.
Fichier principal
Vignette du fichier
report.pdf (513.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02552287 , version 1 (23-04-2020)
hal-02552287 , version 2 (13-11-2020)

Identifiers

  • HAL Id : hal-02552287 , version 2

Cite

Gilles Barthe, Charlie Jacomme, Steve Kremer. Universal equivalence and majority of probabilistic programs over finite fields. [Research Report] MPI SP; LSV, ENS Cachan, CNRS, INRIA, Université Paris-Saclay, Cachan (France); LORIA, UMR 7503, Université de Lorraine, CNRS, Vandoeuvre-lès-Nancy. 2020. ⟨hal-02552287v2⟩
168 View
220 Download

Share

Gmail Facebook X LinkedIn More