Impossibility results for lattice-based functional encryption schemes
type: Item
instance of: scholarly article
title: Impossibility results for lattice-based functional encryption schemes
zbMATH Open document ID: 1479.94261
DOI: 10.1007/978-3-030-45721-1_7
author: Akın Ünal
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436918
zbMATH Keywords: functional encryption
zbMATH Keywords: function-hiding
zbMATH Keywords: impossibility
zbMATH Keywords: LWE
zbMATH Keywords: lattice-based encryption scheme
zbMATH Keywords: online/offline
MaRDI profile type: Publication
full work available at URL: 978-3-030-45721-1 7
OpenAlex ID: W3013056757
cites work: Decentralizing inner-product functional encryption
cites work: Simple Functional Encryption Schemes for Inner Products
cites work: Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Ad Hoc Multi-Input Functional Encryption.
cites work: Functional Encryption for Inner Product Predicates from Learning with Errors
cites work: Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
cites work: Functional encryption for bounded collusions, revisited
cites work: Indistinguishability Obfuscation from Compact Functional Encryption
cites work: Optimal bounded-collusion secure functional encryption
cites work: Practical functional encryption for quadratic functions with applications to predicate encryption
cites work: Function-Hiding Inner Product Encryption
cites work: Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
cites work: Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Decentralized multi-client functional encryption for inner product
cites work: Functional Encryption for Inner Product with Full Function Privacy
cites work: Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
cites work: Attribute-based encryption for circuits
cites work: On perfect correctness in (lockable) obfuscation
cites work: Q4320535
cites work: Online/Offline Attribute-Based Encryption
cites work: How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
cites work: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
cites work: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
cites work: On lattices, learning with errors, random linear codes, and cryptography
Recommended article: Efficient lattice-based inner-product functional encryption
Recommended article: Attribute-Based Functional Encryption on Lattices
Recommended article: Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices
Recommended article: Functional Encryption: New Perspectives and Lower Bounds
Recommended article: Impossibility of simulation secure functional encryption even with random oracles
Recommended article: Identity-based functional encryption for quadratic functions from lattices
Recommended article: Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
Recommended article: Q2993216
Recommended article: Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
description: scientific article; zbMATH DE number 7436918