20 search results - page 3 / 4 » Weak Adversaries for the k-Server Problem |
JSAC
2010
14 years 6 months ago
2010
Jamming-resistant communication is crucial for safety-critical applications such as emergency alert broadcasts or the dissemination of navigation signals in adversarial settings. I...
111
Voted
ESORICS
2009
Springer
16 years 8 days ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
ICTAC
2005
Springer
15 years 5 months ago
2005
Springer
It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensu...
87
Voted
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...