1058 search results - page 79 / 212 » Secure Group Communications Using Key Graphs |
133
Voted
CCS
2010
ACM
15 years 1 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
133
click to vote
CN
2007
15 years 2 months ago
2007
Ad hoc groups, such as peer-to-peer (P2P) systems and mobile ad hoc networks (MANETs) represent recent technological advancements. They support low-cost, scalable and fault-tolera...
127
Voted
GLOBECOM
2006
IEEE
15 years 8 months ago
2006
IEEE
—Packet classification is important in fulfilling the requirements of new services such as policy-based routing in next generation networks. In this paper, we propose a novel bit...
160
Voted
WISEC
2010
ACM
15 years 7 months ago
2010
ACM
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
119
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...