Pages that link to "Item:Q2941534"
From MaRDI portal
The following pages link to Indistinguishability Obfuscation for Turing Machines with Unbounded Memory (Q2941534):
Displayed 40 items.
- A simple construction of iO for Turing machines (Q1631340) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Fully deniable interactive encryption (Q2096511) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- Collusion resistant trace-and-revoke for arbitrary identities from standard assumptions (Q2692377) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions (Q2701493) (← links)
- Output-Compressing Randomized Encodings and Applications (Q2796121) (← links)
- Functional Encryption for Turing Machines (Q2796122) (← links)
- Perfect Structure on the Edge of Chaos (Q2796138) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- Obfuscation Combiners (Q2829229) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Adaptive Succinct Garbled RAM or: How to Delegate Your Database (Q3181022) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Structure Versus Hardness Through the Obfuscation Lens (Q5149758) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation (Q5738765) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← 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)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)