Snarky ceremonies

DOI10.1007/978-3-030-92078-4_4MaRDI QIDQ6157546zbMATH OpenOpenAlexFDO

Authors Markulf Kohlweiss, Mary Maller, Janno Siim, Mikhail Volkhov

Publication date 12 May 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-92078-4_4

zbMATH Keywords

blockchainnon-interactive zero-knowledge arguments

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Mining for privacy: how to bootstrap a snarky blockchain
• UC-secure CRS generation for SNARKs
• The hunting of the SNARK
• A unified framework for non-universal SNARKs
• Subversion-zero-knowledge SNARKs

Cites work

• A classification of computational assumptions in the algebraic group model
• A subversion-resistant SNARK
• Another look at extraction and randomization of Groth's zk-SNARK
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Composition with knowledge assumptions
• Efficient verifiable delay functions
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• On the size of pairing-based non-interactive arguments
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Scalable zero knowledge via cycles of elliptic curves
• Short pairing-based non-interactive zero-knowledge arguments
• Simple verifiable delay functions
• Square span programs with applications to succinct NIZK arguments
• Subversion-zero-knowledge SNARKs
• The algebraic group model and its applications
• The knowledge complexity of interactive proof-systems
• UC-secure CRS generation for SNARKs
• Updatable and universal common reference strings with applications to zk-SNARKs
• Verifiable delay functions

Cited in

(11)

• A unified framework for non-universal SNARKs
• Algebraic group model with oblivious sampling
• CRS-updatable asymmetric quasi-adaptive NIZK arguments
• \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
• Benchmarking the setup of updatable zk-SNARKs
• Mining for privacy: how to bootstrap a snarky blockchain
• UC-secure CRS generation for SNARKs
• Concurrently secure blind Schnorr signatures
• Sometimes you can't distribute random-oracle-based proofs
• Secure multiparty computation with identifiable abort via vindicating release
• On the concrete security of non-interactive FRI

This page was built for publication: Snarky ceremonies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157546)