Large-Scale Consensus and Blockchains 2019
2019-10-22..2019-10-25
Berkeley, United States
who it's for
blockchain protocol researchers, distributed systems researchers, cryptography and threshold-crypto engineers, consensus protocol implementers, cryptocurrency protocol designers, academic researchers in distributed computing
topics
pbft replication and tamper-evident logs; asymmetric quorum systems; cross-chain escrow protocols; threshold cryptography stacks and dkg; provable blockchain consistency analysis; Bitcoin scaling via voter chains; proof-of-stake long-range defenses; cross-shard replay defenses; asynchronous distributed key generation; probabilistic and subsampled bft voting; optimistic linear-time bft (LibraBFTv2); incentive design for mining pools and cryptocurrencies
| title | author | length |
|---|---|---|
| PBFT and Blockchains | Barbara Liskov | 01h 05m |
Describes how Practical Byzantine Fault Tolerance becomes a usable replication engine: it uses 3f+1 replicas, an extra pre-prepare phase and cryptographic… | ||
| Consensus with Asymmetric Trust | Christian Cachin | 01h 04m |
Argues that consensus and replicated storage work when each node declares its own fail‑prone sets, formalizing a asymmetric quorum system that generalizes… | ||
| Correctness Conditions for Cross-Chain Deals | Maurice Herlihy | 01h 03m |
Paper claims existing atomic-swap models don’t cover brokered cross-chain deals where a broker uses a buyer’s funds to pay a seller; assets (tickets and coins)… | ||
| From Theory to Practice - Threshold Cryptography | Tal Rabin | 01h 06m |
Claims a practical threshold-crypto stack that trades liveness for secrecy by splitting fault bounds: security holds up to just under 1/2 corrupted, while… | ||
| On Analyzing Blockchain Consistency | Rajmohan Rajaraman | 45m |
Presents a Markov-chain framework that models proof-of-work blockchains with a random-oracle (one hash query per honest node per round), a network delay Delta… | ||
| Scaling Bitcoin to Physical Limits | David Tse | 52m |
Claims a way to provably scale Bitcoin by splitting blocks into separate roles: proposal blocks, many parallel voter chains (e.g. 1,000) and separate… | ||
| Winkle: Foiling Long Range Attacks in Proof-of-Stake Blockchains | Sarah Azouvi | 35m |
Winkle requires ordinary wallets to embed users sign transaction-originated votes so chains carry attestations from historically online accounts; combined with… | ||
| Replay Attacks and Defenses Against Cross-shard Consensus in Sharded Distributed Ledgers | Alberto Sonnino | 28m |
Shows a concrete pre-accept replay attack that replays recorded shard messages to double-spend across shards by exploiting message races and missing session… | ||
| Analysis of Nakamoto Consensus | Ling Ren | 32m |
Proves a short explicit condition for safety and liveness: honest mining beats adversary when alpha times an exponential-in-delta factor exceeds beta, with… | ||
| Flexible Byzantine Fault Tolerance | Kartik Nayak | 36m |
Claims a single consensus design that lets different clients pick their own timing and fault assumptions while increasing total tolerated faults by adding a… | ||
| Algorand: A Secure, Scalable and Decentralized Blockchain | Jing Chen | 32m |
A permissionless chain implements a pure proof-of-stake system that never requires token locking or punishments, runs a live mainnet, and gives immediate… | ||
| Asynchronous Distributed Key Generation | Kokoris Eleftherios | 28m |
Builds an asynchronous DKG that replaces a trusted dealer with a two-dimensional secret sharing scheme (bivariate polynomials) that separates safety and… | ||
| CHURP: Dynamic-Committee Proactive Secret Sharing | Lun Wang | 30m |
CHURP uses bivariate polynomials and a dimension‑switch trick to raise the threshold during committee handoffs, adds zero polynomials to refresh shares, and… | ||
| From Byzantine Generals to Global Harmony, Modularly | Ran Canetti | 48m |
Argues that the Universal Composability framework gives a concrete method to build ledgers and blockchain stacks modularly by proving each component realizes… | ||
| Consensus Through Herding | Rafael Pass | 56m |
Presents a protocol that achieves communication-efficient adaptive security for consensus without proof-of-work or erasure assumptions, using standard crypto… | ||
| Consensus with Adaptive Adversaries in the Synchronous and Partially Synchronous Models... | Quanquan Liu | 34m |
Protocol in the synchronous model avoids the key‑erasure assumption by chaining a continuous VDF per round to define rounds and force a time cost to produce… | ||
| Strengthening Reliable Decentralized Systems at Interchain | Josef Widder | 30m |
Describes Tendermint/Cosmos as a Byzantine fault tolerant state machine that uses rotating coordinators, weighted voting and 2/3+ commit rules for blocks… | ||
| BFTree — Scaling HotStuff to Millions of Validators | MAREK OLSZEWSKI | 31m |
System designs a virtual tree of validators that aggregates BLS signatures up from leaves so a block can finalize with a single constant-size signature… | ||
| Building Probabilistic BFT Protocols Through Subsampled Voting | Kevin Sekniqi | 29m |
Proposes a family of Avalanche DAG probabilistic BFT protocols that use repeated random subsampling (≈20 peers per query) and an increasing supermajority check… | ||
| LibraBFTv2: Optimistically-linear BFT Consensus with Concrete Latency Bounds | Mathieu Baudet | 33m |
LibraBFTv2 implements a leader-based HotStuff variant that removes probabilistic gossip and achieves optimistically-linear network complexity in the happy path… | ||
| SybilQuorum:Bootstrapping Sybil Resistant Quorum Systems from "Trust" Networks | George Danezis | 33m |
Proposes bootstrapping Sybil resistance from social trust graphs by having contacts post pairwise locked stakes on-chain to signal genuine ties, running local… | ||
| Concurrency and Privacy Challenges for Multi-hop HTLCs | Srivatsan Ravi | 27m |
Proposes replacing a single shared HTLC preimage with an XOR-combined chain of independent hashes plus non-interactive zero-knowledge proofs so intermediaries… | ||
| Incentive-Compatibility in Blockchains and Mining Pools | Tim Roughgarden | 01h 05m |
Two formal results: an axiomatic, budget‑balanced characterization shows the only rule that is Sybil‑proof, collusion‑proof and anonymous is the proportional… | ||
| Trusted Execution Environments Meet the Blockchain | Ittay Eyal | 50m |
Combines Intel SGX enclaves to replace wasteful hashing with a measured, instrumented work unit called proof of useful work where the enclave counts… | ||
| Decentralized Mining in Centralized Pools | Zhiguo He | 42m |
Model shows risk aversion drives miners into proportional pools but miners split hash across pools rather than consolidate, so decentralization can persist… | ||
| An Overview of Mechanism Design Challenges for Cryptocurrencies | Matt Weinberg | 49m |
Formal game models define miners, broadcast rules, and payoffs as fraction of blocks on the longest chain and show a concrete claim: selfish mining becomes… | ||
| nothing matches | ||