devcon 7 / zk email fast proofs and production ready account recovery
Duration: 00:25:18
Speaker: Aayush Gupta, Sora Suegami
Type: Talk
Expertise: Intermediate
Event: Devcon
Date: Nov 2024
Keynote: Programmable Cryptography and Ethereum
Programmable Cryptography is a "second generation" of cryptographic primitives - primitives that allow arbitrary programs to be executed "inside of" or "on top of" cryptographic objects. Programmable cryptography provides three key affordances that complement and amplify the affordances of Ethereum--verifiability, confidentiality, and non-interactivity. We'll discuss how these technologies can reshape the Internet over the next 50 years.
Keynote: The Universal Cryptographic Adapter
The "secret" third affordance of Zero-Knowledge proof after 1) Privacy and 2) Succinctness is Interoperability. ZK enables us to continuously refactor data, aggregate it from different sources, and transforming it without loosing its integrity. Starting with the Zupass project, and now with the broader adoption of the POD and GPC format, 0xPARC has been exploring using ZK for data sovereignty and creating more interoperable data ecosystem. We will cover our learnings and progress in this talk.
The Blind Man's Elephant: a product vision towards private identities
A short talk introducing the concepts of key properties we want to achieve in private ZK identities. Sparkling concepts like SSI and DIDs and why blockchains are the best way to ensure that. Finally it concludes with simple ZK and data-structure constructions and different alternatives that are seeking to provide this characteristics. In short, this is a lightning overview of the space, it's desired features and different approaches to achieve them.
Anon-Aadhaar Protocol using Halo2 and Noir
We will introduce the Anon-Aadhaar protocol which is an anonymity layer on top of a social security like Scheme (Aadhaar card) for Indian citizens using Zero-knowledge proofs. This can be used for getting many basic services in India like electricity, banking, etc. We will describe the implementation results of the protocol using Halo2 and Noir. We will also provide a comparative analysis of benchmarks using different backends like Circom, Halo2 and Noir.
Circom buses: a new journey
Circom is one of the most widely used languages in programmable cryptography. In this talk we present an amazing new circom feature, called buses. Like structs in other languages, programmers can define their own buses, as new types, in a general way to create structured collections of signals and freely use them in their code. Buses increase the readability, modularity and security of circuits. Illustrative examples as well as the renewed circomlib, using buses, are presented.
STARK proofs ELI5
Let's face it, ZK proofs are intimidating. But they don't have to be! ZK proofs are complex not because of the depth math they use, but because of the large number of fields of mathematics they leverage features from. In this talk, we'll break down STARK proofs into simple blocks and colorful analogies so that you get a good high level overview of how they work
TLSNotary: Applying MPC and interactive ZK to prove web2 data
Diving into TLSNotary, a protocol which leverages multi-party computation and interactive ZK to prove the authenticity and provenance of any data on the web to another party. Summary: 1. What it is and what it can do 2. High-level overview of how it works 3. Details on the underlying MPC and ZK protocols that we use 4. How to use it
Privacy-Preserving Groups
This talk will explore the concept of privacy-preserving groups and the challenges associated with managing them. It will cover different ideas to add anti-sybil mechanisms to enhance group security and trust. The presentation will also highlight real-world projects working on it and provide practical use cases to illustrate their application and impact.
Behind Zupass: Applied Cryptography For Consumers
Recent advancements in cryptography on consumer devices (like your mobile phone) and progress in developer tooling (Semaphore, SnarkJS) have led to the emergence of open-source projects such as Zupass, a personal "cryptographic computer" helping power Devcon. This talk dives into the technical challenges behind scaling ZKPs to 10,000+ consumer devices and the history behind the project, from its inception at Zuzalu to its usage at recent Ethereum events (Devconnect, ProgCrypto, ETHBerlin).
Elliptic curves and SNARKs: past, present and future.
Elliptic curves are used in many proof systems. Some systems (e.g. Bulletproofs) use plain curves (e.g. ed25519). Some (e.g. Groth16, KZG-PLONK) use pairing-friendly curves (e.g. BLS12-381). Some recursive systems require pairing-friendly 2-cycle (e.g. MNT4/6) or 2-chains (e.g. BLS12-377/BW6-761). Some other recursive/folding systems require plain 2-cycle (e.g. Pasta). In this talk we will go through the difference between these curves and why there isn't a silver bullet curve for all scenarios.