Very large-scale information dissemination
Event details
| Date | 05.07.2018 |
| Hour | 14:00 › 16:00 |
| Speaker | Matteo Monti |
| Location | |
| Category | Conferences - Seminars |
EDIC candidacy exam
Exam president: Prof. Jean-Pierre Hubaux
Thesis advisor: Prof. Rachid Guerraoui
Co-examiner: Prof. Bryan Ford
Abstract
Reliable information dissemination algorithms are a versatile tool with multiple applications in decentralized and distributed information storage and processing, but often come at a super-linear cost in terms of computation and communication complexity. We generalize well-known deterministic reliable broadcast algorithms to their probabilistic counterparts, analyze their reliability and optimize their trade-offs to provide quasilinear complexity.
Background papers
Brahms: Byzantine Resilient Random Membership Sampling - Computer Networks 09
CONIKS: Bringing Key Transparency to End Users - 24th USENIX Security Symposium (USENIX Security 15)
A random zoo: sloth, unicorn, and trx - Cryptology ePrint Archive, Report 2015/366
Exam president: Prof. Jean-Pierre Hubaux
Thesis advisor: Prof. Rachid Guerraoui
Co-examiner: Prof. Bryan Ford
Abstract
Reliable information dissemination algorithms are a versatile tool with multiple applications in decentralized and distributed information storage and processing, but often come at a super-linear cost in terms of computation and communication complexity. We generalize well-known deterministic reliable broadcast algorithms to their probabilistic counterparts, analyze their reliability and optimize their trade-offs to provide quasilinear complexity.
Background papers
Brahms: Byzantine Resilient Random Membership Sampling - Computer Networks 09
CONIKS: Bringing Key Transparency to End Users - 24th USENIX Security Symposium (USENIX Security 15)
A random zoo: sloth, unicorn, and trx - Cryptology ePrint Archive, Report 2015/366
Practical information
- General public
- Free