BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Analyzing the Real-World Security of the Algorand Blockchain
DTSTART:20231201T110000
DTEND:20231201T120000
DTSTAMP:20260506T002633Z
UID:2353262dcb338b2515e7b816e92e118f89efee684f5f14bf79ac8f56
CATEGORIES:Conferences - Seminars
DESCRIPTION:Derek Leung\nMIT CSAIL  \n\nThe Algorand consensus protocol i
 s interesting both in theory and in practice. On the theoretical side\, to
  achieve adaptive security\, it introduces the novel idea of player replac
 eability\, where each step of the protocol is executed by a different rand
 omly selected committee whose members remain secret until they send their 
 first and only message. The protocol provides consistency under arbitrary 
 network conditions and liveness under intermittent network partitions. On 
 the practical side\, the protocol is used to secure the Algorand cryptocur
 rency\, whose total value is approximately $850M at the time of writing.\n
 \n \n\nThe Algorand protocol in use differs substantially from the protoc
 ols described in the published literature on Algorand. Despite its signifi
 cance\, it lacks a formal analysis. In this work\, we describe and analyze
  the Algorand consensus protocol as deployed today in Algorand’s ecosyst
 em. We show that the overall protocol framework is sound by characterizing
  network conditions and parameter settings under which the protocol can be
  proven secure.\n\n \n\nThis paper appears in the proceedings of CCS ’2
 3.\n\n\n \n\nPre-print URL: https://eprint.iacr.org/2023/1344.pdf
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR