SPARKs: succinct parallelizable arguments of knowledge
type: Item
instance of: scholarly article
title: SPARKs: succinct parallelizable arguments of knowledge
DOI: 10.1007/978-3-030-45721-1_25
author: Naomi Ephraim
author: Cody Freitag
author: Ilan Komargodski
author: Rafael Pass
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68Txx
zbMATH DE Number: 7436936
MaRDI profile type: Publication
full work available at URL: 978-3-030-45721-1 25
OpenAlex ID: W3023800193
cites work: Depth-Robust Graphs and Their Cumulative Memory Complexity
cites work: Sustained space complexity
cites work: On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
cites work: High Parallel Complexity Graphs and Memory-Hard Functions
cites work: Universal Arguments and their Applications
cites work: Q5111371
cites work: On the concrete efficiency of probabilistically-checkable proofs
cites work: SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
cites work: Interactive Oracle Proofs
cites work: Short PCPs with Polylog Query Complexity
cites work: The hunting of the SNARK
cites work: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
cites work: Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
cites work: Verifiable delay functions
cites work: Vector Commitments and Their Applications
cites work: The PCP theorem by gap amplification
cites work: Trapdoor hash functions and their applications
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Pebbling and Proofs of Work
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Delegating Computation
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Delegating RAM Computations
cites work: Interactive PCP
cites work: Parallel coin-tossing and constant-round secure two-party computation
cites work: Computationally Sound Proofs
cites work: Local zero knowledge
cites work: Concurrent Nonmalleable Commitments
cites work: Simple verifiable delay functions
cites work: Constant-round interactive proofs for delegating computation
cites work: Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
cites work: Efficient verifiable delay functions
Recommended article: SPARKs: Succinct Parallelizable Arguments of Knowledge
Recommended article: Q5282955
Recommended article: Epistemic Argumentation Framework: Theory and Computation
Recommended article: A taxonomy of parallel strategies for deduction
Recommended article: On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks
description: scientific article; zbMATH DE number 7436936