Pages that link to "Item:Q3457116"
From MaRDI portal
The following pages link to Indistinguishability Obfuscation from Compact Functional Encryption (Q3457116):
Displaying 50 items.
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- Upgrading to functional encryption (Q1629441) (← links)
- Impossibility of simulation secure functional encryption even with random oracles (Q1629443) (← links)
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound (Q1631324) (← links)
- 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)
- On virtual grey box obfuscation for general circuits (Q1688397) (← links)
- Adaptively simulation-secure attribute-hiding predicate encryption (Q1710619) (← links)
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions (Q1753168) (← links)
- Functional encryption for cubic polynomials and implementation (Q1981766) (← links)
- Simple and efficient FE for quadratic functions (Q2043408) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- Impossibility results for lattice-based functional encryption schemes (Q2055607) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption (Q2057139) (← links)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Multi-input quadratic functional encryption from pairings (Q2139634) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
- Dynamic collusion bounded functional encryption from identity-based encryption (Q2170069) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Functional broadcast encryption with applications to data sharing for cloud storage (Q2224865) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- Multi-party functional encryption (Q2697858) (← links)
- Succinct LWE sampling, random polynomials, and obfuscation (Q2697860) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← 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)
- Functional Encryption Without Obfuscation (Q2799106) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- Obfuscation Combiners (Q2829229) (← links)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
- Multi-input Functional Encryption with Unbounded-Message Security (Q2953788) (← links)
- Verifiable Functional Encryption (Q2953789) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← 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)
