Multi-input functional encryption with unbounded-message security
From MaRDI portal
Recommendations
- Multi-input functional encryption for unbounded arity functions
- Multi-input functional encryption
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Multi-input quadratic functional encryption: stronger security, broader functionality
- Full-hiding (unbounded) multi-input inner product functional encryption from the \(k\)-linear assumption
Cites work
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Functional encryption: definitions and challenges
- Functional signatures and pseudorandom functions
- Fuzzy Identity-Based Encryption
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from compact functional encryption
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Multi-input functional encryption
- Multi-input functional encryption for unbounded arity functions
- Non-interactive secure multiparty computation
- Obfuscation combiners
- Obfuscation of probabilistic circuits and applications
- On extractability obfuscation
- On obfuscating point functions
- On the achievability of simulation-based security for functional encryption
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
- One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
- Public-coin differing-inputs obfuscation and its applications
- Reusable garbled circuits and succinct functional encryption
- Theory of Cryptography
- Theory of cryptography. 12th theory of cryptography conference, TCC 2015, Warsaw, Poland, March 23--25, 2015. Proceedings, Part II
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
Cited in
(15)- Multi-input quadratic functional encryption: stronger security, broader functionality
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Multi-input non-interactive functional encryption: constructions and applications
- Token-based multi-input functional encryption
- Multi-input functional encryption
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Multi-input functional encryption for unbounded arity functions
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- (Multi-input) \textsf{FE} for randomized functionalities, revisited
- Adaptively secure streaming functional encryption
- Dynamic bounded-collusion streaming functional encryption from minimal assumptions
- Schnorr signatures are tightly secure in the ROM under a non-interactive assumption
- Certified everlasting secure collusion-resistant functional encryption, and more
- Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications
- Publicly auditable functional encryption
This page was built for publication: Multi-input functional encryption with unbounded-message security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953788)
