BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//cfp.ducttape.events//ethprague-2026//speaker//C9GFRK
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-ethprague-2026-DEYMMA@cfp.ducttape.events
DTSTART;TZID=CET:20260508T093000
DTEND;TZID=CET:20260508T095000
DESCRIPTION:This work explores the application and efficient deployment of 
 (standardized) post-quantum (PQ) digital signature algorithms in the block
 chain environment. Specifically\, we implement and evaluate four PQ signat
 ures in the Ethereum Virtual Machine: W-OTS\n\, XMSS\, SPHINCS+\, and MAYO
 . We focus on optimizing the gas costs of the verification algorithms as t
 hat is the signature schemes' only algorithm executed on-chain\, thus incu
 rring financial costs (transaction fees) for the users. Hence\, the verifi
 cation algorithm is the signature schemes' main bottleneck for decentraliz
 ed applications.\n\nWe examine two methods to verify post-quantum digital 
 signatures on-chain. Our practical performance evaluation shows that full 
 on-chain verification is often prohibitively costly. Naysayer proofs (FC'2
 4) allow a novel optimistic verification mode. We observe that the Naysaye
 r verification mode is generally the cheapest\, at the cost of additional 
 trust assumptions. We release our implementation called poqeth as an open-
 source library.
DTSTAMP:20261017T230423Z
LOCATION:ETHRes
SUMMARY:poqeth: Efficient\, post-quantum signature verification on Ethereum
  - Ruslan Kysil
URL:https://cfp.ducttape.events/ethprague-2026/talk/DEYMMA/
END:VEVENT
END:VCALENDAR