Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about functional commitment schemes, a fundamental cryptographic primitive essential for building efficient succinct argument systems, in this one-hour conference talk by Pratyush Mishra from the University of Pennsylvania at the Simons Institute. Explore how functional commitment schemes enable users to commit to a message and subsequently prove the correctness of function evaluations over that committed message without revealing the underlying data. Discover popular implementations including polynomial commitments, vector commitments, and linear-function commitments, while examining their practical applications in modern cryptographic protocols. Gain insights into recent advances in developing rigorous definitions for functional commitment schemes and understand representative construction methods used in the field. Examine the theoretical foundations and practical considerations that make these schemes crucial for zero-knowledge proofs and other privacy-preserving cryptographic applications.
