Multi-input quadratic functional encryption: stronger security, broader functionality
From MaRDI portal
Publication:6114258
DOI10.1007/978-3-031-22318-1_25zbMath1519.94026OpenAlexW4312876707MaRDI QIDQ6114258
Shweta Agrawal, Junichi Tomida, Rishab Goyal
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22318-1_25
Related Items (3)
Multi-key and multi-input predicate encryption from learning with errors ⋮ Attribute-based multi-input FE (and more) for attribute-weighted sums ⋮ Constant input attribute based (and predicate) encryption from evasive and tensor LWE
Cites Work
- Impossibility of simulation secure functional encryption even with random oracles
- FE and iO for Turing machines from minimal assumptions
- 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
- Decentralized multi-client functional encryption for inner product
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Efficient functional encryption for inner-product values with full-hiding security
- 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\)
- 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
- Multi-party functional encryption
- Functional Encryption Without Obfuscation
- Function-Hiding Inner Product Encryption
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Functional Encryption: New Perspectives and Lower Bounds
- Simple Functional Encryption Schemes for Inner Products
- Functional Encryption: Definitions and Challenges
- Indistinguishability Obfuscation from Compact Functional Encryption
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Indistinguishability Obfuscation from Functional Encryption
- Function-Private Functional Encryption in the Private-Key Setting
- Fuzzy Identity-Based Encryption
- Multi-input Functional Encryption
- Multi-input Inner-Product Functional Encryption from Pairings
- Unbounded inner product functional encryption from bilinear maps
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Indistinguishability obfuscation from well-founded assumptions
This page was built for publication: Multi-input quadratic functional encryption: stronger security, broader functionality
