devcon 6 / what to know about zero knowledge
Duration: 00:54:43
Speaker: Albert Ni, Barry Whitehat, gubsheep, Vitalik Buterin
Type: Panel
Expertise: Beginner
Event: Devcon
Date: Oct 2022
Programmable Cryptography and Ethereum, Panel
One of the core themes of this panel is how Programmable Cryptography synergizes with Ethereum. Panelists will discuss questions such as ''Why have we not been able to do everything we've wanted with Ethereum?'' and ''Why have certain kinds of applications - from decentralized social to decentralized games to decentralized finance - not been able to reach their full potential with only consensus technology?''
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.
ZKPs and "Programmable Cryptography"
Historically, cryptographic protocols have been built special-purpose for specific kinds of claims or information hiding mechanisms. zkSNARKs and other new cryptographic tools move us to a world of "general-purpose" cryptography, where we have expressive languages to express claims about digital identity, reputation, and more. We discuss a high-level framework for thinking about where and why ZK and related technologies might (or might not) be useful for digital applications.
iO
It will be worth it ;)
How To Hallucinate A Server
A Hallucinated Server is a virtual server whose execution is cryptographically simulated by users, using "multiplayer" privacy technologies like multi-party computation or fully homomorphic encryption. Today, thanks to recent advancements in MPC and FHE, we have the technology to build the first fully Turing-complete hallucinated servers. We discuss the underlying technologies, and how we've used them to build several proof-of-concept applications.
[CLS] Programmable Cryptography
The Programmable Cryptography CLS hosts a series of talks exploring how advanced cryptography can reshape digital infrastructure beyond blockchain and trust infrastructure. SCHEDULE: 10:00–10:20 AM, Justin Glibert / 10:20–10:45 AM, Vitalik Buterin / 10:45–11:10 AM, Albert Ni / 11:10–11:35 AM, Barry Whitehat / 11:35 AM–12:00 PM gubsheep
Multi-Party FHE for Multi-Player Privacy
Privacy is an unsolved challenge for blockchains and decentralized systems. ZK cryptography gets us there partially, but not all the way. ZK enables “single-player private state,” and certain other kinds of privacy are impossible to realize with ZKPs alone. Panelists, the cryptography library devs, infrastructure builders, and application devs who have recently started to explore programmable encryption will discuss MP-FHE as one such tool for achieving more general privacy capabilities.
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.
Introduction to hash-based proof systems
Over the last decade, ZK has been gaining attention due to its applications in verifiable private computation and the scalability of blockchains. The development of general-purpose zkvms powered with STARK/hash-based proof systems have made writing provable applications simpler, abstracting developers from the details of ZK. In this talk, we will explain the basics of hash-based proof systems, different arithmetization schemes and how to prove computations without needing a trusted setup.
The combination of ZKP +/- MPC +/- FHE
This talk will provide you with the necessary intuition to understand when you should use ZKP, MPC or FHE, or any combination of them.