An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
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
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Design Considerations for Next Generation Wireless Power-Aware Microsensor Nodes
VLSID '04 Proceedings of the 17th International Conference on VLSI Design
The number of neighbors needed for connectivity of wireless networks
Wireless Networks
The Strange Logic of Random Graphs
The Strange Logic of Random Graphs
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
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
SecLEACH-On the security of clustered sensor networks
Signal Processing
Secure, accurate and precise time synchronization for wireless sensor networks
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
Network Decoupling: A Methodology for Secure Communications in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Group-based key predistribution for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Comparison of innovative signature algorithms for WSNs
WiSec '08 Proceedings of the first ACM conference on Wireless network security
WiSec '08 Proceedings of the first ACM conference on Wireless network security
On the design of secure protocols for hierarchical sensor networks
International Journal of Security and Networks
End-to-end pairwise key establishment using node disjoint secure paths in wireless sensor networks
International Journal of Security and Networks
An Application-Oriented Framework for Wireless Sensor Network Key Establishment
Electronic Notes in Theoretical Computer Science (ENTCS)
Maximum supported network coverage area and cost evaluation of key pre-distribution schemes
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Energy-efficient relaxed rekeying policies for distributed key management in sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
A novel key management algorithm in sensor networks
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
A Computationally-Efficient Construction for the Matrix-Based Key Distribution in Sensor Network
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Multi-neighbor random key pre-distribution: a probabilistic analysis
IEEE Communications Letters
ACM Transactions on Sensor Networks (TOSN)
A multivariate key-establishment scheme for wireless sensor networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Dealing with random and selective attacks in wireless sensor systems
ACM Transactions on Sensor Networks (TOSN)
Opportunistic sensing: security challenges for the new paradigm
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Smart Dust Security -- Key Infection Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
A practical inter-sensor broadcast authentication scheme
UAHCI'07 Proceedings of the 4th international conference on Universal access in human computer interaction: coping with diversity
R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks
Proceedings of the 2010 ACM Symposium on Applied Computing
On grid-based key pre-distribution: toward a better connectivity in wireless sensor network
PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
NanoECC: testing the limits of elliptic curve cryptography in sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
A survey on key management mechanisms for distributed Wireless Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Component Evolution in General Random Intersection Graphs
SIAM Journal on Discrete Mathematics
A high performance and intrinsically secure key establishment protocol for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Geometric graphs with randomly deleted edges - connectivity and routing protocols
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Applying key infrastructures for sensor networks in CIP/CIIP scenarios
CRITIS'06 Proceedings of the First international conference on Critical Information Infrastructures Security
Secure rejoining scheme for dynamic sensor networks
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
A strong key pre-distribution scheme for wireless sensor networks
UIC'06 Proceedings of the Third international conference on Ubiquitous Intelligence and Computing
Key management for mobile sensor networks
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
On optimality of key pre-distribution schemes for distributed sensor networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Hierarchical grid-based pairwise key predistribution scheme for wireless sensor networks
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Tampering with motes: real-world physical attacks on wireless sensor networks
SPC'06 Proceedings of the Third international conference on Security in Pervasive Computing
Using Auxiliary Sensors for Pairwise Key Establishment in WSN
ACM Transactions on Embedded Computing Systems (TECS)
Key establishment protocols for secure communication in clustered sensor networks
International Journal of Communication Networks and Distributed Systems
Privacy Provisioning in Wireless Sensor Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective. To solve this problem, several key pre-distribution schemes have been proposed for sensor networks based on random graph theory. In these schemes, a set of randomly chosen keys or secret information is pre-distributed to each sensor node and a network is securely formed based on this information. Most of the schemes assumed that the underlying physical network is dense enough, that is, the degree of each node is hig. In this paper, we revisit the random graph theory and use giant component theory by Erdos and Renyi to show that even if the node degree is small, most of the nodes in the network can be connected. Further, we use this fact to analyze the Eschenhauer et. al's, Du et. al's, and Chan et. al's key pre-distribution schemes and evaluate the relation between connectivity, memory size, and security. We show that we can reduce the amount of memory required or improve security by trading-off a very small number of isolated nodes. Our simulation results show that the communication overhead does not increase significantly even after reducing the node degree. In addition, we present an approach by which nodes can dynamically adjust their transmission power to establish secure links with the targeted networked neighbors. Finally, we propose an effcient path-key identification algorithm and compare it with the existing scheme.