554 search results - page 105 / 111 » Verifying Security Protocols Modelled by Networks of Automat... |
TMC
2008
13 years 7 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
CSE
2009
IEEE
13 years 8 months ago
2009
IEEE
In Mobile Social Networks (MSN) individuals with similar interests or commonalities connect to each other using the mobile phones. MSN are special kind of Ad-hoc Networks in which ...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
We propose novel solutions for unicast routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic i...
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish...
SOSP
2007
ACM
14 years 4 months ago
2007
ACM
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...