175 search results - page 10 / 35 » Approximation Algorithms for Key Management in Secure Multic... |
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
ISCC
2003
IEEE
15 years 2 months ago
2003
IEEE
Perfect Secrecy can only be achieved in multicast groups by ciphering data sent to the group with a different key every time a member joins or leaves the group. A Key Server must ...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
ACMSE
2007
ACM
15 years 1 months ago
2007
ACM
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
USENIX
1994
14 years 10 months ago
1994
As distributed computing systems grow in size, complexity and variety of application, the problem of protecting sensitive data from unauthorized disclosure and tampering becomes i...