Robust pseudorandom generators
DOI10.1007/978-3-642-39206-1_49zbMATH Open1336.94053OpenAlexW45359297MaRDI QIDQ5326593FDOQ5326593
Authors: Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman, Xin Li 
Publication date: 6 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_49
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
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cited In (18)
- Pseudo-random generators for all hardnesses
- Tight bounds on the randomness complexity of secure multiparty computation
- Robust pseudo-random number generators with input secure against side-channel attacks
- Space pseudorandom generators by communication complexity lower bounds
- Robust random number generation for peer-to-peer systems
- On the implementation of huge random objects
- Cryptographic hardness of random local functions. Survey
- Private circuits with quasilinear randomness
- Side-channel masking with pseudo-random generator
- Dummy shuffling against algebraic attacks in white-box implementations
- How to use pseudorandom generators in unconditional security settings
- Leakage-tolerant circuits
- Seedless fruit is the sweetest: random number generation, revisited
- Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols
- Minimizing locality of one-way functions via semi-private randomized encodings
- Packed multiplication: how to amortize the cost of side-channel masking?
- Bounded indistinguishability and the complexity of recovering secrets
- Actively secure garbled circuits with constant communication overhead in the plain model
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)
