The following pages link to Robust Pseudorandom Generators (Q5326593):
Displaying 11 items.
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
- Side-channel masking with pseudo-random generator (Q2055660) (← links)
- Dummy shuffling against algebraic attacks in white-box implementations (Q2056730) (← links)
- Private circuits with quasilinear randomness (Q2170088) (← links)
- Packed multiplication: how to amortize the cost of side-channel masking? (Q2692370) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Pseudo-random generators for all hardnesses (Q5917585) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Tight bounds on the randomness complexity of secure multiparty computation (Q6166963) (← links)
- Leakage-tolerant circuits (Q6637525) (← links)