780 search results - page 79 / 156 » Robustness and Randomness |
CCS
2005
ACM
14 years 2 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...
JAIR
2000
13 years 8 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Information security has become a cause of concern because of the electronic eavesdropping. Capacity, robustness and invisibility are important parameters in information hiding and...
ACNS
2009
Springer
13 years 6 months ago
2009
Springer
In this paper, we propose a notion of threshold tag-based encryption schemes that simplifies the notion of threshold identity-based encryption schemes, and we show a conversion fro...