440 search results - page 54 / 88 » On partial randomness |
130
Voted
CCS
2005
ACM
15 years 9 months ago
2005
ACM
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...
122
Voted
STOC
1991
ACM
15 years 7 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
158
click to vote
COLT
2008
Springer
15 years 5 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
122
Voted
ENTCS
2006
15 years 3 months ago
2006
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
128
Voted
NETWORK
2008
15 years 3 months ago
2008
Multihomed subscribers are increasingly adopting intelligent route control solutions to optimize the cost and end-to-end performance of the traffic routed among the different link...