Pages that link to "Item:Q4977995"
From MaRDI portal
The following pages link to Non-interactive delegation and batch NP verification from standard computational assumptions (Q4977995):
Displaying 26 items.
- 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)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- (Q5121910) (← links)
- Succinct delegation for low-space non-deterministic computation (Q5230332) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- Locally verifiable distributed SNARGs (Q6581783) (← links)
- On black-box verifiable outsourcing (Q6581787) (← links)
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors (Q6582222) (← links)
- Lattice-based functional commitments: fast verification and cryptanalysis (Q6604929) (← links)
- Rate-1 fully local somewhere extractable hashing from DDH (Q6635830) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- Monotone-policy aggregate signatures (Q6637524) (← links)
- Strong batching for non-interactive statistical zero-knowledge (Q6637570) (← links)
