Fine-grained polynomial functional encryption
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- A new paradigm for public-key functional encryption for degree-2 polynomials
- Adaptive simulation security for inner product functional encryption
- Attribute-hiding predicate encryption in bilinear groups, revisited
- Candidate Multilinear Maps from Ideal Lattices
- Compact FE for unbounded attribute-weighted sums for logspace from SXDH
- Compact adaptively secure ABE from \(k\)-Lin: beyond \(\mathsf{NC}^1\) and towards \(\mathsf{NL} \)
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Erratum for: ``On basing one-way functions on NP-hardness
- Fine-Grained Cryptography
- Fine-grained cryptography revisited
- Fine-grained cryptography revisited
- Fine-grained secure attribute-based encryption
- Fine-grained secure computation
- Fully secure functional encryption for inner products, from standard assumptions
- Function-hiding inner product encryption
- Functional encryption for inner product with full function privacy
- Functional encryption for quadratic functions from k-lin, revisited
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption without obfuscation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- Non-interactive zero-knowledge proofs with fine-grained security
- One-way permutations in NC 0
- Optimal bounded-collusion secure functional encryption
- Parity, circuits, and the polynomial-time hierarchy
- Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
- Practical functional encryption for quadratic functions with applications to predicate encryption
- Secure communications over insecure channels
- Simple functional encryption schemes for inner products
- Unconditionally secure NIZK in the fine-grained setting
- \(\Sigma_ 1^ 1\)-formulae on finite structures
This page was built for publication: Fine-grained polynomial functional encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593672)
