Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
From MaRDI portal
Recommendations
- Multi-key and multi-input predicate encryption from learning with errors
- Multi-input attribute based encryption and predicate encryption
- Predicate encryption for circuits from LWE
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Predicate encryption for multi-dimensional range queries from lattices
Cites work
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Candidate obfuscation via oblivious LWE sampling
- 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
- Factoring and pairings are not necessary for iO: circular-secure LWE suffices
- 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 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
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Identity-based matchmaking encryption without random oracles
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Match me if you can: matchmaking encryption and its applications
- Match me if you can: matchmaking encryption and its applications
- Multi-client functional encryption for linear functions in the standard model from LWE
- Multi-client functional encryption for separable functions
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-input attribute based encryption and predicate encryption
- 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
- Multi-input quadratic functional encryption: stronger security, broader functionality
- Multi-key and multi-input predicate encryption from learning with errors
- Non-interactive multiparty computation without correlated randomness
- Non-interactive secure multiparty computation
- Non-trivial witness encryption and null-iO from standard assumptions
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Predicate encryption for circuits from LWE
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Secure computation on the web: computing without simultaneous interaction
- Secure multiparty computation with general interaction patterns
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Two round multiparty computation via multi-key FHE
- Witness encryption and its applications
Cited in
(5)
This page was built for publication: Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570526)
