1058 search results - page 173 / 212 » Secure Group Communications Using Key Graphs |
ICDCSW
2005
IEEE
15 years 3 months ago
2005
IEEE
Publish/subscribe is emerging as an appropriate communication paradigm for large-scale, widely-distributed systems. In this paper, we describe our work on integrating active datab...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
103
click to vote
IJCAI
2007
14 years 11 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
ISCC
2006
IEEE
15 years 3 months ago
2006
IEEE
— The stability and robustness of BGP remains one of the most critical elements in sustaining today’s Internet. In this paper, we study the structure and stability of origin ad...
ASIACRYPT
2001
Springer
15 years 1 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...