Byzantine Agreement
From Google TechTalks · 57:42
Show by Google TechTalks
Google Tech TalksAugust 3, 2007ABSTRACTByzantine Agreement is a fundamental problem in distributed computing, that is--design a protocol to bring processors to agreementon a bit despite a fraction of bad processors behaving to disrupt the outcome. First proposed in 1980, it was proved impossible to solve deterministically which launched some of the early work on randomized algorithms. As the only (randomized) solutions for synchronous and asynchronous environments were resp., nearly linear time or exponential time, or required assumptions of private channels, this spurred the field of cryptography to develop concepts like multiparty secure computation.Uploaded 08-10-07We have designed a distributed...
More episodes of Google TechTalks
More episodes
- The Limits and Possibilities of One Run Auditing
- PhotoTechEDU Day 29: Photographing VR Panoramas
- Privacy Ripple Effects from Adding or Removing Personal Information in Language Model Training
- Inside VMware Fusion
- Java Posse Episode 100 (Live Special)
- Cascading Adversarial Bias from Injection to Distillation in Language Models
- Practical Common Lisp
- Cascading Adversarial Bias from Injection to Distillation in Language Models
- Security is Broken
- POPri: Private Federated Learning using Preference-Optimized Synthetic Data
PodSearch is a free, independent podcast search engine. Read about PodSearch, the privacy policy or contact us.