Pages that link to "Item:Q2796122"
From MaRDI portal
The following pages link to Functional Encryption for Turing Machines (Q2796122):
Displaying 36 items.
- Strongly full-hiding inner product encryption (Q511916) (← 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)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- Fully secure functional encryption with a large class of relations from the decisional linear assumption (Q2010596) (← links)
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \) (Q2055654) (← links)
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption (Q2057139) (← links)
- Limits on the adaptive security of Yao's garbling (Q2128573) (← links)
- Functional encryption for Turing machines with dynamic bounded collusion from LWE (Q2139636) (← links)
- Attribute-based access control for inner product functional encryption from LWE (Q2146083) (← links)
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience (Q2152060) (← links)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- Attribute based encryption for deterministic finite automata from DLIN (Q2175933) (← links)
- Homomorphic encryption for finite automata (Q2176661) (← 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)
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security (Q2829953) (← links)
- How to Run Turing Machines on Encrypted Data (Q2849418) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Semi-adaptive Security and Bundling Functionalities Made Generic and Easy (Q3181033) (← links)
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss (Q3181035) (← links)
- CRYPTAUTOMATA WITH FUNCTIONAL KEYS (Q5151058) (← links)
- Towards Symmetric Functional Encryption for Regular Languages with Predicate Privacy (Q5253646) (← links)
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software (Q5270360) (← links)
- Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
- Reusable garbled circuits and succinct functional encryption (Q5495826) (← links)
- Selected Areas in Cryptography (Q5713961) (← links)
- Bounded Collusion ABE for TMs from IBE (Q6041291) (← links)
- Bounded functional encryption for Turing machines: adaptive security from general assumptions (Q6114255) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH} (Q6618631) (← links)
- Certified everlasting secure collusion-resistant functional encryption, and more (Q6637338) (← links)
