A survey on functional encryption

DOI10.3934/AMC.2021049zbMATH Open1517.94131arXiv2106.06306OpenAlexW3208862805MaRDI QIDQ6163797FDOQ6163797

Authors: Carla Mascia, Massimiliano Sala, Irene Villa 

Publication date: 30 June 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2106.06306

Recommendations

• Foundations of functional encryption
• Functional encryption: definitions and challenges
• Functional encryption for inner product with full function privacy
• On the semantic security of functional encryption schemes
• Function-private functional encryption in the private-key setting

zbMATH Keywords

identity-based encryptionattribute-based encryptionfunctional encryptioninner product encryptionpredicate encryptioncloud encryption

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
• From selective to adaptive security in functional encryption
• Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
• Identity-Based Traitor Tracing
• Unbounded ABE via bilinear entropy expansion, revisited
• Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
• Predicate encryption for circuits from LWE
• Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
• Attribute-hiding predicate encryption in bilinear groups, revisited
• Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
• Decentralized multi-client functional encryption for inner product
• Practical fully secure unrestricted inner product functional encryption modulo \(p\)
• Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
• Multi-client inner-product functional encryption in the random-oracle model
• Decentralizing inner-product functional encryption
• Attribute-based encryption for circuits
• Function-private functional encryption in the private-key setting
• On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
• Public-key function-private hidden vector encryption (and more)
• Efficiently Computable Distortion Maps for Supersingular Curves
• Anonymous identity-based encryption with identity recovery
• Multi-client functional encryption for linear functions in the standard model from LWE
• Adaptive simulation security for inner product functional encryption
• Ad Hoc Multi-Input Functional Encryption.
• Dynamic decentralized functional encryption
• Anonymous multi-receiver identity-based authenticated encryption with CCA security
• Unbounded inner-product functional encryption with succinct keys
• Large universe ciphertext-policy attribute-based encryption with white-box traceability
• Searching keywords with wildcards on encrypted data
• Hidden-Vector Encryption with Groups of Prime Order
• Fully Secure Hidden Vector Encryption
• Title not available (Why is that?)
• Efficient function-hiding functional encryption: from inner-products to orthogonality
• A multi-authority approach to various predicate encryption types
• Unbounded inner product functional encryption from bilinear maps
• Identity-based trace and revoke schemes
• Verifiable Inner Product Encryption Scheme
• Key-policy multi-authority attribute-based encryption
• User Collusion Avoidance Scheme for Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption
• A proof of security for a key-policy RS-ABE scheme
• Fully homomorphic encryption using ideal lattices
• Title not available (Why is that?)
• A tapestry of identity-based encryption: practical frameworks compared
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Self-Updatable Encryption: Time Constrained Access Control with Hidden Attributes and Better Efficiency
• Identity-based cryptosystems and signature schemes
• Functional encryption: definitions and challenges
• How to share a secret
• Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization
• Functional encryption for inner product predicates from learning with errors
• 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
• Bonsai trees, or how to delegate a lattice basis
• Efficient lattice (H)IBE in the standard model
• Practical Identity-Based Encryption Without Random Oracles
• Conjunctive, Subset, and Range Queries on Encrypted Data
• The Arithmetic of Elliptic Curves
• Hierarchical ID-Based Cryptography
• Title not available (Why is that?)
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Fuzzy Identity-Based Encryption
• Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
• Attribute-based encryption schemes with constant-size ciphertexts
• The Weil pairing, and its efficient calculation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On lattices, learning with errors, random linear codes, and cryptography
• Advances in Cryptology – CRYPTO 2004
• 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
• Multi-authority Attribute Based Encryption
• Hierarchical Predicate Encryption for Inner-Products
• Reducing elliptic curve logarithms to logarithms in a finite field
• Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
• Practical multilinear maps over the integers
• Refinements of Miller's algorithm for computing the Weil/Tate pairing
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Advances in Cryptology - CRYPTO 2003
• Homomorphic Encryption and Signatures from Vector Decomposition
• Title not available (Why is that?)
• Advances in Cryptology – CRYPTO 2004
• Traceable and Retrievable Identity-Based Encryption
• Reducing Trust in the PKG in Identity Based Cryptosystems
• Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
• Title not available (Why is that?)
• Decentralizing attribute-based encryption
• Random oracles with(out) programmability
• Candidate Multilinear Maps from Ideal Lattices
• Inner-product encryption under standard assumptions
• Fully secure hidden vector encryption under standard assumptions
• Function-hiding inner product encryption
• Function-private identity-based encryption: hiding the function in functional encryption
• Functional encryption: new perspectives and lower bounds
• Function-private subspace-membership encryption and its applications
• Functional encryption with bounded collusions via multi-party computation
• Simple functional encryption schemes for inner products
• Unbounded HIBE and Attribute-Based Encryption
• Delegating Capabilities in Predicate Encryption Systems
• Predicate Privacy in Encryption Systems
• Fully secure unbounded inner-product and attribute-based encryption
• Strongly full-hiding inner product encryption
• Multi-input functional encryption
• Reusable garbled circuits and succinct functional encryption
• Cryptanalysis of the multilinear map over the integers
• An algebraic framework for Diffie-Hellman assumptions
• Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts
• Secure threshold multi authority attribute based encryption without a central authority
• Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
• Hierarchical attribute based encryption with continuous leakage-resilience
• A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation
• Traceable inner product functional encryption
• Function-hiding inner product encryption is practical
• Efficient functional encryption for inner-product values with full-hiding security
• A new approach to practical function-private inner product encryption
• Functional encryption for inner product with full function privacy
• Fully secure functional encryption for inner products, from standard assumptions
• On the practical security of inner product functional encryption
• CCA-secure inner-product functional encryption from projective hash functions
• Multi-input inner-product functional encryption from pairings
• Post-quantum secure inner product functional encryption using multivariate public key cryptography
• Practical functional encryption for quadratic functions with applications to predicate encryption
• Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
• Functional encryption for quadratic functions from \(k\)-lin, revisited
• Functional encryption without obfuscation
• A new paradigm for public-key functional encryption for degree-2 polynomials
• Graph-induced multilinear maps from lattices
• A comparison of MNT curves and supersingular curves
• Information Security and Cryptology - ICISC 2005
• Multi-client functional encryption for separable functions
• Verifiable functional encryption
• The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
• Stronger security for reusable garbled circuits, general definitions and attacks
• Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
• Practical ciphertext-policy attribute-based encryption: traitor tracing, revocation, and large universe

Cited In (5)

• Multi-input non-interactive functional encryption: constructions and applications
• Quantum attribute-based encryption: a comprehensive study
• Functional encryption
• \(\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)