Sciweavers

13214 search results - page 6 / 2643
» Pseudorandomness for network algorithms
Sort
View
191
Voted
CRYPTO
2010
Springer
151views Cryptology» more  CRYPTO 2010»
15 years 8 months ago
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks
Abstract. A cryptographic primitive is leakage-resilient, if it remains secure even if an adversary can learn a bounded amount of arbitrary information about the computation with e...
Yevgeniy Dodis, Krzysztof Pietrzak
213
Voted
CORR
2008
Springer
177views Education» more  CORR 2008»
15 years 7 months ago
Toeplitz Block Matrices in Compressed Sensing
: This paper addresses the problem of reconstructing an image from 1-bit-quantized measurements, considering a simple but nonconventional optical acquisition model. Following a com...
Florian Sebert, Leslie Ying, Yi Ming Zou
184
Voted
CRYPTO
2012
Springer
214views Cryptology» more  CRYPTO 2012»
13 years 10 months ago
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
Eric Miles, Emanuele Viola
STOC
2006
ACM
117views Algorithms» more  STOC 2006»
16 years 1 months ago
Pseudorandom walks on regular digraphs and the RL vs. L problem
We revisit the general RL vs. L question, obtaining the following results.
Omer Reingold, Luca Trevisan, Salil P. Vadhan
COCO
2005
Springer
68views Algorithms» more  COCO 2005»
16 years 1 months ago
Pseudorandomness for Approximate Counting and Sampling
Ronen Shaltiel, Christopher Umans