Robust Pseudorandom Generators
From MaRDI portal
Publication:5326593
DOI10.1007/978-3-642-39206-1_49zbMath1336.94053OpenAlexW45359297MaRDI QIDQ5326593
Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, David Zuckerman, Amit Sahai, Rafail Ostrovsky, 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
Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items
Cryptographic hardness of random local functions. Survey ⋮ Private circuits with quasilinear randomness ⋮ Tight bounds on the randomness complexity of secure multiparty computation ⋮ Packed multiplication: how to amortize the cost of side-channel masking? ⋮ Minimizing locality of one-way functions via semi-private randomized encodings ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Side-channel masking with pseudo-random generator ⋮ Dummy shuffling against algebraic attacks in white-box implementations ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets
