Simulation secure multi-input quadratic functional encryption
From MaRDI portal
Cites work
- A new approach to practical function-private inner product encryption
- A new paradigm for public-key functional encryption for degree-2 polynomials
- An algebraic framework for Diffie-Hellman assumptions
- CCA-secure inner-product functional encryption from projective hash functions
- Efficient functional encryption for inner-product values with full-hiding security
- Fully secure functional encryption for inner products, from standard assumptions
- Function-hiding inner product encryption
- Function-hiding inner product encryption is practical
- Functional encryption for inner product with full function privacy
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Impossibility results for lattice-based functional encryption schemes
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Multi-input functional encryption
- Multi-input functional encryption for inner products: function-hiding realizations and constructions without pairings
- Multi-input inner-product functional encryption from pairings
- Multi-input quadratic functional encryption from pairings
- Multi-input quadratic functional encryption: stronger security, broader functionality
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Predicate Privacy in Encryption Systems
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Simple functional encryption schemes for inner products
Cited in
(1)
This page was built for publication: Simulation secure multi-input quadratic functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970689)
