144 search results - page 6 / 29 » CLIQUES: A New Approach to Group Key Agreement |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
ICDM
2008
IEEE
14 years 3 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
PODC
2004
ACM
14 years 2 months ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
ADHOC
2008
13 years 8 months ago
2008
In this paper, we present a secure group key management scheme for hierarchical mobile ad-hoc networks. Our approach aims to improve both scalability and survivability of group ke...
IJNSEC
2008
13 years 8 months ago
2008
Specific applications like military or public emergency ones require secure group communication in ad hoc environments. The most suitable solution to provide the expected level of...