Pages that link to "Item:Q5212851"
From MaRDI portal
The following pages link to How to delegate computations publicly (Q5212851):
Displayed 24 items.
- Outsourcing computation: the minimal refereed mechanism (Q777972) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← 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)
- A compiler for multi-key homomorphic signatures for Turing machines (Q2232614) (← links)
- Verifiable inner product computation on outsourced database for authenticated multi-user data sharing (Q2666869) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles (Q6061369) (← links)
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption (Q6061370) (← links)
- Non-interactive publicly-verifiable delegation of committed programs (Q6067380) (← links)
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme (Q6086333) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- Non-interactive universal arguments (Q6145782) (← links)
- SNARGs for monotone policy batch NP (Q6145787) (← links)
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash (Q6155263) (← links)
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG (Q6157544) (← links)
- Verifiable private information retrieval (Q6169548) (← links)
- Non-interactive zero-knowledge from non-interactive batch arguments (Q6186697) (← links)
- Correlation intractability and SNARGs from sub-exponential DDH (Q6190125) (← links)