The following pages link to How to delegate computations (Q5259584):
Displaying 44 items.
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
- Bridging the gap between general probabilistic theories and the device-independent framework for nonlocality and contextuality (Q320197) (← links)
- Quantum cryptography beyond quantum key distribution (Q908054) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Succinct spooky free compilers are not black box sound (Q1701441) (← 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)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
- Secure and efficient outsourcing computation on large-scale linear regressions (Q2663473) (← links)
- Belief-invariant and quantum equilibria in games of incomplete information (Q2664942) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Rational Sumchecks (Q2799100) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Delegating Computation (Q3177732) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- (Q3549691) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- (Q5090398) (← links)
- (Q5121905) (← links)
- (Q5121908) (← 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)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- On black-box knowledge-sound commit-and-prove SNARKs (Q6562559) (← links)
- Locally verifiable distributed SNARGs (Q6581783) (← links)
- On black-box verifiable outsourcing (Q6581787) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- Adaptively sound zero-knowledge SNARKs for UP (Q6660292) (← links)
