Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof

Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof

Explore the concept of Transparent Polynomial Delegation and its applications to Zero Knowledge Proof in this 17-minute IEEE conference talk. Delve into the efficiency measures and applications of Zero Knowledge Proofs, examining the GKR08 protocol and its evolution. Learn about the speakers' contributions, including transparent polynomial delegation constructions and transparent ZKVPD. Discover how these concepts apply to verifiable secret sharing and compare the Virgo system with other transparent ZKP systems. Conclude with an examination of proving Merkle tree roots using SHA-256.