Fully secure functional encryption with a large class of relations from the decisional linear assumption
DOI10.1007/S00145-018-9305-0zbMATH Open1435.94138OpenAlexW2902097404WikidataQ114692957 ScholiaQ114692957MaRDI QIDQ2010596FDOQ2010596
Authors: 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
Recommendations
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Functional encryption for inner product with full function privacy
- Fully secure functional encryption for inner products, from standard assumptions
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
adaptive securityattribute-based encryptionfunctional encryptiondecisional linear assumptiondual pairing vector spacesinner-product predicate encryption
Cites Work
- Theory of Cryptography
- Functional encryption: definitions and challenges
- 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
- Practical Identity-Based Encryption Without Random Oracles
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Hierarchical ID-Based Cryptography
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Fuzzy Identity-Based Encryption
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Advances in Cryptology – CRYPTO 2004
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Attribute-based encryption for circuits from multilinear maps
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully secure functional encryption with general relations from the decisional linear assumption
- Hierarchical Predicate Encryption for Inner-Products
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Attribute-based encryption for circuits
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Advances in Cryptology - EUROCRYPT 2004
- The relation and transformation between hierarchical inner product encryption and spatial encryption
- Generalized Identity Based and Broadcast Encryption Schemes
- Homomorphic Encryption and Signatures from Vector Decomposition
- Spatial encryption supporting non-monotone access structure
- Advances in Cryptology – CRYPTO 2004
- Topics in Cryptology – CT-RSA 2005
- Functional Encryption for Turing Machines
- Functional encryption: new perspectives and lower bounds
- On the achievability of simulation-based security for functional encryption
- Unbounded HIBE and Attribute-Based Encryption
- Delegating Capabilities in Predicate Encryption Systems
- Fully secure unbounded inner-product and attribute-based encryption
- Multi-input functional encryption
- Expressive attribute-based encryption with constant-size ciphertexts from the decisional linear assumption
- 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
Cited In (7)
- Doubly spatial encryption from DBDH
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Adaptively secure inner product encryption from LWE
- Hierarchical functional encryption for linear transformations
- Tag-based ABE in prime-order groups via pair encoding
This page was built for publication: Fully secure functional encryption with a large class of relations from the decisional linear assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010596)