Functional Encryption: New Perspectives and Lower Bounds

From MaRDI portal
Revision as of 19:22, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 EncryptionA New Paradigm for Public-Key Functional Encryption for Degree-2 PolynomialsImpossibility of simulation secure functional encryption even with random oraclesFunctional encryption for Turing machines with dynamic bounded collusion from LWEA New Functional Encryption for Multidimensional Range Query (Short Paper)Predicate Encryption for Circuits from LWEIndistinguishability Obfuscation from Compact Functional EncryptionVirtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic AgentsFrom Cryptomania to Obfustopia Through Secret-Key Functional EncryptionCompactness vs Collusion Resistance in Functional EncryptionOn the power of rewinding simulators in functional encryptionFrom cryptomania to obfustopia through secret-key functional encryptionFrom FE combiners to secure MPC and backSimulation-Based Secure Functional Encryption in the Random Oracle ModelAchieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryptionBounded-collusion decentralized ABE with sublinear parametersQuantum attribute-based encryption: a comprehensive studyVerifiable Functional EncryptionFunctional encryption against probabilistic queries: definition, construction and applicationsBounded functional encryption for Turing machines: adaptive security from general assumptionsMulti-input quadratic functional encryption: stronger security, broader functionalityA survey on functional encryptionVerifiable functional encryption using Intel SGXAdaptively simulation-secure attribute-hiding predicate encryptionPractical fully secure unrestricted inner product functional encryption modulo \(p\)Collusion Resistant Traitor Tracing from Learning with ErrorsEfficient Inner Product Encryption with Simulation-Based SecurityFunctional encryption for randomized functionalities in the private-key setting from minimal assumptionsFunction-private functional encryption in the private-key settingStrongly full-hiding inner product encryptionMulti-input functional encryption in the private-key setting: stronger security from weaker assumptionsPrivate Puncturable PRFs from Standard Lattice AssumptionsConstraint-Hiding Constrained PRFs for NC $$^1$$ from LWEMulti-input Inner-Product Functional Encryption from PairingsFunctional Encryption: Deterministic to Randomized Functions from Simple AssumptionsCryptography with UpdatesFully secure functional encryption with a large class of relations from the decisional linear assumptionFunctional Encryption for Turing MachinesFunctional Encryption Without ObfuscationCandidate Indistinguishability Obfuscation and Functional Encryption for All CircuitsNew lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertextsSteel: composable hardware-based stateful and randomised functional encryptionFully Secure Functional Encryption for Inner Products, from Standard AssumptionsA new approach to practical function-private inner product encryptionFunctional encryption for attribute-weighted sums from \(k\)-LinUnnamed Item






This page was built for publication: Functional Encryption: New Perspectives and Lower Bounds