International Journal of Research and Reviews in Information Security and Privacy (IJRRISP) Vol. 1, No. 2, June 2011
Copyright © Science Academy Publisher, United Kingdom
A Configurable and Efficient Key-Management scheme for
SCADA Communication Networks
Zia Saquib1, Ravi Batra1, Om Pal1, Ashwin Nevangune1, Dhiren Patel2, and M. Rajarajan3 1
Centre for Development of Advanced Computing, Mumbai, India
National Institute of Technology Surat, India
City University London, UK
Email: (saquib, ravibatra, ompal, email@example.com, firstname.lastname@example.org, R.Muttukrishnan@city.ac.uk
Abstract – Key management in SCADA (Supervisory Control And Data Acquisition) networks is a major challenge today. Due to resource constraints and latency requirements in such networks, it is infeasible to use traditional key management schemes such as RSA based PKC (Public key cryptography). In this paper, we propose a key management scheme, making use of Id-NIKDS (Id-based Non Interactive Key Distribution System) along with Polynomial based Pair -wise Key Establishment in a manner that the resulting scheme is efficient an d highly secure for large SCADA networks. The level of security provided is configurable and can vary from resilience against compromise of a few nodes to 100 % resilient against node compromise attacks. The protocol achieves energy efficiency by minimizin g the number of communications for key establishment, also provides flexibility for dynamic cluster formation after deployment, easy key updates, node addition and revocation. The scheme has been formulated considering the fact that the remote terminal uni ts & nodes are low range devices and most frequently communicate with only the nearby nodes so as to achieve admissible latencies. Small clusters may be formed in such networks, each responsible for collectively providing sensed data and controlling actuat ors in respective regions. We also present the analysis of the proposed scheme and show in what ways the proposed scheme is advantageous over the existing schemes.
Keywords – Key management, Key distribution, Communication security, Id -based encryption, Polynomial based key distribution, WSN
SCADA Communication Networks are one of the most
important technologies in 21st century. Currently SCADA
networks are being used in industrial applications such as
power distribution automation, factory automation and
process automation. Other applications include water and
waste water management, scientific exploration, monitoring
of nuclear power plants etc. Most of the researchers and
technology analysts believe that, in the near future, micro
sensors & actuators will be used everywhere: in our homes,
factories, bodies, animals, cars or rivers. As the usage of
these networks continues to increase, more will be the need
to integrate them to the traditional networks and in turn the security threats to the networks would increase greatly in
number as well as severity. In such a scenario, it becomes
essential to look for security solutions which provide ver y high level of security and are easy to manage for the user.
Along with these properties, the solution should be efficient in terms of resource consumption (power, computation and
memory consumptions), so that it is feasible to use with these resource constrained devices.
A large number of applications require computing devices
to form clusters which collectively perform a certain task
such as monitoring a subpart of a region or perform
calculations collectively, verify the accuracy of readings
among themselves, aggregate the results and forward the
final result to the required destination. Several Cluster -based communication protocols (e.g., ) have been proposed for
ad hoc networks in general and sensor networks in particular for various reasons including scalability and efficiency. We...
References: International Conference on System Sciences-Volume 8, page 8020,
Washington, DC, USA, 2000
Nieto: SKMA – A Key Management Architecture for SCADA
Systems: Fourth Australasian Information Security Workshop AISWNetSec (2006).
Networks, 10th ACM CCS '03, Washington D.C., October, 2003 .
Workshop on Cryptographic Hardware and Embedded Systems
(CHES 2004), pages 119–132, August 2004.
36, North Carolina State University, Department of Computer Science,
Theory, vol. 39, no. 5, pp. 1639–1646, 1993.
Computations on Curves with High-Degree Twists, Lecture Notes in
Computer Science, 2010, Volume 6056/2010, 224-242
Report 2009/155, 2009.
Report 2009/155, 2009.
characteristic fields. In ICISC 2004 , pages 168–181, 2005
Seminumerical Algorithms. Addison-Wesley, third edition, 1997.
Blake, G. Seroussi, and N. Smart, Eds. Cambridge Univ. Press, 2005,
Please join StudyMode to read the full document