Unbounded predicate inner product functional encryption from pairings
From MaRDI portal
Publication:6109084
DOI10.1007/s00145-023-09458-2zbMath1518.94056OpenAlexW4380445903MaRDI QIDQ6109084
Aikaterini Mitrokotsa, Subhranil Dutta, Tapas Pal, Sayantan Mukherjee, Uddipana Dowerah
Publication date: 26 July 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09458-2
unboundedinner product functional encryptionfully attribute-hidinginner product predicatesemi-adaptive securityweak attribute-hiding
Cites Work
- An algebraic framework for Diffie-Hellman assumptions
- Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption
- 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
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Functional encryption for quadratic functions from \(k\)-lin, revisited
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Multi-input quadratic functional encryption from pairings
- Multi-client functional encryption for linear functions in the standard model from LWE
- A taxonomy of pairing-friendly elliptic curves
- Decentralizing inner-product functional encryption
- Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR
- Unbounded inner-product functional encryption with succinct keys
- Unbounded dynamic predicate compositions in attribute-based encryption
- Attribute-based encryption (and more) for nondeterministic finite automata from LWE
- Elliptic curves suitable for pairing based cryptography
- Inner-product functional encryption with fine-grained access control
- Multi-party functional encryption
- Fully secure unbounded zero inner product encryption with short ciphertexts and keys
- Functional Encryption for Inner Product with Full Function Privacy
- Function-Hiding Inner Product Encryption
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Simple Functional Encryption Schemes for Inner Products
- Functional Encryption: Definitions and Challenges
- Unbounded HIBE and Attribute-Based Encryption
- Attribute-Based Encryption for Circuits
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Indistinguishability Obfuscation from Functional Encryption
- Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
- Pairing-Friendly Elliptic Curves of Prime Order
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Reusable garbled circuits and succinct functional encryption
- CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions
- Multi-input Inner-Product Functional Encryption from Pairings
- Unbounded inner product functional encryption from bilinear maps
- (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
- Indistinguishability obfuscation from well-founded assumptions
This page was built for publication: Unbounded predicate inner product functional encryption from pairings
