Proofs, Consensus, and Decentralizing Society Reunion 2020
as the organisers put it
This program will bring together researchers from Computer Science and beyond, whose research is contributing to three subthemes: proof systems, decentralized consensus, and applications of these to society, economics, and cryptocurrencies.
who it's for
cryptography researchers, blockchain researchers, distributed-systems researchers, protocol engineers, security engineers, applied economists studying crypto, smart contract developers
topics
account-based CBDC modeling; Diamond-Dybvig banking model; subquadratic SNARGs in ROM; lightning network channel economics; game-theoretic leader election; active-secure multiparty computation compiler; Algorand smart contract architecture; economic security of blockchain consensus; linear-time zero-knowledge arguments; square-root-size polynomial commitments; lower bounds for Plasma off-chain protocols
| title | author | length |
|---|---|---|
| Central Bank Digital Currency: When Price and Bank Stability Collide | Linda Schilling | 52m |
Defines an account-based CBDC and builds a nominal banking model on Diamond‑Dybvig (three periods, commitment equilibria) to show a CBDC trilemma: a central… | ||
| Blockchain as Regulatory Technology: from Code is law to Law as Code | Primavera De Filippi | 37m |
Blockchain systems enforce rules by code, with tamper‑resistance, automated smart‑contract execution, and no single operator who can unilaterally change… | ||
| Subquadratic SNARGs in the Random Oracle Model | Eylon Yogev | 49m |
Claim: a SNARG in the random‑oracle model with argument size O((log(T/ε))·log T) versus Micali’s roughly (log(T/ε))^2, giving subquadratic size when T is small… | ||
| Lightning Network Economics: Cost-Minimal Channels and their Implications for Network Structure | Clara Shikhelman | 48m |
Model treats each channel as two independent Poisson flows with Poisson arrival rates λ_ij, on‑chain reopen costing cost b for two on‑chain tx, and locked… | ||
| Game-Theoretically Secure Protocols Inspired by Blockchains | Elaine Shi | 52m |
Claims a constructive protocol that achieves game-theoretic leader election with corrupt majority and no trusted setup, improving from the usual log n… | ||
| Price of Active Security in Multiparty Computation | Muthu Venkitasubramaniam | 45m |
Shows a compiler that turns any black-box passive secure multiplication into an actively secure MPC with constant overhead per multiplication (provably… | ||
| Algorand Smart Contract Architecture | Jing Chen | 49m |
Proposes moving heavy user-defined logic off-chain and running it speculatively relative to blockchain snapshots, with a prototype VM that issues effect… | ||
| Economic Security of Distributed Systems | Jacob Leshno | 51m |
Claims Nakamoto consensus fails an economic-security test: under a rental-hash model an attacker can buy hashes and execute a double-spend attack that is… | ||
| Linear-Time Zero-Knowledge Arguments with Logarithmic Proof-Size | Jonathan Bootle | 01h 03m |
Claim: cryptographic arguments with a linear-time prover and indexer, polylogarithmic verification and logarithmic query complexity, constructed by turning… | ||
| Faster, Smaller, Weaker, Darker | Benedikt Bunz | 52m |
Protocol constructs algebraic proofs for bilinear inner products and yields a polynomial commitment with square-root CRS size: CRS ~4 MB vs KZG ~3.2 GB for… | ||
| Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma c | Stefan Dziembowski | 38m |
Paper proves a formal impossibility: for any Plasma-style off‑chain ledger with M users (and users only talking to the operator) either the system admits… | ||
| Local Proofs Approaching the Witness Length | Ron D. Rothblum | 01h 01m |
Constructs constant-round IOPs for Circuit-SAT with communication arbitrarily close to the circuit size (rate → 1), constant query complexity and quasi-linear… | ||
| nothing matches | ||