An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
IEEE Transactions on Computers
The availability of crumbling wall quorum systems
Discrete Applied Mathematics
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
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
Wireless Communications & Mobile Computing - Wireless Network Security
Improved Pairwise Key Establishment for Wireless Sensor Networks
WIMOB '06 Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Efficient Key Pre-distribution for Sensor Nodes with Strong Connectivity and Low Storage Space
AINA '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications
An Improved Matrix Key Pre-distribution Scheme for Wireless Sensor Networks
ICESS '08 Proceedings of the 2008 International Conference on Embedded Software and Systems
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
An Efficient and Secure Key Establishment Scheme for Wireless Sensor Network
IITSI '10 Proceedings of the 2010 Third International Symposium on Intelligent Information Technology and Security Informatics
| Hi-index | 0.00 |
To ensure the security of wireless sensor networks, it is important to have a robust key management scheme. In this paper, we propose a Quorum-based key management scheme. A specific sensor, called as key distribution server (KDS), generates a key matrix and establishes a quorum system from the key matrix. The quorum system is a set system of subsets that the intersection of any two subsets is non-empty. In our scheme, each sensor is assigned a subset of the quorum system as its pre-distributed keys. Whenever any two sensors need a shared key, they exchange their IDs, and then each sensor by itself finds a common key from its assigned subset. A shared key is then generated by the two sensors individually based on the common key. By our scheme, no key is needed to be refreshed as a sensor leaves the network. Upon a sensor joining the network, the KDS broadcasts a message containing the joining sensor ID. After receiving the broadcast message, each sensor updates the key which is in common with the new joining one. Only XOR and hash operations are required to be executed during key update process, and each sensor needs to update one key only. In summary, the proposed scheme satisfies the following properties: low communication overhead, low computational overhead, fully key connectivity, and resistance against node capture attack.