Robust pseudorandom generators
From MaRDI portal
Recommendations
- Side-channel masking with pseudo-random generator
- scientific article; zbMATH DE number 1670863
- Pseudorandom generators with optimal seed length for non-Boolean poly-size circuits
- On linear-size pseudorandom generators and hardcore functions
- On linear-size pseudorandom generators and hardcore functions
Cited in
(18)- Robust random number generation for peer-to-peer systems
- Minimizing locality of one-way functions via semi-private randomized encodings
- Side-channel masking with pseudo-random generator
- Dummy shuffling against algebraic attacks in white-box implementations
- Private circuits with quasilinear randomness
- Seedless fruit is the sweetest: random number generation, revisited
- Packed multiplication: how to amortize the cost of side-channel masking?
- Robust pseudo-random number generators with input secure against side-channel attacks
- Bounded indistinguishability and the complexity of recovering secrets
- How to use pseudorandom generators in unconditional security settings
- Space pseudorandom generators by communication complexity lower bounds
- Cryptographic hardness of random local functions. Survey
- On the implementation of huge random objects
- Pseudo-random generators for all hardnesses
- Actively secure garbled circuits with constant communication overhead in the plain model
- Tight bounds on the randomness complexity of secure multiparty computation
- Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols
- Leakage-tolerant circuits
This page was built for publication: Robust pseudorandom generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326593)
