Functional Encryption: New Perspectives and Lower Bounds
From MaRDI portal
Publication:2849414
DOI10.1007/978-3-642-40084-1_28zbMath1311.94065OpenAlexW2899558955MaRDI QIDQ2849414
Hoeteck Wee, Sergey Gorbunov, Vinod Vaikuntanathan, Shweta Agrawal
Publication date: 17 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40084-1_28
Related Items (46)
Adaptive Simulation Security for Inner Product Functional Encryption ⋮ A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials ⋮ Impossibility of simulation secure functional encryption even with random oracles ⋮ Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ A New Functional Encryption for Multidimensional Range Query (Short Paper) ⋮ Predicate Encryption for Circuits from LWE ⋮ Indistinguishability Obfuscation from Compact Functional Encryption ⋮ Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ On the power of rewinding simulators in functional encryption ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Simulation-Based Secure Functional Encryption in the Random Oracle Model ⋮ Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption ⋮ Bounded-collusion decentralized ABE with sublinear parameters ⋮ Quantum attribute-based encryption: a comprehensive study ⋮ Verifiable Functional Encryption ⋮ Functional encryption against probabilistic queries: definition, construction and applications ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Multi-input quadratic functional encryption: stronger security, broader functionality ⋮ A survey on functional encryption ⋮ Verifiable functional encryption using Intel SGX ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Efficient Inner Product Encryption with Simulation-Based Security ⋮ Functional encryption for randomized functionalities in the private-key setting from minimal assumptions ⋮ Function-private functional encryption in the private-key setting ⋮ Strongly full-hiding inner product encryption ⋮ Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions ⋮ Private Puncturable PRFs from Standard Lattice Assumptions ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Cryptography with Updates ⋮ Fully secure functional encryption with a large class of relations from the decisional linear assumption ⋮ Functional Encryption for Turing Machines ⋮ Functional Encryption Without Obfuscation ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ Steel: composable hardware-based stateful and randomised functional encryption ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ A new approach to practical function-private inner product encryption ⋮ Functional encryption for attribute-weighted sums from \(k\)-Lin ⋮ Unnamed Item
This page was built for publication: Functional Encryption: New Perspectives and Lower Bounds