BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SECURITY & APPLIED LOGIC - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://sal.cs.unibuc.ro
X-WR-CALDESC:Events for SECURITY & APPLIED LOGIC
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Bucharest
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20251026T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20261025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20270328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20271031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20260623T143000
DTEND;TZID=Europe/Bucharest:20260623T160000
DTSTAMP:20260708T153703
CREATED:20260626T073203Z
LAST-MODIFIED:20260626T073203Z
UID:868-1782225000-1782230400@sal.cs.unibuc.ro
SUMMARY:Making zkSNARKs Non-Malleable
DESCRIPTION:Title: Making zkSNARKs Non-Malleable \nSpeaker: Antonio Faonio (Eurecom) \n\nAbstract: Zero-knowledge SNARKs (zkSNARKs) are cryptographic proof systems that allow a prover to convince a verifier that a statement is true\, with very small proofs and fast verification\, without revealing the underlying witness. The standard security notion for SNARKs is knowledge soundness\, which guarantees that any prover who convinces the verifier must “know” a valid witness. A stronger notion is simulation extractability\, which ensures that even an adversary who has seen simulated proofs cannot create a new valid proof without actually knowing a witness\, and in particular implies non-malleability. This stronger guarantee is especially important in distributed and adversarial settings\, where proof malleability can become a real threat. In this talk\, we revisit simulation extractability for universal zkSNARKs in the PIOP-to-SNARK paradigm. We discuss how this property can be achieved and analyzed in systems used in practice\, with particular attention to optimizations such as the linearization trick. We also place these results in a broader context\, reviewing existing approaches to simulation extractability in the literature and highlighting alternative techniques and trade-offs. The goal is to give a unified and accessible picture of how simulation extractability can be obtained in modern zkSNARK constructions\, and what design choices are needed to ensure it in practice. \n  \n\nAcknowledgement: This seminar talk is due to the PATTERN CHIST-ERA project https://chistera-pattern.github.io/ ; https://sites.google.com/unibuc.ro/patternub \n \nPATTERN receives funding from the French National Research Agency under Grant Agreement No. ANR-23-CHR4-0008\, the Luxembourg National Fund under Grant Agreement No. INTER/CHIST23/17931746\, and the Romanian Ministry of Research\, Innovation and Digitization\, CNCS/CCCDI – UEFISCDI\, project number ERANET-CHISTERA-IV-PATTERN\, within PNCDI IV.
URL:https://sal.cs.unibuc.ro/event/making-zksnarks-non-malleable/
LOCATION:Facultatea de Matematica si Informatica\, sala S.512\, Romania
CATEGORIES:Cryptography Seminar
END:VEVENT
END:VCALENDAR