Sciweavers

13214 search results - page 6 / 2643
» Pseudorandomness for network algorithms
Sort
View
87
Voted
CRYPTO
2010
Springer
151views Cryptology» more  CRYPTO 2010»
15 years 22 days 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
CORR
2008
Springer
177views Education» more  CORR 2008»
14 years 11 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
STOC
2006
ACM
117views Algorithms» more  STOC 2006»
15 years 5 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
65
Voted
COCO
2005
Springer
68views Algorithms» more  COCO 2005»
15 years 5 months ago
Pseudorandomness for Approximate Counting and Sampling
Ronen Shaltiel, Christopher Umans