Crypto Seminar
— 5:30pm
Location:
In Person and Virtual - ET
-
Gates Hillman 8102 and Zoom
Speaker:
ZIYI GUAN
,
Ph.D. Student, Theory Group, School of Computer and Communication Sciences, École polytechnique fédérale de Lausanne - EPFL
https://ziyiguan.github.io/
Security Bounds for Proof-Carrying Data from Straightline Extractors
Proof-carrying data (PCD) is a widely used cryptographic primitive that can be obtained by recursively-composing SNARKs or related primitives. However, these constructions do not come with security analyses that yield useful concrete security bounds.
In this work we show that the PCD obtained from SNARKs with straightline knowledge soundness has essentially the same security as the underlying SNARK. In this setting, recursive composition incurs no security loss.
As a notable application, our work offers an idealized model that provides useful, albeit heuristic, guidance for setting the security parameters of recursive STARKs currently used in blockchain systems.
ng data (PCD) is a widely used cryptographic primitive that can be obtained by recursively-composing SNARKs or related primitives. However, these constructions do not come with security analyses that yield useful concrete security bounds.
In this work we show that the PCD obtained from SNARKs with straightline knowledge soundness has essentially the same security as the underlying SNARK. In this setting, recursive composition incurs no security loss.
As a notable application, our work offers an idealized model that provides useful, albeit heuristic, guidance for setting the security parameters of recursive STARKs currently used in blockchain systems.
Based on joint work with Alessandro Chiesa, Shahar Samocha, and Eylon Yogev.
In Person and Zoom Participation. See announcement.
Event Website:
https://sites.google.com/view/crypto-seminar/home