1528 search results - page 71 / 306 » On Signatures for Communication Graphs |
ESAS
2007
Springer
14 years 1 months ago
2007
Springer
The problem of secure routing in mobile ad hoc networks is long-standing and has been extensively studied by researchers. Recently, techniques of aggregating signatures have been a...
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
IAT
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In this paper, we consider a multi-agent system consisting of mobile agents with second-order dynamics. The communication network is determined by a standard interaction rule based...