Sciweavers

1058 search results - page 105 / 212
» Secure Group Communications Using Key Graphs
Sort
View
120
Voted
COMPSEC
2010
124views more  COMPSEC 2010»
15 years 1 months ago
A provably secure secret handshake with dynamic controlled matching
Abstract A Secret Handshake is a protocol that allows two users to mutually verify one another’s properties, and in case of simultaneous matching, to share a key used to secure s...
Alessandro Sorniotti, Refik Molva
111
Voted
ICDCS
2006
IEEE
15 years 8 months ago
Fast data access over asymmetric channels using fair and secure bandwidth sharing
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet con...
Sachin Agarwal, Moshe Laifenfeld, Ari Trachtenberg...
SAC
2009
ACM
15 years 7 months ago
Autonomous networked robots for the establishment of wireless communication in uncertain emergency response scenarios
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
Stelios Timotheou, Georgios Loukas
WS
2006
ACM
15 years 8 months ago
Integrity regions: authentication through presence in wireless networks
We introduce Integrity (I) regions, a novel security primitive that enables message authentication in wireless networks without the use of pre-established or pre-certified keys. ...
Srdjan Capkun, Mario Cagalj
CSFW
2005
IEEE
15 years 8 months ago
Temporal Rank Functions for Forward Secrecy
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
Rob Delicata, Steve A. Schneider