Multi-key and multi-input predicate encryption from learning with errors
From MaRDI portal
Publication:6063533
DOI10.1007/978-3-031-30620-4_19zbMath1528.94049MaRDI QIDQ6063533
Daniele Friolo, Giulio Malavolta, Daniele Venturi, Danilo Francati
Publication date: 12 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Related Items (2)
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
- Unnamed Item
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Non-interactive multiparty computation without correlated randomness
- Decentralized multi-client functional encryption for inner product
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Non-trivial witness encryption and null-iO from standard assumptions
- On perfect correctness in (lockable) obfuscation
- Candidate obfuscation via oblivious LWE sampling
- Multi-client functional encryption for separable functions
- 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
- Secure Multiparty Computation with General Interaction Patterns
- Non-Interactive Secure Multiparty Computation
- Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption
- Functional Encryption for Regular Languages
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- Functional Encryption for Inner Product Predicates from Learning with Errors
- Predicate Encryption for Circuits from LWE
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Indistinguishability Obfuscation from Compact Functional Encryption
- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
- Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Indistinguishability Obfuscation from Functional Encryption
- Secure Computation on the Web: Computing without Simultaneous Interaction
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
- Multi-input Functional Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Witness encryption and its applications
- Multi-input Inner-Product Functional Encryption from Pairings
- Two Round Multiparty Computation via Multi-key FHE
- Dual System Encryption via Predicate Encodings
- Match me if you can: matchmaking encryption and its applications
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Match me if you can: matchmaking encryption and its applications
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
- Multi-input quadratic functional encryption: stronger security, broader functionality
- Identity-based matchmaking encryption from standard assumptions
- Multi-input attribute based encryption and predicate encryption
- Identity-based matchmaking encryption without random oracles
This page was built for publication: Multi-key and multi-input predicate encryption from learning with errors