Distributed-prover interactive proofs

DOI10.1007/978-3-031-48615-9_4MaRDI QIDQ6581784zbMATH OpenFDO

Authors Sourav Das, Rex Fernando, Ilan Komargodski, Elaine Shi, Pratik Soni

Publication date 1 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48615-9_4

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Recommendations

• Interactive distributed proofs
• The power of distributed verifiers in interactive proofs
• Interactive proofs of proximity: delegating computation in sublinear time
• Constant-round interactive proofs for delegating computation
• Constant-round interactive proofs for delegating computation

Cites work

• \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
• A method for obtaining digital signatures and public-key cryptosystems
• Advances in Cryptology - CRYPTO 2003
• Aurora: transparent succinct arguments for R1CS
• Constant-Size Commitments to Polynomials and Their Applications
• Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
• Distributed zero-knowledge proofs over networks
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Efficient verifiable delay functions
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Fast Reed-Solomon interactive oracle proofs of proximity
• Gemini: elastic SNARKs for diverse environments
• scientific article; zbMATH DE number 1256636 (Why is no real title available?)
• scientific article; zbMATH DE number 6297759 (Why is no real title available?)
• scientific article; zbMATH DE number 7650353 (Why is no real title available?)
• Interactive distributed proofs
• Log diameter rounds algorithms for 2-vertex and 2-edge connectivity
• Maliciously secure massively parallel computation for all-but-one corruptions
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
• Massively Parallel Computation of Matching and MIS in Sparse Graphs
• Non-deterministic exponential time has two-prover interactive protocols
• Parallel algorithms for geometric graph problems
• Parallel coin-tossing and constant-round secure two-party computation
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
• Round compression for parallel matching algorithms
• Secure massively parallel computation for dishonest majority
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
• Signatures of correct computation
• The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
• The Knowledge Complexity of Interactive Proof Systems
• The power of distributed verifiers in interactive proofs
• Transparent SNARKs from DARK compilers

Cited in

(1)

• Brief announcement: Distributed quantum proofs for replicated data

This page was built for publication: Distributed-prover interactive proofs

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