Pages that link to "Item:Q5041154"
From MaRDI portal
The following pages link to A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials (Q5041154):
Displaying 17 items.
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- Simple and efficient FE for quadratic functions (Q2043408) (← links)
- Tightly CCA-secure inner product functional encryption scheme (Q2055966) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Broadcast encryption with size \(N^{1/3}\) and more from \(k\)-Lin (Q2139632) (← links)
- Multi-input quadratic functional encryption from pairings (Q2139634) (← links)
- Polly Two: a new algebraic polynomial-based public-key scheme (Q2432555) (← links)
- Inner-product functional encryption with fine-grained access control (Q2691594) (← links)
- Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption (Q5041229) (← links)
- Decentralized multi-authority attribute-based inner-product FE: large universe and unbounded (Q6091135) (← links)
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) (← links)
- Unbounded predicate inner product functional encryption from pairings (Q6109084) (← links)
- Multi-client functional encryption with fine-grained access control (Q6135394) (← links)
- A survey on functional encryption (Q6163797) (← links)
- Fine-grained polynomial functional encryption (Q6593672) (← links)
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions (Q6604927) (← links)
- Lower bounds for lattice-based compact functional encryption (Q6636507) (← links)
