Multi-input attribute based encryption and predicate encryption
From MaRDI portal
Recommendations
- Compact Attribute-Based and Online-Offline Multi-input Inner Product Encryptions from Standard Static Assumptions (Short Paper)
- Attribute-based encryption for circuits from multilinear maps
- Multi-party functional encryption
- Multi-input functional encryption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
Cites work
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Attribute-based encryption for circuits
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Decentralized multi-client functional encryption for inner product
- Decentralizing inner-product functional encryption
- Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Dual System Encryption via Predicate Encodings
- From single-input to multi-client inner-product functional encryption
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully secure functional encryption with general relations from the decisional linear assumption
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Functional encryption for inner product predicates from learning with errors
- Functional encryption for regular languages
- Functional encryption: definitions and challenges
- Fuzzy Identity-Based Encryption
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- scientific article; zbMATH DE number 6020480 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from constant-degree graded encoding schemes
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Multi-client functional encryption for linear functions in the standard model from LWE
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-input functional encryption
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Multi-input inner-product functional encryption from pairings
- Multi-input quadratic functional encryption from pairings
- New proof methods for attribute-based encryption: achieving full security through selective techniques
- Non-trivial witness encryption and null-iO from standard assumptions
- On perfect correctness in (lockable) obfuscation
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Optimal broadcast encryption from LWE and pairings in the standard model
- Optimal broadcast encryption from pairings and LWE
- Predicate encryption for circuits from LWE
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Riding on asymmetry: efficient ABE for branching programs
- Semi-adaptive attribute-based encryption and improved delegation for Boolean formula
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Two round multiparty computation via multi-key FHE
- Unbounded HIBE and Attribute-Based Encryption
Cited in
(20)- Attribute-Based Encryption Resilient to Auxiliary Input
- Compact Attribute-Based and Online-Offline Multi-input Inner Product Encryptions from Standard Static Assumptions (Short Paper)
- Multi-key and multi-input predicate encryption from learning with errors
- Multi-authority ABE for non-monotonic access structures
- Attribute-based multi-input FE (and more) for attribute-weighted sums
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- Updatable policy-compliant signatures
- Certified everlasting secure collusion-resistant functional encryption, and more
- PKE and ABE with collusion-resistant secure key leasing
- Multi-client attribute-based and predicate encryption, revisited
- Multi-client attribute-based unbounded inner product functional encryption, and more
- Dynamic decentralized functional encryption: generic constructions with strong security
- Multi-client attribute-based and predicate encryption from standard assumptions
- Fully adaptive decentralized MA-ABE: simplified, optimized, ASP supported
- Pseudorandom FE, iO and applications
- (Multi-input) \textsf{FE} for randomized functionalities, revisited
- Adaptively secure streaming functional encryption
- Certified everlasting secure collusion-resistant functional encryption, and more
- Lattice-based multi-authority/client attribute-based encryption for circuits
This page was built for publication: Multi-input attribute based encryption and predicate encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155270)
