Fully secure functional encryption with a large class of relations from the decisional linear assumption
type: Item
instance of: scholarly article
title: Fully secure functional encryption with a large class of relations from the decisional linear assumption
zbMATH Open document ID: 1435.94138
author: Tatsuaki Okamoto
author: Katsuyuki Takashima
published in: Journal of Cryptology
publication date: 2019-11-27T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7137729
zbMATH Keywords: functional encryption
zbMATH Keywords: attribute-based encryption
zbMATH Keywords: inner-product predicate encryption
zbMATH Keywords: adaptive security
zbMATH Keywords: decisional linear assumption
zbMATH Keywords: dual pairing vector spaces
MaRDI profile type: Publication
full work available at URL: s00145-018-9305-0
OpenAlex ID: W2902097404
Wikidata QID: Q114692957
cites work: Functional Encryption: New Perspectives and Lower Bounds
cites work: Functional Encryption for Turing Machines
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Hierarchical Identity Based Encryption with Constant Size Ciphertext
cites work: Q4783728
cites work: Theory of Cryptography
cites work: Generalized Identity Based and Broadcast Encryption Schemes
cites work: Topics in Cryptology – CT-RSA 2005
cites work: Functional Encryption: Definitions and Challenges
cites work: Conjunctive, Subset, and Range Queries on Encrypted Data
cites work: Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
cites work: On the Achievability of Simulation-Based Security for Functional Encryption
cites work: The relation and transformation between hierarchical inner product encryption and spatial encryption
cites work: Spatial encryption supporting non-monotone access structure
cites work: An Identity Based Encryption Scheme Based on Quadratic Residues
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Attribute-Based Encryption for Circuits from Multilinear Maps
cites work: Practical Identity-Based Encryption Without Random Oracles
cites work: Hierarchical ID-Based Cryptography
cites work: Multi-input Functional Encryption
cites work: Attribute-based encryption for circuits
cites work: Efficient Non-interactive Proof Systems for Bilinear Groups
cites work: Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
cites work: Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
cites work: Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
cites work: New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
cites work: Unbounded HIBE and Attribute-Based Encryption
cites work: Homomorphic Encryption and Signatures from Vector Decomposition
cites work: Hierarchical Predicate Encryption for Inner-Products
cites work: Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
cites work: Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
cites work: Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
cites work: Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
cites work: Fuzzy Identity-Based Encryption
cites work: Delegating Capabilities in Predicate Encryption Systems
cites work: Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
cites work: New proof techniques for DLIN-based adaptively secure attribute-based encryption
cites work: Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
cites work: Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
DOI: 10.1007/S00145-018-9305-0
description: scientific article; zbMATH DE number 7137729