Caulk: zkStudyClub: Caulk - Lookup Arguments in Sublinear Time (Arantxa Zapico)

This week, Arantxa Zapico of the Ethereum Foundation presents new work (co-authored with Vitalik Buterin, Dmitry Khovratovich, Mary Maller, Anca Nitulescu, and Mark Simkin) called Caulk, which examines position-hiding linkability for vector commitment schemes. One can prove in zero knowledge that one or more values that comprise commitment cm all belong to the vector of size committed to in C. Caulk can be used for membership proofs and lookup arguments and outperforms all existing alternatives in prover time by orders of magnitude.

Paper Link: https://eprint.iacr.org/2022/621
Slides: https://www.slideshare.net/AlexPruden/caulk-zkstudyclub-caulk-lookup-arguments-in-sublinear-time-a-zapico

If you like what we do:
* Subscribe to our podcast newsletter - https://zeroknowledge.substack.com
* Follow us on Twitter @zeroknowledgefm - https://twitter.com/zeroknowledgefm
* Join us on Telegram - https://zeroknowledge.fm/telegram
* Catch us on Youtube - https://zeroknowledge.fm/
* Head to the ZK Community Forum - https://community.zeroknowledge.fm/
* Support our Gitcoin Grant - https://zeroknowledge.fm/gitcoin-grant-329-zkp-2

Видео Caulk: zkStudyClub: Caulk - Lookup Arguments in Sublinear Time (Arantxa Zapico) канала Zero Knowledge