Multi-input functional encryption for unbounded arity functions
From MaRDI portal
Publication:2811124
DOI10.1007/978-3-662-48797-6_2zbMATH Open1337.94019OpenAlexW2294163655MaRDI QIDQ2811124FDOQ2811124
Authors: Saikrishna Badrinarayanan, Divya Gupta, Abhishek Jain, Amit Sahai 
Publication date: 10 June 2016
Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_2
Recommendations
- Multi-input functional encryption with unbounded-message security
- Multi-input functional encryption
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
Cited In (11)
- Multi-input non-interactive functional encryption: constructions and applications
- Upgrading to functional encryption
- FE and iO for Turing machines from minimal assumptions
- Multi-client functional encryption for separable functions
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions
- From cryptomania to obfustopia through secret-key functional encryption
- Multi-input Functional Encryption with Unbounded-Message Security
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Multi-input Inner-Product Functional Encryption from Pairings
- Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
- Tightly secure inner product functional encryption: multi-input and function-hiding constructions
This page was built for publication: Multi-input functional encryption for unbounded arity functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811124)
