BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//cfp.ducttape.events//ethereum-zurich-2026//talk//CHUBNY
BEGIN:VTIMEZONE
TZID:CET
BEGIN:STANDARD
DTSTART:20001029T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000326T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-ethereum-zurich-2026-CHUBNY@cfp.ducttape.events
DTSTART;TZID=CET:20260410T165000
DTEND;TZID=CET:20260410T171000
DESCRIPTION:Verifiable Random Functions (VRFs) are a critical building bloc
 k for many consensus protocols in PoS blockchains.\nHowever\, such applica
 tions require a strong security property called "unbiasability" that is no
 t covered by the traditional security properties correctness\, pseudorando
 mness and uniqueness.\nIn this talk I will showcase a surprisingly simple 
 Hash-then-VRF construction that adds provable unbiasability (in the standa
 rd model) to any VRF at negligible cost.\nOur construction is superior com
 pared the folklore VUF-then-Hash construction in both security and potenti
 ally efficiency.\nWhile our construction is extremely simple\, the analysi
 s requires a newly developed non-black-box technique that leverages a spec
 ial property that all known VRFs have.
DTSTAMP:20261013T183021Z
LOCATION:Glatt (Y22-F-68/70)
SUMMARY:Unbiasable Verifiable Random Functions (efficient and generic) - Ni
 cholas Brandt
URL:https://cfp.ducttape.events/ethereum-zurich-2026/talk/CHUBNY/
END:VEVENT
END:VCALENDAR