Fully secure functional encryption with a large class of relations from the decisional linear assumption
From MaRDI portal
Publication:2010596
DOI10.1007/s00145-018-9305-0zbMath1435.94138OpenAlexW2902097404WikidataQ114692957 ScholiaQ114692957MaRDI QIDQ2010596
Tatsuaki Okamoto, Katsuyuki Takashima
Publication date: 27 November 2019
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-018-9305-0
attribute-based encryptionadaptive securityfunctional encryptiondecisional linear assumptiondual pairing vector spacesinner-product predicate encryption
Related Items (2)
Adaptively secure inner product encryption from LWE ⋮ Tag-based ABE in prime-order groups via pair encoding
Cites Work
- Unnamed Item
- Spatial encryption supporting non-monotone access structure
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
- New proof techniques for DLIN-based adaptively secure attribute-based encryption
- The relation and transformation between hierarchical inner product encryption and spatial encryption
- Functional Encryption for Turing Machines
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Attribute-Based Encryption for Circuits from Multilinear Maps
- Functional Encryption: New Perspectives and Lower Bounds
- On the Achievability of Simulation-Based Security for Functional Encryption
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
- Functional Encryption: Definitions and Challenges
- Unbounded HIBE and Attribute-Based Encryption
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- 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
- Delegating Capabilities in Predicate Encryption Systems
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Practical Identity-Based Encryption Without Random Oracles
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Generalized Identity Based and Broadcast Encryption Schemes
- Homomorphic Encryption and Signatures from Vector Decomposition
- Hierarchical Predicate Encryption for Inner-Products
- Hierarchical ID-Based Cryptography
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Fuzzy Identity-Based Encryption
- Multi-input Functional Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Attribute-based encryption for circuits
- Topics in Cryptology – CT-RSA 2005
- Theory of Cryptography
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
This page was built for publication: Fully secure functional encryption with a large class of relations from the decisional linear assumption