CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY
@inproceedings{Carman2000CONSTRAINTSAA,
title={CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY},
author={David Carman and Peter Kruus and Brian J. Matt},
year={2000}
}Executive Summary Confidentiality, integrity, and authentication services are critical to preventing an adversary from compromising the security of a distributed sensor network. Key management is likewise critical to establishing the keys necessary to provide this protection. However, providing key management is difficult due to the ad hoc nature, intermittent connectivity, and resource limitations of the sensor network environment. As part of the SensIT program, NAI Labs is addressing this…
Figures and Tables from this paper
figure 1 
table 1 
table 2 
figure 2 
table 3 
figure 3 
figure 4 
table 4 
figure 5 
table 5 
figure 6 
table 6 
figure 7 
table 7 
figure 8 
table 8 
table 9 
figure 9 
table 10 
figure 10 
table 11 
figure 11 
table 12 
figure 12 
table 13 
figure 13 
table 14 
figure 14 
table 15 
figure 15 
table 16 
figure 16 
table 17 
figure 17 
table 18 
figure 18 
table 19 
figure 19 
table 20 
figure 20 
table 21 
figure 21 
table 22 
figure 22 
table 23 
figure 23 
table 24 
figure 24 
table 25 
figure 25 
table 26 
table 27 
table 28 
table 29 
table 30 
table 31 
table 32 
table 33 
table 34 
table 35 
table 36 
table 37 
table 38 
table 39 
table 40 
table 41 
table 42 
table 43 
table 44 
table 45 
table 46 
table 47 
table 48 
table 49 
table 50 
table 51 
table 52
798 Citations
LEAP+: Efficient security mechanisms for large-scale distributed sensor networks
- Computer ScienceTOSN
- 2006
The security of LEAP+ under various attack models is analyzed and it is shown that it is very effective in defending against many sophisticated attacks, such as HELLO flood attacks, node cloning attacks, and wormhole attacks.
A Security Protocol for Wireless Sensor Networks
- Computer ScienceINTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING & TECHNOLOGY
- 2019
A set of security building blocks optimized for resource constrained environments and wireless communication, including SNEP and TESLA, which provides authenticated broadcast for severely resource-constrained surroundings is presented.
Key Management Schemes in Sensor Networks
- Computer Science
- 2007
This work aimed to generate a brief knowledge about different key management schemes and their effectiveness in sensor networks, noticing that no key distribution technique is ideal to all the scenarios where sensor networks are used; therefore the techniques employed must depend upon the requirements and resources of each individual sensor network.
An Authenticated Key Management Scheme for Hierarchical Wireless Sensor Networks
- Computer Science
- 2008
The proposed authenticated key management (AKM) scheme is more resilient to node capture as compared to other random key pre-distribution schemes and can be applied for different routing and energy efficient data dissemination techniques for sensor networks.
Security and Collaboration Protocols for Mobile and Sensor Networks
- Computer Science
- 2012
This dissertation aims to design security and collaboration protocols to create a comprehensive trust framework to protect mobile and sensor networks by applying cryptographic algorithms and proposes and implements a distributed authentication protocol called DAPP in wireless sensor networks to allow sensors to authenticate servers without requiring a commonly-used trusted authentication server.
Secure Routing in Wireless Sensor Networks
- Computer Science, BusinessHandbook of Information and Communication Security
- 2010
Simulation results have shown that HIKES provides an energy-efficient and scalable solution to the key management problem and cost analysis shows that HikES is computationally efficient and has low storage requirement.
A Less Energy Efficient Key Management Protocol for WSNs
- Computer Science
- 2014
This paper presents an energy-aware approach for managing the cryptographic keys in a clustered sensor network and shows that the energy consumption overhead for the key management is remarkably low and reports an order-of-magnitude energy saving.
Scalable and Storage Efficient Dynamic Key Management Scheme for Wireless Sensor Network
- Computer ScienceWirel. Commun. Mob. Comput.
- 2021
SSEKMS is a dynamic key management system that also supports the inclusion of the new node and refreshes the keys as per requirements, and compared it with other existing schemes.
Key Management for Wireless Sensor Networks in Hostile Environments
- Computer Science
- 2006
This work proposes a novel, self-organizing key management scheme for large-scale and long-lived WSNs, called Survivable and Efficient Clustered Keying (SECK), and shows that it is highly robust against node capture and key compromise while incurring low communication and storage overhead.
Sensor Networks-Security: SPINS
- Computer Science
- 2010
A suite of security building blocks optimized for resource constrained environments and wireless communication, and show that they are practical even on minimal hardware: the performance of the protocol suite easily matches the data rate of the network.
References
SHOWING 1-10 OF 89 REFERENCES
Computer communication security - principles, standard protocols and techniques
- Computer Science
- 1994
This chapter discusses the standardization process, which led to the establishment of ASN.I.
New multiparty authentication services and key agreement protocols
- Computer ScienceIEEE Journal on Selected Areas in Communications
- 2000
This paper studies the problem of authenticated key agreement in dynamic peer groups with the emphasis on efficient and provably secure key authentication, key confirmation, and integrity.
Network security via private-key certificates
- Computer Science, MathematicsOPSR
- 1990
This system combines a new notion of private-key certificates, a simple key-translation protocol, and key-distribution so that users can communicate securely while sharing neither an encryption key nor a network connection.
A Secure and Efficient Conference Key Distribution System (Extended Abstract)
- Computer Science, MathematicsEUROCRYPT
- 1994
The technique for authentication can be extended and used as the basis for an authentication scheme which is ‘proven’ secure against any type of attack, provided the Discrete Logarithm problem is intractable.
Cryptography and Network Security: Principles and Practice
- Computer Science
- 1998
William Stallings' Cryptography and Network Security: Principles and Practice, 5e is a practical survey of cryptography and network security with unmatched support for instructors and students. In…
Distributed authentication in Kerberos using public key cryptography
- Computer ScienceProceedings of SNDSS '97: Internet Society 1997 Symposium on Network and Distributed System Security
- 1997
By distributing most of the authentication workload away from the trusted intermediary and to the communicating parties, significant enhancements to security and scalability can be achieved as compared to Kerberos V5.
Perfectly-Secure Key Distribution for Dynamic Conferences
- Computer ScienceCRYPTO
- 1992
This paper considers the model where interaction is allowed in the common key computation phase, and shows a gap between the models by exhibiting an interactive scheme in which the user's information is only k + t - 1 times the size of the commonKey.
On Key Distribution and Authentication in Mobile Radio Networks
- Computer Science, MathematicsEUROCRYPT
- 1993
This paper presents a new secure and efficient key distribution protocol for mobile communication networks based on low exponent RSA and shows that the protocol shown is not secure.
Kerberos: an authentication service for computer networks
- Computer ScienceIEEE Communications Magazine
- 1994
The authors concentrate on authentication for real-time, interactive services that are offered on computer networks, which includes remote login, file system reads and writes, and information retrieval for applications like Mosaic.
Timestamps in key distribution protocols
- Computer ScienceCACM
- 1981
It is shown that key distribution protocols with timestamps prevent replays of compromised keys and have the additional benefit of replacing a two-step handshake.