Pages that link to "Item:Q1675747"
From MaRDI portal
The following pages link to Indistinguishability obfuscation from trilinear maps and block-wise local PRGs (Q1675747):
Displaying 37 items.
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- Towards breaking the exponential barrier for general secret sharing (Q1648814) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- Impossibility results for lattice-based functional encryption schemes (Q2055607) (← links)
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- Matrix PRFs: constructions, attacks, and applications to obfuscation (Q2175904) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Improved filter permutators for efficient FHE: better instances and implementations (Q2179380) (← links)
- Multilinear maps from obfuscation (Q2188963) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials (Q5041154) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- (Q6062142) (← links)
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin (Q6095187) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- A survey on functional encryption (Q6163797) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
- Fine-grained polynomial functional encryption (Q6593672) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
- Robust decentralized multi-client functional encryption: motivation, definition, and inner-product constructions (Q6604927) (← links)
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH} (Q6618631) (← links)
- Lower bounds for lattice-based compact functional encryption (Q6636507) (← links)
