Pages that link to "Item:Q5738874"

The following pages link to Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874):

Displayed 30 items.

• FE and iO for Turing machines from minimal assumptions (Q1631345) ‎ (← links)
• Simple and efficient FE for quadratic functions (Q2043408) ‎ (← links)
• Candidate iO from homomorphic encryption schemes (Q2055602) ‎ (← links)
• Combiners for functional encryption, unconditionally (Q2055605) ‎ (← 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)
• Amplifying the security of functional encryption, unconditionally (Q2096505) ‎ (← links)
• Simpler constructions of asymmetric primitives from obfuscation (Q2152062) ‎ (← links)
• Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) ‎ (← links)
• From cryptomania to obfustopia through secret-key functional encryption (Q2175212) ‎ (← links)
• From FE combiners to secure MPC and back (Q2175912) ‎ (← links)
• Attribute based encryption for deterministic finite automata from DLIN (Q2175933) ‎ (← links)
• Multilinear maps from obfuscation (Q2188963) ‎ (← 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)
• Inner-product functional encryption with fine-grained access control (Q2691594) ‎ (← links)
• A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials (Q5041154) ‎ (← links)
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) ‎ (← links)
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) ‎ (← links)
• Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874) ‎ (← links)
• On Removing Graded Encodings from Functional Encryption (Q5738968) ‎ (← links)
• One-Way Functions and (Im)perfect Obfuscation (Q5885583) ‎ (← links)
• On the complexity of compressing obfuscation (Q5918748) ‎ (← links)
• Obfustopia built on secret-key functional encryption (Q5925547) ‎ (← links)
• (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) ‎ (← links)
• On the security of functional encryption in the generic group model (Q6095189) ‎ (← links)
• Candidate iO from homomorphic encryption schemes (Q6109075) ‎ (← links)
• Multi-client functional encryption with fine-grained access control (Q6135394) ‎ (← links)
• A survey on functional encryption (Q6163797) ‎ (← links)
• Generic construction of trace-and-revoke inner product functional encryption (Q6173290) ‎ (← links)