Pages that link to "Item:Q2170025"
From MaRDI portal
The following pages link to Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\) (Q2170025):
Displayed 17 items.
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption (Q6063529) (← links)
- Registered attribute-based encryption (Q6063531) (← links)
- Multi-key and multi-input predicate encryption from learning with errors (Q6063533) (← links)
- Broadcast, trace and revoke with optimal parameters from polynomial hardness (Q6063535) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- Multi-input quadratic functional encryption: stronger security, broader functionality (Q6114258) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Witness encryption and null-iO from evasive LWE (Q6135397) (← links)
- Worst-case subexponential attacks on PRGs of constant degree or constant locality (Q6138077) (← links)
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) (Q6138084) (← links)
- The pseudorandom oracle model and ideal obfuscation (Q6149607) (← links)
- Computational wiretap coding from indistinguishability obfuscation (Q6149608) (← links)
- Multi-input attribute based encryption and predicate encryption (Q6155270) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- PPAD is as hard as LWE and iterated squaring (Q6169422) (← links)
- Non-interactive zero-knowledge from non-interactive batch arguments (Q6186697) (← links)
- Streaming functional encryption (Q6190119) (← links)