The following pages link to (Q5875789):
Displaying 12 items.
- Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification (Q2056782) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- (Commit-and-prove) predictable arguments with privacy (Q2096627) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- NIKE from affine determinant programs (Q2697912) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Forward-secure public key encryption without key update from proof-of-stake blockchain (Q6157602) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
