Unbounded quadratic functional encryption and more from pairings
From MaRDI portal
Publication:6063532
Recommendations
- Functional encryption for quadratic functions from k-lin, revisited
- Simple and efficient FE for quadratic functions
- Multi-input quadratic functional encryption from pairings
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Unbounded inner product functional encryption from bilinear maps
Cites work
- (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin
- A new paradigm for public-key functional encryption for degree-2 polynomials
- An algebraic framework for Diffie-Hellman assumptions
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate Multilinear Maps from Ideal Lattices
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Fully secure functional encryption with general relations from the decisional linear assumption
- Function-hiding inner product encryption
- Function-private functional encryption in the private-key setting
- Functional encryption for attribute-weighted sums from \(k\)-Lin
- Functional encryption for quadratic functions from k-lin, revisited
- Functional Encryption for Turing Machines
- Functional encryption without obfuscation
- Functional encryption: definitions and challenges
- How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Inner-product functional encryption with fine-grained access control
- Multi-input quadratic functional encryption from pairings
- On extractability obfuscation
- Partial garbling schemes and their applications
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Public-coin differing-inputs obfuscation and its applications
- Simple and efficient FE for quadratic functions
- Simple functional encryption schemes for inner products
- Unbounded inner product functional encryption from bilinear maps
- Unbounded inner-product functional encryption with succinct keys
Cited in
(5)- Lower bounds for lattice-based compact functional encryption
- Registered functional encryptions from pairings
- Multi-client attribute-based unbounded inner product functional encryption, and more
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Unbounded quadratic functional encryption and more from pairings
This page was built for publication: Unbounded quadratic functional encryption and more from pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063532)
