A survey on functional encryption
From MaRDI portal
Publication:6163797
Abstract: Functional Encryption (FE) expands traditional public-key encryption in two different ways: it supports fine-grained access control and allows learning a function of the encrypted data. In this paper, we review all FE classes, describing their functionalities and main characteristics. In particular, we mention several schemes for each class, providing their security assumptions and comparing their properties. To our knowledge, this is the first survey that encompasses the entire FE family.
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1107703 (Why is no real title available?)
- scientific article; zbMATH DE number 1996402 (Why is no real title available?)
- scientific article; zbMATH DE number 2009960 (Why is no real title available?)
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- scientific article; zbMATH DE number 2086725 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- A comparison of MNT curves and supersingular curves
- A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation
- A multi-authority approach to various predicate encryption types
- A new approach to practical function-private inner product encryption
- A new paradigm for public-key functional encryption for degree-2 polynomials
- A proof of security for a key-policy RS-ABE scheme
- A tapestry of identity-based encryption: practical frameworks compared
- Ad Hoc Multi-Input Functional Encryption.
- Adaptive simulation security for inner product functional encryption
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- An Identity Based Encryption Scheme Based on Quadratic Residues
- An algebraic framework for Diffie-Hellman assumptions
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Anonymous identity-based encryption with identity recovery
- Anonymous multi-receiver identity-based authenticated encryption with CCA security
- Attribute-based encryption for circuits
- Attribute-based encryption schemes with constant-size ciphertexts
- Attribute-hiding predicate encryption in bilinear groups, revisited
- Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
- Bonsai trees, or how to delegate a lattice basis
- CCA-secure inner-product functional encryption from projective hash functions
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
- Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Cryptanalysis of the multilinear map over the integers
- Decentralized multi-client functional encryption for inner product
- Decentralizing attribute-based encryption
- Decentralizing inner-product functional encryption
- Delegating Capabilities in Predicate Encryption Systems
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Dynamic decentralized functional encryption
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient function-hiding functional encryption: from inner-products to orthogonality
- Efficient functional encryption for inner-product values with full-hiding security
- Efficient lattice (H)IBE in the standard model
- Efficiently Computable Distortion Maps for Supersingular Curves
- From selective to adaptive security in functional encryption
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
- Fully Secure Hidden Vector Encryption
- Fully homomorphic encryption using ideal lattices
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure functional encryption for inner products, from standard assumptions
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully secure hidden vector encryption under standard assumptions
- Fully secure unbounded inner-product and attribute-based encryption
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Function-hiding inner product encryption
- Function-hiding inner product encryption is practical
- Function-private functional encryption in the private-key setting
- Function-private identity-based encryption: hiding the function in functional encryption
- Function-private subspace-membership encryption and its applications
- Functional encryption for inner product predicates from learning with errors
- Functional encryption for inner product with full function privacy
- Functional encryption for quadratic functions from k-lin, revisited
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption without obfuscation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Fuzzy Identity-Based Encryption
- Graph-induced multilinear maps from lattices
- Hidden-Vector Encryption with Groups of Prime Order
- Hierarchical ID-Based Cryptography
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Hierarchical Predicate Encryption for Inner-Products
- Hierarchical attribute based encryption with continuous leakage-resilience
- Homomorphic Encryption and Signatures from Vector Decomposition
- How to share a secret
- Identity-Based Traitor Tracing
- Identity-based cryptosystems and signature schemes
- Identity-based trace and revoke schemes
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Information Security and Cryptology - ICISC 2005
- Inner-product encryption under standard assumptions
- Key-policy multi-authority attribute-based encryption
- Large universe ciphertext-policy attribute-based encryption with white-box traceability
- Multi-authority Attribute Based Encryption
- Multi-client functional encryption for linear functions in the standard model from LWE
- Multi-client functional encryption for separable functions
- Multi-client inner-product functional encryption in the random-oracle model
- Multi-input functional encryption
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Multi-input inner-product functional encryption from pairings
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- On lattices, learning with errors, random linear codes, and cryptography
- On the practical security of inner product functional encryption
- On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Post-quantum secure inner product functional encryption using multivariate public key cryptography
- Practical Identity-Based Encryption Without Random Oracles
- Practical ciphertext-policy attribute-based encryption: traitor tracing, revocation, and large universe
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Practical multilinear maps over the integers
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Predicate Privacy in Encryption Systems
- Predicate encryption for circuits from LWE
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Public-key function-private hidden vector encryption (and more)
- Random oracles with(out) programmability
- Reducing Trust in the PKG in Identity Based Cryptosystems
- Reducing elliptic curve logarithms to logarithms in a finite field
- Refinements of Miller's algorithm for computing the Weil/Tate pairing
- Reusable garbled circuits and succinct functional encryption
- Searching keywords with wildcards on encrypted data
- Secure threshold multi authority attribute based encryption without a central authority
- Self-Updatable Encryption: Time Constrained Access Control with Hidden Attributes and Better Efficiency
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
- Simple functional encryption schemes for inner products
- Stronger security for reusable garbled circuits, general definitions and attacks
- Strongly full-hiding inner product encryption
- The Arithmetic of Elliptic Curves
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- The Weil pairing, and its efficient calculation
- Traceable and Retrievable Identity-Based Encryption
- Traceable inner product functional encryption
- Unbounded ABE via bilinear entropy expansion, revisited
- Unbounded HIBE and Attribute-Based Encryption
- Unbounded inner product functional encryption from bilinear maps
- Unbounded inner-product functional encryption with succinct keys
- User Collusion Avoidance Scheme for Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption
- Verifiable Inner Product Encryption Scheme
- Verifiable functional encryption
Cited in
(5)- Multi-input non-interactive functional encryption: constructions and applications
- Functional encryption
- Quantum attribute-based encryption: a comprehensive study
- \(\mathrm{mR}_{\mathrm{LWE}}\)-CP-ABE: a revocable CP-ABE for post-quantum cryptography
- Searchable encryption with randomized ciphertext and randomized keyword search
This page was built for publication: A survey on functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163797)
