BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Very large-scale information dissemination
DTSTART:20180705T140000
DTEND:20180705T160000
DTSTAMP:20260408T064429Z
UID:16af76b7e10f0f53824039ee9d9946ffb0c237bbf05481983888dba1
CATEGORIES:Conferences - Seminars
DESCRIPTION:Matteo Monti\nEDIC candidacy exam\nExam president: Prof. Jean-
 Pierre Hubaux\nThesis advisor: Prof. Rachid Guerraoui\nCo-examiner: Prof. 
 Bryan Ford\n\nAbstract\nReliable information dissemination algorithms are 
 a versatile tool with multiple applications in decentralized and distribut
 ed information storage and processing\, but often come at a super-linear c
 ost in terms of computation and communication complexity. We generalize we
 ll-known deterministic reliable broadcast algorithms to their probabilisti
 c counterparts\, analyze their reliability and optimize their trade-offs t
 o provide quasilinear complexity.\n\nBackground papers\nBrahms: Byzantine 
 Resilient Random Membership Sampling - Computer Networks 09\nCONIKS: Brin
 ging Key Transparency to End Users - 24th USENIX Security Symposium (USE
 NIX Security 15)\nA random zoo: sloth\, unicorn\, and trx - Cryptology eP
 rint Archive\, Report 2015/366\n \n 
LOCATION:BC 129 https://plan.epfl.ch/?room==BC%20129
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR