Sciweavers

154 search results - page 12 / 31
» Proving Group Protocols Secure Against Eavesdroppers
Sort
View
JCM
2008
121views more  JCM 2008»
14 years 9 months ago
A Cooperative Secure Routing Protocol based on Reputation System for Ad Hoc Networks
In wireless ad hoc networks, all its nodes behave as routers and take part in its discovery and maintenance of routes to other nodes. Thus, the presence of selfish or malicious nod...
Yihui Zhang, Li Xu, Xiaoding Wang
CSFW
1999
IEEE
15 years 2 months ago
Mixed Strand Spaces
Strand space analysis [13, 12] is a method for stating and proving correctness properties for cryptographic protocols. In this paper we apply the same method to the related proble...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
CSFW
2008
IEEE
14 years 11 months ago
A Correctness Proof of a Mesh Security Architecture
The IEEE 802.11s working group is tasked to provide ways of establishing and securing a wireless mesh network. One proposal establishes a Mesh Security Architecture (MSA), with a ...
Doug Kuhlman, Ryan Moriarty, Tony Braskich, Steve ...
TISSEC
2008
235views more  TISSEC 2008»
14 years 9 months ago
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
ASIACRYPT
2001
Springer
15 years 1 months ago
Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case
Dynamic group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to work in a scenario in which the group membership is not known in advance but where parti...
Emmanuel Bresson, Olivier Chevassut, David Pointch...