Lower bounds for lattice-based compact functional encryption
From MaRDI portal
Publication:6636507
DOI10.1007/978-3-031-58723-8_9MaRDI QIDQ6636507
Publication date: 12 November 2024
Cites Work
- Traitor-tracing from LWE made simple and attribute-based
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Functional encryption for bounded collusions, revisited
- Decentralized multi-client functional encryption for inner product
- The algebraic group model and its applications
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Impossibility results for lattice-based functional encryption schemes
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Multi-input quadratic functional encryption from pairings
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Optimal bounded-collusion secure functional encryption
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Multi-client functional encryption for linear functions in the standard model from LWE
- From single-input to multi-client inner-product functional encryption
- Decentralizing inner-product functional encryption
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Worst-case to average-case reductions for module lattices
- Inner-product functional encryption with fine-grained access control
- Multi-party functional encryption
- Function-Hiding Inner Product Encryption
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Functional Encryption: New Perspectives and Lower Bounds
- On the Achievability of Simulation-Based Security for Functional Encryption
- Simple Functional Encryption Schemes for Inner Products
- Arithmetic Cryptography
- Functional Encryption: Definitions and Challenges
- Predicate Encryption for Circuits from LWE
- Indistinguishability Obfuscation from Compact Functional Encryption
- On Ideal Lattices and Learning with Errors over Rings
- Efficient Lattice (H)IBE in the Standard Model
- Adaptive Simulation Security for Inner Product Functional Encryption
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Attribute-based encryption for circuits
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Multi-input Inner-Product Functional Encryption from Pairings
- Cryptography and Coding
- On lattices, learning with errors, random linear codes, and cryptography
- Obfustopia built on secret-key functional encryption
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Unbounded quadratic functional encryption and more from pairings
- Indistinguishability obfuscation from well-founded assumptions
- Multi-input quadratic functional encryption: stronger security, broader functionality
- Worst-case subexponential attacks on PRGs of constant degree or constant locality
- (Inner-product) functional encryption with updatable ciphertexts
This page was built for publication: Lower bounds for lattice-based compact functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636507)
