Pages that link to "Item:Q3181020"
From MaRDI portal
The following pages link to Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020):
Displayed 15 items.
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation (Q5738765) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption (Q6063529) (← links)
- Laconic function evaluation for Turing machines (Q6067382) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)