DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs

Name: DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs
Duration: 15 min
Description: Talk from 34th USENIX Security Symposium (USENIX Security '25).

Yanpei Guo

34th USENIX Security Symposium (USENIX Security '25) · Day 2 · Crypto 2: Private Information Retrieval and Computation