BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//cfp.pass-the-salt.org//pts2023//talk//LQ7RVH
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-pts2023-LQ7RVH@cfp.pass-the-salt.org
DTSTART;TZID=CET:20230705T103500
DTEND;TZID=CET:20230705T105500
DESCRIPTION:Over the last few years\, the popularity of proving systems bas
 ed on zkSNARKs (Zero-Knowledge Succinct Non-Interactive Argument of Knowle
 dge) has risen\, typically due to real-world use cases such as private aut
 hentication\, private set membership\, proofs of correct execution by a no
 n-trusted entity and more.\n\nThere are different proving systems that hav
 e been proposed in the last 5-7 years (Groth16\, Marlin\, PLONK\, TurboPLO
 NK\, etc.)\, with their primary objectives being reducing the size of the 
 proof\, reducing the proving/verifying time and minimizing the need for a 
 trusted setup. Further\, there are different ways to implement zkSNARKs\, 
 but the common idea behind all of them is that the construction has to be 
 represented in an arithmetic circuit on top of a finite field. This is pos
 sible using domain-specific languages (DSLs) such as Circom or Leo\, or us
 ing a library such as gnark\, Halo2 or arkworks-rs.\n\nIn the aforemention
 ed applications\, typically\, encryption and hashing operations are needed
 . However\, the performance of traditional designs such as AES or BLAKE2 i
 s not optimal in circuits. This has led to the apparition of arithmetizati
 on-oriented constructions for hashing and encryption. Moreover\, the Spong
 e API for Field Elements (SAFE API) has been recently proposed\, which can
  be used to create different cryptographic primitives for zkSNARK circuits
  using the sponge construction. In many cases\, the performance of this ty
 pe of constructions and the difficulty of implementing them using modern l
 ibraries for creating circuits has not been evaluated.\n\nIn this talk\, w
 e present zekrom\, an open-source library of arithmetization-oriented cons
 tructions for zkSNARK circuits. The goal of zekrom is to analyze the perfo
 rmance of novel constructions for circuits using modern libraries such as 
 arkworks-rs and Halo2 and frameworks such as the SAFE API. Other goals of 
 zekrom are: 1) to provide recently proposed arithmetization-oriented const
 ructions for creating privacy-friendly applications based on zero-knowledg
 e proofs\, 2) to help developers by providing tools to generate the type o
 f parameters that this type of constructions require\, and 3) to provide a
  reusable implementation of the SAFE API that can be easily adapted to new
  proposed permutations for circuits. Finally\, in our talk\, we'll describ
 e the obstacles we have found when implementing this type of construction.
DTSTAMP:20261111T100555Z
LOCATION:Amphitheater
SUMMARY:zekrom: an open-source library of arithmetization-oriented construc
 tions for zkSNARK circuits - Antonio de la Piedra\, Laurent Thoeny
URL:https://cfp.pass-the-salt.org/pts2023/talk/LQ7RVH/
END:VEVENT
END:VCALENDAR
