Pages that link to "Item:Q2799106"

The following pages link to Functional Encryption Without Obfuscation (Q2799106):

Displaying 50 items.

• (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
• The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
• Practical fully secure unrestricted inner product functional encryption modulo \(p\) (Q1710625) (← links)
• Function-private functional encryption in the private-key setting (Q1747663) (← links)
• Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions (Q1753168) (← links)
• Simple and efficient FE for quadratic functions (Q2043408) (← links)
• Tightly CCA-secure inner product functional encryption scheme (Q2055966) (← links)
• Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption (Q2057139) (← links)
• Multi-client functional encryption for separable functions (Q2061944) (← links)
• Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
• Multi-input quadratic functional encryption from pairings (Q2139634) (← links)
• From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
• From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
• From FE combiners to secure MPC and back (Q2175912) (← links)
• Public key encryption with equality test from generic assumptions in the random oracle model (Q2215090) (← links)
• Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
• A new approach to practical function-private inner product encryption (Q2317860) (← links)
• Cryptanalysis of multilinear maps from ideal lattices: revisited (Q2407051) (← links)
• Cryptanalysis of the CLT13 multilinear map (Q2423847) (← links)
• Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
• Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
• Multi-input Functional Encryption and Its Application in Outsourcing Computation (Q2801771) (← links)
• Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
• Universally Composable Cryptographic Role-Based Access Control (Q2953848) (← links)
• From Cryptomania to Obfustopia Through Secret-Key Functional Encryption (Q3181034) (← links)
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
• Arrangements of Pseudocircles: Triangles and Drawings (Q4625106) (← links)
• (Q4638057) (← links)
• Practical Order-Revealing Encryption with Limited Leakage (Q4639494) (← links)
• Adaptive Simulation Security for Inner Product Functional Encryption (Q5041151) (← links)
• A New Functional Encryption for Multidimensional Range Query (Short Paper) (Q5056029) (← links)
• Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security (Q5095928) (← links)
• Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
• Cryptanalyses of Candidate Branching Program Obfuscators (Q5270365) (← links)
• Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits (Q5738750) (← links)
• CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions (Q5738751) (← links)
• From Minicrypt to Obfustopia via Private-Key Functional Encryption (Q5738873) (← links)
• Multi-input Inner-Product Functional Encryption from Pairings (Q5738891) (← links)
• Simplifying Design and Analysis of Complex Predicate Encryption Schemes (Q5738892) (← links)
• On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
• Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
• Cryptography with Updates (Q5738983) (← links)
• Tightly secure inner product functional encryption: multi-input and function-hiding constructions (Q5896157) (← links)
• Unbounded inner product functional encryption from bilinear maps (Q5915907) (← links)
• Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
• Unbounded inner product functional encryption from bilinear maps (Q5919081) (← links)
• Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities (Q6122595) (← links)
• A survey on functional encryption (Q6163797) (← links)
• Fine-grained polynomial functional encryption (Q6593672) (← links)
• Registered (inner-product) functional encryption (Q6604926) (← links)