Anonymous credentials with range proofs, verifiable encryption, ZKSNARKs, Circom support, and blinded issuance – Webinar 69 – Lovesh Harchandani
Lovesh Harchandani from Dock presents their approach to anonymous credentials and dives in on the various predicates that can be proven in zero knowledge. In over 90 minutes of discussion, we cover what these cryptographic techniques are, how they enable several important use cases for digital identity credentials, and we stretch James Monaghan’s ability to keep up as interviewer by taking a look at the source code which makes it all possible! We show how various zero knowledge primitives we’ve built can be used in a modular fashion to solve real-world use cases. We cover privacy-preserving signature schemes, zero knowledge attribute equalities, range proofs, and verifiable encryption based on ZK-SNARKs, expressing arbitrary predicates as Circom programs and creating ZK proofs for them and blinded credentials (issuer is unaware of all attributes). For anyone interested in the technical underpinnings of this new frontier of digital identity, this episode is a must!
This content is shared with a Creative Commons by Share Alike License. This allows you to reuse the powerpoint slides we are sharing here to build your own SSI communities around the globe. You only need to credit SSIMeetup and the invited guest of the day and share whatever you produce with the same license. Please read the license for full details.
Download the full presentation “Anonymous credentials with range proofs, verifiable encryption, ZKSNARKs, Circom support, and blinded issuance” from Google Slides.