Locally verifiable distributed SNARGs
From MaRDI portal
Publication:6581783
DOI10.1007/978-3-031-48615-9_3zbMATH Open1544.94215MaRDI QIDQ6581783
Tal Moran, Unnamed Author, Elette Boyle, Ran Cohen, Rotem Oshman
Publication date: 1 August 2024
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- What can be verified locally?
- Space-time tradeoffs for distributed verification
- Randomized proof-labeling schemes
- Redundancy in distributed proofs
- Proof labeling schemes for reachability-related problems in directed graphs
- A meta-theorem for distributed certification
- Non-interactive batch arguments for NP from standard assumptions
- On distributed Merlin-Arthur decision protocols
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Delegating RAM Computations
- Succinct NP Proofs from an Extractability Assumption
- Fast Distributed Construction of Smallk-Dominating Sets and Applications
- Computationally Sound Proofs
- Distributed Computing: A Locality-Sensitive Approach
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Introduction to local certification
- Proof-Labeling Schemes: Broadcast, Unicast and in Between
- The Power of Distributed Verifiers in Interactive Proofs
- What can be decided locally without identifiers?
- Proof labeling schemes
- Interactive Distributed Proofs
- How to delegate computations publicly
- Succinct delegation for low-space non-deterministic computation
- How to delegate computations
- Towards a complexity theory for local distributed computing
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Distributed verification and hardness of distributed approximation
- Delegation for bounded space
- On the Impact of Identifiers on Local Decision
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs
- Brief Announcement: On Polynomial-Time Local Decision
- Boosting batch arguments and RAM delegation
- Distributed zero-knowledge proofs over networks
This page was built for publication: Locally verifiable distributed SNARGs
