Large-Scale Consensus and Blockchains

Program

Proofs, Consensus, and Decentralizing Society

Location

Calvin Lab auditorium

Date

Tuesday, Oct. 22 – Friday, Oct. 25, 2019

Back to calendar

9 – 9:20 a.m.

Coffee and Check-In

9:20 – 9:30 a.m.

Welcome Remarks

9:30 – 10:30 a.m.

PBFT and Blockchains

Barbara Liskov (MIT)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Consensus with Asymmetric Trust

Christian Cachin (University of Bern)

12 – 2 p.m.

Lunch

2 – 3 p.m.

Correctness Conditions for Cross-Chain Deals

Maurice Herlihy (Brown University)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

From Theory to Practice - Threshold Cryptography

Tal Rabin (University of Pennsylvania and AWS)

4:30 – 5:30 p.m.

Reception

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:15 a.m.

On Analyzing Blockchain Consistency

Rajmohan Rajaraman (Northeastern University)

10:15 – 11 a.m.

Scaling Bitcoin to Physical Limits

David Tse (Stanford University)

11 – 11:30 a.m.

Break

11:30 a.m. – 12 p.m.

Winkle: Foiling Long Range Attacks in Proof-of-Stake Blockchains

Sarah Azouvi (UCL)

12 – 12:30 p.m.

Replay Attacks and Defenses Against Cross-shard Consensus in Sharded Distributed Ledgers

Alberto Sonnino (Facebook/Calibra)

12:30 – 2 p.m.

Lunch

2 – 2:30 p.m.

Analysis of Nakamoto Consensus

Ling Ren (UIUC)

2:30 – 3 p.m.

Flexible Byzantine Fault Tolerance

Kartik Nayak (Duke University)

3 – 3:30 p.m.

Algorand: A Secure, Scalable and Decentralized Blockchain

Jing Chen (Stony Brook University and Algorand Inc.)

3:30 – 4 p.m.

Break

4 – 4:30 p.m.

Asynchronous Distributed Key Generation

Kokoris Eleftherios (EPFL)

4:30 – 5 p.m.

CHURP: Dynamic-Committee Proactive Secret Sharing

Lun Wang (UC Berkeley)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:15 a.m.

From Byzantine Generals to Global Harmony, Modularly

Ran Canetti (Boston University & Tel Aviv University)

10:15 – 11 a.m.

Consensus Through Herding

Rafael Pass (Cornell University)

11 – 11:30 a.m.

Break

11:30 a.m. – 12 p.m.

Consensus with Adaptive Adversaries in the Synchronous and Partially Synchronous Models: Binary Byzantine Agreement and Block Consensus

Quanquan Liu (MIT)

12 – 12:30 p.m.

Strengthening Reliable Decentralized Systems at Interchain

Josef Widder (Tendermint/Interchain)

12:30 – 2 p.m.

Lunch

2 – 2:30 p.m.

BFTree — Scaling HotStuff to Millions of Validators

Marek Olszewski (Celo)

2:30 – 3 p.m.

Building Probabilistic BFT Protocols Through Subsampled Voting

Kevin Sekniqi (Cornell University)

3 – 3:30 p.m.

LibraBFTv2: Optimistically-linear BFT Consensus with Concrete Latency Bounds

Mathieu Baudet (Facebook/Calibra)

3:30 – 4 p.m.

Break

4 – 4:30 p.m.

SybilQuorum:Bootstrapping Sybil Resistant Quorum Systems from "Trust" Networks

George Danezis (UCL and Facebook/Calibra)

4:30 – 5 p.m.

Concurrency and Privacy Challenges for Multi-hop HTLCs

Srivatsan Ravi (USC)

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Incentive-Compatibility in Blockchains and Mining Pools

Tim Roughgarden (Columbia University)

10:30 – 11 a.m.

Break

11 – 11:45 a.m.

Trusted Execution Environments Meet the Blockchain

Ittay Eyal (Technion)

11:45 a.m. – 12:30 p.m.

Decentralized Mining in Centralized Pools

Zhiguo He (University of Chicago)

12:30 – 2 p.m.

Lunch

2 – 3 p.m.

The BItcoin Payment System as a Two-Sided Market

Jacob Leshno (University of Chicago)

3 – 3:30 p.m.

Break

3:30 – 4:15 p.m.

An Overview of Mechanism Design Challenges for Cryptocurrencies

Matt Weinberg (Princeton University)