154 search results - page 18 / 31 » Proving Group Protocols Secure Against Eavesdroppers |
146
click to vote
ENTCS
2007
15 years 1 months ago
2007
Designing secure protocols over ad-hoc networks has proved to be a very challenging task, due to various features of such networks, such as partial connectivity, node mobility, an...
109
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the n...
132
click to vote
CNSR
2008
IEEE
15 years 7 months ago
2008
IEEE
Key establishment plays a central role in authentication and encryption in wireless sensor networks, especially when they are mainly deployed in hostile environments. Because of t...
115
click to vote
TCC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
105
click to vote
WCC
2005
Springer
15 years 6 months ago
2005
Springer
A secret handshake mechanism allows two entities, members of a same group, to authenticate each other secretly. This primitive was introduced recently by Balfanz, Durfee, Shankar, ...