Polynomial commitments

You are here:
< All Topics

A polynomial commitment scheme allows a committer to commit to a polynomial with a short string that can be used by a verifier to confirm claimed evaluations of the committed polynomial. This is similar to homomorphic commitment schemes. However, polynomial commitments can be useful for reducing communication costs in some cryptographic protocols, when compared to homomorphic commitments. Polynomial commitment schemes are used in many modern zero-knowledge proof systems.

Previous Multi-party computation
Next Supersonic
Table of Contents