Snarky ceremonies
From MaRDI portal
Publication:6157546
DOI10.1007/978-3-030-92078-4_4zbMath1514.94109OpenAlexW4256107193MaRDI QIDQ6157546
Mary Maller, Markulf Kohlweiss, Mikhail Volkhov, Janno Siim
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
Related Items (3)
A Unified Framework for Non-universal SNARKs ⋮ CRS-updatable asymmetric quasi-adaptive NIZK arguments ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
Cites Work
- Updatable and universal common reference strings with applications to zk-SNARKs
- Verifiable delay functions
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- A subversion-resistant SNARK
- Subversion-zero-knowledge SNARKs
- The algebraic group model and its applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- A classification of computational assumptions in the algebraic group model
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Composition with knowledge assumptions
- Another look at extraction and randomization of Groth's zk-SNARK
- UC-secure CRS generation for SNARKs
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Square Span Programs with Applications to Succinct NIZK Arguments
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- The knowledge complexity of interactive proof-systems
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Simple verifiable delay functions
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient verifiable delay functions
This page was built for publication: Snarky ceremonies
