Simulation-based secure functional encryption in the random oracle model
From MaRDI portal
Recommendations
- Impossibility of simulation secure functional encryption even with random oracles
- On the achievability of simulation-based security for functional encryption
- On the power of rewinding simulators in functional encryption
- Functional encryption: new perspectives and lower bounds
- Functional encryption: definitions and challenges
Cites work
- Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Functional signatures and pseudorandom functions
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- Limits of extractability assumptions with distributional auxiliary input
- Multi-input 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 power of rewinding simulators in functional encryption
- On the practical security of inner product functional encryption
Cited in
(6)- Impossibility of simulation secure functional encryption even with random oracles
- On the power of rewinding simulators in functional encryption
- Verifiable functional encryption using Intel SGX
- On the achievability of simulation-based security for functional encryption
- Verifiable Inner Product Encryption Scheme
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
This page was built for publication: Simulation-based secure functional encryption in the random oracle model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946439)
