SPARKs: succinct parallelizable arguments of knowledge
From MaRDI portal
Publication:2055636
DOI10.1007/978-3-030-45721-1_25OpenAlexW3023800193MaRDI QIDQ2055636
Ilan Komargodski, Rafael Pass, Naomi Ephraim, Cody Freitag
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45721-1_25
Related Items (8)
Time- and space-efficient arguments from groups of unknown order ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) ⋮ NIZK from SNARGs ⋮ Parallelizable delegation from LWE ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more
Cites Work
- Unnamed Item
- Parallel coin-tossing and constant-round secure two-party computation
- Sustained space complexity
- Verifiable delay functions
- The hunting of the SNARK
- Trapdoor hash functions and their applications
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Local zero knowledge
- High Parallel Complexity Graphs and Memory-Hard Functions
- Delegating Computation
- Interactive Oracle Proofs
- Delegating RAM Computations
- Interactive PCP
- Concurrent Nonmalleable Commitments
- Short PCPs with Polylog Query Complexity
- Universal Arguments and their Applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Computationally Sound Proofs
- Vector Commitments and Their Applications
- Simple verifiable delay functions
- Depth-Robust Graphs and Their Cumulative Memory Complexity
- Constant-round interactive proofs for delegating computation
- Advances in Cryptology - CRYPTO 2003
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Pebbling and Proofs of Work
- On the concrete efficiency of probabilistically-checkable proofs
- On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
- The PCP theorem by gap amplification
- Efficient verifiable delay functions
This page was built for publication: SPARKs: succinct parallelizable arguments of knowledge
