Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Error-Control Coding for Data Networks
Error-Control Coding for Data Networks
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Location-based pairwise key establishments for static sensor networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Location-aware key management scheme for wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Analysis of multipath Routing-Part I: the effect on the packet delivery ratio
IEEE Transactions on Wireless Communications
Misbehavior resilient multi-path data transmission in mobile ad-hoc networks
Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
Pair-wise path key establishment in wireless sensor networks
Computer Communications
Multi-path key establishment against REM attacks in wireless ad hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Secure multi-path data deliver in sensor networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Verifying multicast-based security protocols using the inductive method
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Cooperative secret delivery in wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Random key predistribution and pairwise key establishment schemes have been proposed for key management in large-scale sensor networks. In these schemes, after being deployed, sensors set up pairwise keys via preinstalled keys. The key establishment schemes are vulnerable to Byzantine attacks, i.e., packet dropping or altering. To counter these attacks, we propose a Byzantine resilient multi-path key establishment scheme that uses the Reed-Solomon errorcorrect coding scheme to improve resilience to Byzantine attacks. Our proposed scheme can tolerate at most t faulty key paths, where t = (n - k)/2 when (n, k) Reed-Solomon error-correct coding scheme is used. In addition, by using the Reed-solomon coding scheme, sensors can identify the faulty paths with minimal communication overhead.