<div class="csl-bib-body">
<div class="csl-entry">Sefranek, M. (2026, October 29). <i>Plonk Without Random Oracles</i> [Keynote Presentation]. TUM Blockchain Conference 26, Munich, Germany.</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/232283
-
dc.description.abstract
Plonk is one of the most influential and widely used zk-SNARKs, with proofs of constant size (0.5 kB), sublinear verification time, and circuit-independent setup. All prior security analyses of Plonk - of both knowledge soundness and zero knowledge (ZK) - are in the random-oracle model (ROM), which recent work has shown to be especially problematic in the context of proof systems. Moreover, a security proof in the ROM does not justify using a system recursively, a powerful technique currently used e.g. in “zk-rollups.”
We show that for analyzing Plonk, the ROM can be avoided when making the “zero-testing” (ZT) assumption on the used hash function (and the commitment scheme). ZT is a non-interactive, falsifiable hardness assumption. Assuming ZT, we prove Plonk knowledge-sound in the algebraic group model (AGM) and computationally ZK in the standard model. Using Plonk recursively can now be justified in the recursive AGM.
To increase confidence in ZT, we prove that it holds in the ROM assuming the used commitment scheme is binding. Moreover, when using KZG commitments in the generic group model we show that collision resistance of the hash function implies ZT.
en
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
dc.description.sponsorship
FWF - Österr. Wissenschaftsfonds
-
dc.language.iso
en
-
dc.subject
Plonk
en
dc.subject
zk-SNARKs
en
dc.subject
Fiat–Shamir transformation
en
dc.subject
zero-testing assumption
en
dc.title
Plonk Without Random Oracles
en
dc.type
Presentation
en
dc.type
Vortrag
de
dc.relation.grantno
Projektnummer VRG18-002
-
dc.relation.grantno
ICT25-075
-
dc.relation.grantno
F 8500
-
dc.type.category
Keynote Presentation
-
tuw.project.title
Cryptographic Foundations of Privacy in Distributed Ledgers
-
tuw.project.title
Domainübergreifende Protokolle zur Wahrung der Privatsphäre und Symmetrische Kryptographie
-
tuw.project.title
Semantische und kryptografische Grundlagen von Informationssicherheit und Datenschutz durch modulares Design
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-06 - Forschungsbereich Security and Privacy
-
tuw.publication.orgunit
E056-10 - Fachbereich SecInt-Secure and Intelligent Human-Centric Digital Technologies
-
tuw.author.orcid
0009-0008-8987-9555
-
tuw.event.name
TUM Blockchain Conference 26
en
tuw.event.startdate
29-10-2026
-
tuw.event.enddate
31-10-2026
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Munich
-
tuw.event.country
DE
-
tuw.event.presenter
Sefranek, Marek
-
tuw.event.track
Multi Track
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.fulltext
no Fulltext
-
item.languageiso639-1
en
-
item.grantfulltext
none
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/c_18cp
-
item.openairetype
conference paper not in proceedings
-
crisitem.author.dept
E192-06 - Forschungsbereich Security and Privacy
-
crisitem.author.orcid
0009-0008-8987-9555
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.project.funder
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
crisitem.project.funder
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds