Building Probabilistic BFT Protocols Through Subsampled Voting

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=EKogZsOxboU


Duration: 29:21
1,081 views
31

Kevin Sekniqi (Cornell University)
https://simons.berkeley.edu/talks/tba-112
Large-Scale Consensus and Blockchains



Other Videos By Simons Institute for the Theory of Computing


2019-11-18Law and CS
2019-11-08Algorand's Forthcoming Blockchain Technology
2019-11-06Byzantine Fault Tolerance Meets Flexibility
2019-10-25An Overview of Mechanism Design Challenges for Cryptocurrencies
2019-10-25Trusted Execution Environments Meet the Blockchain
2019-10-25Decentralized Mining in Centralized Pools
2019-10-25Incentive-Compatibility in Blockchains and Mining Pools
2019-10-24Concurrency and Privacy Challenges for Multi-hop HTLCs
2019-10-24SybilQuorum:Bootstrapping Sybil Resistant Quorum Systems from "Trust" Networks
2019-10-24LibraBFTv2: Optimistically-linear BFT Consensus with Concrete Latency Bounds
2019-10-24Building Probabilistic BFT Protocols Through Subsampled Voting
2019-10-24BFTree — Scaling HotStuff to Millions of Validators
2019-10-24Strengthening Reliable Decentralized Systems at Interchain
2019-10-24Consensus with Adaptive Adversaries in the Synchronous and Partially Synchronous Models...
2019-10-24Consensus Through Herding
2019-10-24From Byzantine Generals to Global Harmony, Modularly
2019-10-23CHURP: Dynamic-Committee Proactive Secret Sharing
2019-10-23Asynchronous Distributed Key Generation
2019-10-23Algorand: A Secure, Scalable and Decentralized Blockchain
2019-10-23Flexible Byzantine Fault Tolerance
2019-10-23Analysis of Nakamoto Consensus


Tags:
Large-Scale Consensus and Blockchains
Kevin Sekniqi
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley