An interactive protocol for verifiable polynomial evaluation with information-theoretic soundness, O(log d) rounds, sublinear user verification, and polynomial server time for degree-d polynomials.
The knowledge complexity of interactive proof systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Interactive Verifiable Polynomial Evaluation
An interactive protocol for verifiable polynomial evaluation with information-theoretic soundness, O(log d) rounds, sublinear user verification, and polynomial server time for degree-d polynomials.