AuthorsM. Kohlweiss, M. Maller, J. Siim and M. Volkhov
EditorsM. Tibouchi and H. Wang
TitleSnarky Ceremonies
AfilliationCryptography
Project(s)No Simula project
StatusPublished
Publication TypeProceedings, refereed
Year of Publication2021
Conference NameAsiacrypt 2021
Volume13092
Pagination98 - 127
PublisherSpringer International Publishing
Place PublishedCham
ISBN Number978-3-030-92077-7
ISSN Number0302-9743
Abstract

Succinct non-interactive arguments of knowledge (SNARKs) have found numerous applications in the blockchain setting and elsewhere. The most efficient SNARKs require a distributed ceremony protocol to generate public parameters, also known as a structured reference string (SRS). Our contributions are two-fold:

- We give a security framework for non-interactive zero-knowledge arguments with a ceremony protocol.

- We revisit the ceremony protocol of Groth’s SNARK [Bowe et al., 2017]. We show that the original construction can be simplified and optimized, and then prove its security in our new framework. Importantly, our construction avoids the random beacon model used in the original work.
URLhttps://link.springer.com/chapter/10.1007/978-3-030-92078-4_4
DOI10.1007/978-3-030-92078-410.1007/978-3-030-92078-4_4
Citation Key43118