YoVDO

Scalable Bias-Resistant Distributed Randomness

Offered By: IEEE via YouTube

Tags

IEEE Symposium on Security and Privacy Courses Cryptography Courses Network Security Courses Scalability Courses Decentralized Systems Courses Byzantine Fault Tolerance Courses

Course Description

Overview

Explore a conference talk that delves into the challenges and solutions for generating bias-resistant public randomness in large-scale distributed systems. Learn about two innovative protocols, RandHound and RandHerd, designed to provide publicly-verifiable, unpredictable, and unbiasable randomness against Byzantine adversaries. Discover how RandHound leverages an untrusted client to divide randomness servers into groups for scalability, while RandHerd implements an efficient, decentralized randomness beacon. Examine the structural similarities between RandHerd and BFT protocols, and understand how RandHound is utilized in a one-time setup to create unbiased random secret-sharing groups. Gain insights into the performance and failure probability of these protocols across hundreds of participants, and learn how proper parameter selection, such as group size and secret-sharing threshold, impacts their effectiveness. Understand the practical applications of these protocols in various distributed systems requiring secure and unbiased randomness generation.

Syllabus

Scalable Bias-Resistant Distributed Randomness


Taught by

IEEE Symposium on Security and Privacy

Tags

Related Courses

PBFT and Blockchains
Simons Institute via YouTube
Good-Case Latency of Byzantine Broadcast: A Complete Categorization
Association for Computing Machinery (ACM) via YouTube
Sync HotStuff: Simple and Practical Synchronous State Machine Replication
IEEE via YouTube
DispersedLedger - High-Throughput Byzantine Consensus on Variable Bandwidth Networks
USENIX via YouTube
COBRA - Dynamic Proactive Secret Sharing for Confidential BFT Services
IEEE via YouTube