devcon 7 / the combination of zkp mpc fhe
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.
Scalable multi-party FHE with Phantom-zone
The talk introduces "phantom-zone", a framework to write scalable consumer facing MPC apps using multi-party FHE. Starting with what's multi-party FHE, talk gives a demo of non-trivial MPC app. Followed by introduction to programming model of MPC apps using multi-party FHE inside phantom-zone. Then the talk dives deep into primitives to realise multi-party FHE and ends with advanced FHE gadgets that further enhance multi-party FHE.
hallucinated servers another prog crypto chip
An introduction to programmable cryptography, culminating in the dream of a "hallucinated server".
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.
Introducing Provable Object Data
Built on learnings from experimental projects like Zupass, Provable Object Data (POD) is a new format with open-source libraries for any app to issue verifiable data, and make ZK proofs of claims about that data. PODs allow arbitrary key/value data to be signed and distributed. Flexible proofs about PODs can be created using a highly-configurable family of General Purpose Circuits (GPCs), without app-specific circuits or trusted setup. This talk will focus on POD and GPC motivation and design.
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.
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
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).
Clookup - Composite Function based Lookup Argument
Presenting Clookup, a novel lookup protocol that enhances efficiency in verifiable computations. By using a composite function approach and multivariate polynomials within the sumcheck protocol, Clookup achieves optimal time complexity \(O(m(m+n))\) when processing \(2^m\) witness elements against a \(2^n\) table. This method eliminates the need to compute coefficient forms of composite functions.