(Multi-input) \textsf{FE} for randomized functionalities, revisited
From MaRDI portal
Publication:7233197
Cites work
- Ad Hoc Multi-Input Functional Encryption.
- Attribute-based multi-input FE (and more) for attribute-weighted sums
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constant input attribute based (and predicate) encryption from evasive and tensor LWE
- Constrained pseudorandom functions and their applications
- Decentralized multi-client functional encryption for inner product
- Decentralizing inner-product functional encryption
- Dynamic decentralized functional encryption
- From Minicrypt to Obfustopia via private-key functional encryption
- From single-input to multi-client inner-product functional encryption
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
- Function-hiding inner product encryption is practical
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Functional encryption for randomized functionalities
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Functional encryption without obfuscation
- Functional encryption: definitions and challenges
- Functional encryption: deterministic to randomized functions from simple assumptions
- Functional encryption: new perspectives and lower bounds
- Functional signatures and pseudorandom functions
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 176565 (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 LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from well-founded assumptions
- Inner-product functional encryption with fine-grained access control
- Multi-client functional encryption for linear functions in the standard model from LWE
- Multi-client functional encryption with fine-grained access control
- Multi-client inner product encryption: function-hiding instantiations without random oracles
- Multi-client inner-product functional encryption in the random-oracle model
- 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 functional encryption for unbounded arity functions
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Multi-input functional encryption with unbounded-message security
- 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 (for conjunctions) from learning with errors
- Multi-key and multi-input predicate encryption from learning with errors
- Non-trivial witness encryption and null-iO from standard assumptions
- Obfustopia built on secret-key functional encryption
- On extractability obfuscation
- On the achievability of simulation-based security for functional encryption
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
- Optimal security notion for decentralized multi-client functional encryption
- Order-revealing encryption and the hardness of private learning
- Practical order-revealing encryption with limited leakage
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
- Steel: composable hardware-based stateful and randomised functional encryption
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
- Upgrading to functional encryption
- Verifiable decentralized multi-client functional encryption for inner product
- Verifiable functional encryption
This page was built for publication: (Multi-input) \textsf{FE} for randomized functionalities, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233197)
