BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:635@lincs.fr
DTSTART;TZID=Europe/Paris:20210707T140000
DTEND;TZID=Europe/Paris:20210707T150000
DTSTAMP:20210708T113303Z
URL:https://www.lincs.fr/events/maliciously-secure-consensus-from-succinct
 -arguments-and-short-transparent-threshold-signatures/
SUMMARY:"Maliciously secure consensus from succinct arguments\, and short
 transparent threshold signatures"
DESCRIPTION:We consider consensus protocols\, for application to state
 machine replication\, in the model of Castro-Liskov-Dolev-Lynch-Stockmeyer
 (partial synchrony\, black box leader election\, malicious corruptions).
 These protocols enable n players to output the same value\, such that the
 output satisfies some publicly verifiable validity condition.\n\nEfforts
 since "PBFT" (Castro-Liskov '99)\, aim at reducing the communication
 complexity. A breakthrough was achieved by Hotstuff (Podc'19)\, implemented
 in Facebook's Diem. It has complexity quasi linear in n the number of
 players\, but at the price of extra latency.\n\nWe show how to overcome
 this limitation. First\, with an explicit elementary construction in O(n
 log(n))\, with a small constant overhead. Then\, from the use of succinct
 noninteractive arguments of knowledge.\n\nIf time allows\, we will explain
 the simplest: an argument of knowledge of k &nbsp\;BLS signatures on the
 same message m\, out of n public keys. This provides the first threshold
 signature with logarithmic size without trusted
 setup.\n\n&nbsp\;\n\n&nbsp\;
CATEGORIES:Seminars,Youtube
LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\,
 Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20210328T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR