Snarky ceremonies
From MaRDI portal
Publication:6157546
DOI10.1007/978-3-030-92078-4_4zbMATH Open1514.94109OpenAlexW4256107193MaRDI QIDQ6157546FDOQ6157546
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
Recommendations
Cites Work
- The knowledge complexity of interactive proof-systems
- Short pairing-based non-interactive zero-knowledge arguments
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Quadratic span programs and succinct NIZKs without PCPs
- Updatable and universal common reference strings with applications to zk-SNARKs
- The algebraic group model and its applications
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Verifiable delay functions
- Simple verifiable delay functions
- Efficient verifiable delay functions
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- On the size of pairing-based non-interactive arguments
- Scalable zero knowledge via cycles of elliptic curves
- Square span programs with applications to succinct NIZK arguments
- A subversion-resistant SNARK
- Subversion-zero-knowledge SNARKs
- UC-secure CRS generation for SNARKs
- A classification of computational assumptions in the algebraic group model
- Composition with knowledge assumptions
- Another look at extraction and randomization of Groth's zk-SNARK
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
- Concurrently secure blind Schnorr signatures
- Mining for privacy: how to bootstrap a snarky blockchain
- UC-secure CRS generation for SNARKs
- 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)
