From Selective to Adaptive Security in Functional Encryption
From MaRDI portal
Publication:3457089
DOI10.1007/978-3-662-48000-7_32zbMath1351.94021OpenAlexW2293331969MaRDI QIDQ3457089
Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan, Prabhanjan V. Ananth
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1721.1/137827
Related Items (60)
Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ FE and iO for Turing machines from minimal assumptions ⋮ White box traitor tracing ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Deniable Attribute Based Encryption for Branching Programs from LWE ⋮ Semi-adaptive Security and Bundling Functionalities Made Generic and Easy ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ From FE combiners to secure MPC and back ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ Fully adaptive decentralized multi-authority \textsf{ABE} ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Functional encryption against probabilistic queries: definition, construction and applications ⋮ On the security of functional encryption in the generic group model ⋮ Functional encryption with secure key leasing ⋮ Collusion-resistant functional encryption for RAMs ⋮ Concurrently composable non-interactive secure computation ⋮ Public key encryption with secure key leasing ⋮ (Inner-product) functional encryption with updatable ciphertexts ⋮ The pseudorandom oracle model and ideal obfuscation ⋮ Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits ⋮ A survey on functional encryption ⋮ Streaming functional encryption ⋮ Unclonable encryption, revisited ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Decentralized multi-client functional encryption for inner product ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Functional broadcast encryption with applications to data sharing for cloud storage ⋮ Functional encryption for randomized functionalities in the private-key setting from minimal assumptions ⋮ Function-private functional encryption in the private-key setting ⋮ Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Simple and generic constructions of succinct functional encryption ⋮ Output-Compressing Randomized Encodings and Applications ⋮ Functional Encryption for Turing Machines ⋮ Obfustopia built on secret-key functional encryption ⋮ Functional Encryption Without Obfuscation ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Combiners for functional encryption, unconditionally ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification ⋮ Multi-client functional encryption for separable functions ⋮ Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions ⋮ Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Unnamed Item ⋮ Pseudorandom Functions: Three Decades Later ⋮ Breaking the Sub-Exponential Barrier in Obfustopia
Cites Work
- On the Achievability of Simulation-Based Security for Functional Encryption
- Pseudorandom Functions and Lattices
- Functional Encryption with Bounded Collusions via Multi-party Computation
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Functional Encryption: Definitions and Challenges
- Number-theoretic constructions of efficient pseudo-random functions
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Identity-Based Encryption from the Weil Pairing
- Fuzzy Identity-Based Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- On Extractability Obfuscation
This page was built for publication: From Selective to Adaptive Security in Functional Encryption
