InfoCommit: Information-Theoretic Polynomial Commitment and Verification

02/03/2020
by   Saeid Sahraei, et al.
0

We introduce InfoCommit, a protocol for polynomial commitment and verification. InfoCommit consists of two phases. An initial commitment phase and an evaluation phase. During the commitment phase, the verifier and the prover engage in a private two-party computation algorithm so that the verifier extracts a private verification key. In the evaluation phase, the verifier is interested in learning the evaluations of the polynomial at several input points. InfoCommit has four main features. Firstly, the verifier is able to detect, with high probability, if the prover has responded with evaluations of the same polynomial that he has initially committed to. Secondly, InfoCommit provides rigorous privacy guarantees for the prover: upon observing the initial commitment and the response provided by the prover to m evaluation requests, the verifier only learns O(m^2) symbols about the coefficients of the polynomial. Thirdly, the verifiability guarantee is unconditional and without the need for a trusted party, while "bounded storage" is the only assumption underlying the privacy of the algorithm. In particular, both properties hold regardless of the computation power of the two parties. Lastly, InfoCommit is doubly-efficient in the sense that in the evaluation phase, the verifier runs in O(√(d)) and the prover runs in O(d), where d-1 is the degree of the polynomial.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/10/2019

INTERPOL: Information Theoretically Verifiable Polynomial Evaluation

We study the problem of verifiable polynomial evaluation in the user-ser...
research
08/15/2019

Quantum preprocessing for information-theoretic security in two-party computation

In classical two-party computation, a trusted initializer who prepares c...
research
08/15/2019

Quantum preprocessing for security enhancement in classical two-party computation

In classical two-party computation, a trusted initializer who prepares c...
research
05/05/2023

Approximate Private Inference in Quantized Models

Private inference refers to a two-party setting in which one has a model...
research
05/03/2021

Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation

Consider a PPT two-party protocol π=(A,B) in which the parties get no pr...
research
11/08/2021

Data-driven Set-based Estimation of Polynomial Systems with Application to SIR Epidemics

This paper proposes a data-driven set-based estimation algorithm for a c...

Please sign up or login with your details

Forgot password? Click here to reset