Pages that link to "Item:Q5230332"
From MaRDI portal
The following pages link to Succinct delegation for low-space non-deterministic computation (Q5230332):
Displaying 15 items.
- Outsourcing computation: the minimal refereed mechanism (Q777972) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Non-interactive delegation and batch NP verification from standard computational assumptions (Q4977995) (← links)
- DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES (Q5122159) (← links)
- Delegation for bounded space (Q5495827) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme (Q6086333) (← links)
- Locally verifiable distributed SNARGs (Q6581783) (← links)
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors (Q6582222) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
