Sciweavers

99 search results - page 7 / 20
» Approximation Hardness and Secure Communication in Broadcast...
Sort
View
MOBIHOC
2009
ACM
14 years 9 months ago
Efficient uncoordinated FHSS anti-jamming communication
We address the problem of jamming-resistant communication in scenarios in which the communicating parties do not share secret keys. This includes scenarios where the communicating...
Mario Strasser, Christina Pöpper, Srdjan Capk...
INFOCOM
2006
IEEE
14 years 2 months ago
Leveraging Channel Diversity for Key Establishment in Wireless Sensor Networks
— As the use of sensor networks increases, security in this domain becomes a very real concern. One fundamental aspect of providing confidentiality and authentication is key dis...
Matthew J. Miller, Nitin H. Vaidya
SIGCOMM
2010
ACM
13 years 8 months ago
Design and implementation of an "approximate" communication system for wireless media applications
All practical wireless communication systems are prone to errors. At the symbol level such wireless errors have a well-defined structure: when a receiver decodes a symbol erroneou...
Sayandeep Sen, Syed Gilani, Shreesha Srinath, Step...
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
14 years 17 days ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
IJNSEC
2010
66views more  IJNSEC 2010»
13 years 3 months ago
Finding Traitors in Secure Networks Using Byzantine Agreements
Secure networks rely upon players to maintain security and reliability. However not every player can be assumed to have total loyalty and one must use methods to uncover traitors ...
Liam Wagner, Stuart McDonald