Communications of the ACM
The performance of query control schemes for the zone routing protocol
IEEE/ACM Transactions on Networking (TON)
SPINS: security protocols for sensor networks
Wireless 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 for Secure Communication in Ad Hoc Networks: A Probabilistic Approach
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
An efficient scheme for authenticating public keys in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Efficient key establishment for group-based wireless sensor deployments
Proceedings of the 4th ACM workshop on Wireless security
Group-based key pre-distribution in wireless sensor networks
Proceedings of the 4th ACM workshop on Wireless security
Securing group key exchange against strong corruptions
Proceedings of the 2008 ACM symposium on Information, computer and communications security
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Round-Optimal and efficient verifiable secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Designing secure sensor networks
IEEE Wireless Communications
Hi-index | 0.00 |
Secure communications in wireless ad hoc networks require setting up end-to-end secret keys for communicating node pairs. Due to physical limitations and scalability requirements, full key-connectivity can not be achieved by key pre-distribution. In this paper, we develop an analytical framework for the on-demand key establishment approach. We propose a novel security metric, called REM resilience vector to quantify the resilience of any key establishment schemes against Revealing, Erasure, and Modification (REM) attacks. Our analysis shows that previous key establishment schemes are vulnerable under REM attacks. Relying on the new security metric, we prove a universal bound on achievable REM resilience vectors for any on-demand key establishment scheme. This bound that characterizes the optimal security performance analytically is shown to be tight, as we propose a REM-resilient key establishment scheme which achieves any vector within this bound. In addition, we develop a class of low complexity key establishment schemes which achieve nearly-optimal REM-attack resilience.