log in  |  register  |  feedback?  |  help  |  web accessibility
Sonic: A Practical zk-SNARK with a Nearly Trustless Setup
Rajdeep Talapatra
Friday, April 19, 2019, 1:00-2:00 pm Calendar
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)

Zero-knowledge proofs are becoming increasingly important for addressing privacy and scalability concerns in a variety of applications. Zk-SNARK, one of the most practical zero-knowledge schemes requires a separate trusted setup for each circuit. In this talk, we will discuss SONIC which requires a single trusted setup for all circuits. Moreover SONIC allows updates to its structured reference string which scales linearly in size. SONIC proofs are constant in size and in the batched mode of operation, the cost of verification is comparable with the most efficient SNARKs in the literature.


This talk is organized by Aria