Locally verifiable distributed SNARGs
From MaRDI portal
Distributed systems (68M14) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Cryptography (94A60)
Recommendations
Cites work
- A meta-theorem for distributed certification
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Boosting batch arguments and RAM delegation
- Brief Announcement: On Polynomial-Time Local Decision
- Computationally Sound Proofs
- Delegating RAM Computations
- Delegation for bounded space
- Distributed Computing: A Locality-Sensitive Approach
- Distributed verification and hardness of distributed approximation
- Distributed zero-knowledge proofs over networks
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- How to delegate computations
- How to delegate computations publicly
- scientific article; zbMATH DE number 1670844 (Why is no real title available?)
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- Interactive distributed proofs
- Introduction to local certification
- Locally checkable proofs in distributed computing
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive delegation and batch NP verification from standard computational assumptions
- On distributed Merlin-Arthur decision protocols
- On the Impact of Identifiers on Local Decision
- Proof labeling schemes
- Proof labeling schemes for reachability-related problems in directed graphs
- Proof-labeling schemes: broadcast, unicast and in between
- Randomized proof-labeling schemes
- Redundancy in distributed proofs
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Succinct delegation for low-space non-deterministic computation
- Succinct NP Proofs from an Extractability Assumption
- The power of distributed verifiers in interactive proofs
- Towards a complexity theory for local distributed computing
- What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs
- What can be decided locally without identifiers?
- What can be verified locally?
This page was built for publication: Locally verifiable distributed SNARGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581783)
