Professional Documents
Culture Documents
1.1 Purpose of The Project:: "A Routing-Driven Public-Key Cryptosystem Based Key Management Scheme For A Sensor Network"
1.1 Purpose of The Project:: "A Routing-Driven Public-Key Cryptosystem Based Key Management Scheme For A Sensor Network"
INTRODUCTION
1.1 Purpose of the project:
This project proposes a novel routing-driven RSA algorithm based key management
scheme for a sensor network. This establishes shared keys only for those neighboring
sensors that communicate with each other rather establishing shared keys for all pairs of
neighboring sensors .This project also proposed how user authentication and session key
verification can be done in a single step process at the receiving end.
1.2 Motivation:
As the wireless technologies has become the need of an hour, Securing sensor networks
has received much attention in the last few years and as so many research works are
going on in order to achieve stronger security and to reduce overhead to the maximum
possible extent on wireless networks created a strong interest in me to do some work
concerning security issues on wireless sensor networks.
sensor networks [1],[2]and [4], where all sensor nodes have the same capabilities.
An Existing key management schemes require a large storage space for key pre-
distribution [4] and are not suitable for small sensor nodes.
Most existing key management schemes try to establish shared keys for all pairs
of neighbor sensors, no matter whether these nodes communicate with each other
Page 1
Page 2
LITERATURE SURVEY
The following works were carried out by specific persons in the area of wireless sensor
networks:
Page 3
using of DCK limits the impact of sensor nodes to the attacked cluster but not
completely eliminated.
H. Chan, A. Perrig, and D. Song, Random key pre-distribution schemes for sensor
networks-(2003)
They presented three new mechanisms for key establishment using the framework of predistributing a random set of keys to each node because asymmetric key cryptosystems are
unsuitable for use in resource constrained sensor nodes and the nodes could be physically
compromised by an adversary [2]. First, in the q-composite keys scheme, they trade off
the unlikeliest of a large-scale network attack in order to significantly strengthen random
key pre-distribution's strength against smaller-scale attacks. Second, in the multipathreinforcement scheme, they showed how to strengthen the security between any two
nodes by leveraging the security of other links. Finally, the random-pair wise keys
scheme, which perfectly preserves the secrecy of the rest of the network when any node
is captured, and also enables node-to-node authentication.
Page 4
Page 5
Yong Ma, Siddharth Dala1, Majd Alwan, James Aylor, ROP: A Resource Oriented
Protocol for Heterogeneous Sensor Networks-(2007)
They described a network model that was adaptively formed according to the resources
of its members. A protocol named Resource Oriented Protocol (ROP) was developed to
create the network model [6]. This protocol entails two phases: topology formation and
topology update. In the first topology formation phase, sensors report their characteristics
of available resources, and then local cluster heads aggregate these reports and send to
sensors with largest resource capacity (LRC). After this step, based on the reports, LRCs
decide the topology and appoint cluster heads from top to bottom levels. In the topology
update phase, sensors maintain their route cache reactively. They also pointed ROP that
energy efficiency cannot always result in longer system lifetime especially in
heterogeneous networks. Instead, balancing resources among sensors and saving energy
for those more resource-constrained sensors are greatly helpful in lengthening the overall
system lifetime architecture. The targeted areas of applications include tele-health
applications, health care facilities and other care settings, in addition to more secure
automation applications.
Drawbacks: Here, the simulation, emulation and deployment process of the proposed
protocol is difficult.
Page 6
Page 7
Sk. Md. Mizanur Rahman, Nidal Nasser, Kassem Saleh, Identity and Pairing-based
Secure Key Management Scheme for Heterogeneous Sensor Networks-(2008)
Key
management
poses
main
concern
for
all
communicate
pairs
with
of
neighbor sensors,
no
matter
whether
these
nodes
heterogeneous
based on pairing identity based encryption (IBE). The proposed scheme reduces
the key spaces of the nodes, in fact nodes do not need to store any key of the other nodes
rather it computes secret sharing key by using pairing and IBE properties. Security
analysis shows it also robust
such
as replay
attack,
Page 8
between sensor nodes[12]. It is required to agree upon a common key before encrypting
the messages. The key management task is challenging due to resource constrained
nature of WSN. They were proposed a tree based key management scheme for
heterogeneous sensor networks. The scheme supports revocation of the compromised
nodes and the energy efficient re-keying.
Drawbacks: This scheme lacks in efficient storage for group keying in IEEE 802.15.4.
This method was difficult to set up securely. Cluster formation information is application
dependent.
of
efficient
of
hardware
manufacturing
technology
and
the
Page 9
Page 10
Advantages:
3.3 Cryptography:
All aspects such as security and integrity of information have been aided by rapid
advances in communication technology and networking. Hackers can utilize both active
and passive methods to overload networks and alter data. To provide Security and
integrity for information/data Cryptography came into existence.
Definition: Writing the messages in secret way is called cryptography [24].
3.3.1 Security:
Security is mainly of three types, namely;
1. Computer Security
2. Information Security
3. Network Security
Dept. of P.G Studies,VTU Belgaum
Page 11
Delaying messages.
Access control
Authentication
Encryption
Intrusion detection
Page 12
Page 13
Key One
Intruder
Key Two
Page 14
Message
Sender
Cipher Text
Channel
Cipher Text
Fig 3.1 Crypto System Model for encryption and decryption
Recipient Messag
e
Sym Key
Intruder
Sym Key
Sender
Recipient Messag
Cipher Text
Channel
Cipher Text
Fig 3.2 Model for Encryption and decryption with Symmetric Key Algorithm e
Message
Page 15
Public key
Intruder
Private Key
Sender
Recipient Messag
Cipher Text
Channel
Cipher Text
Fig: 3.3 Model for Encryption and decryption with Asymmetric Key Algorithm e
Message
Page 16
Encryption
Algorithm
Encrypted
message or
Cipher text
Page 17
Decryption
Algorithm
Decrypted
message or
Plain text
Private Key
known only to
receiver
Page 18
Page 19
Figure 3.6 sharing the sensitive data in network using ECC algorithm
In this architecture the user both sender and receiver generates the private and public
keys. While communicating both encrypts the data using others public key and decrypts
using their own private key.
Page 20
Page 21
Page 22
Pentium IV
RAM
512 MB
Hard Disk
20 GB
Page 23
Java, Swing
Operating System
WindowsXP
Data Base
MySQL
Page 24
SYSTEM DESIGN
Design and Testing are the actual process of producing a solution according to the
specification derived from the analysis stage.
SRC
Node
Plaintext
Encryption process
Cipher text
Cipher text
DESNod
e
Decryption process
Plaintext
Dept. of P.G Studies,VTU Belgaum
Page 25
Page 26
Node
Details
Cluster
Head
Node
Key
Details
Communication
Node1
Key
Generation
Using RSA
Communication
Node2
Sink
Page 27
Login
Cluster Head
Key_Reqest
client1
Request Server
Page 28
Cluster Head :
Node : (Node)
(Cluster Head)
Rigitration
Sink
Communication
Node1...
Communication
Node2
Accept
Path Request
Send Pat h
Key Request
Key Distribute
Forward Data
Forward
Forward
Page 29
4: Send Path
Cluster
Head
2: Accept
3: Path Request
6: Key Distribute
1: Rigitration
Node
7: Forward Data
5: Key Request
Communicati
on Node1
8: Forward
Communicati
on Node2
Sink
9: Forward
Page 30
Cluster
Head
Node
Key
Generation
Node
Registration
Key
Distribution
Data
Forwarding
Sink
Page 31
Page 32
Authenticat
ion
Cluster
Formation
Key_Requ
est
Key
Generation
Key
Distribution
Data
Forwarding
SYSTEM IMPLEMENTATION
Dept. of P.G Studies,VTU Belgaum
Page 33
Cluster Formation
Routing in Sensor Networks(SNs)
Key Generation and distribution of keys
Encryption & Decryption
Page 34
Page 35
Page 36
With the use of Quantum cryptography, the two communicating parties can be
able to detect the presence of any third party trying to gain knowledge of the key.
Page 37
Prepare and measure protocols (Calculate the amount of information that has been
intercepted).
Performing a measurement on one object affects the other. If an entangled pair of objects
is shared between two parties(sensors), any one intercepting either object alters the
overall system revealing the presence of the third party and amount of information they
have gained.
6.3.3 Design Aspects:
TC(Trusted Center)-Cluster header and participant synchronize their polarization basis
according to pre-shared secret key. During session key distribution, the pre-shared secret
key together with random string are used to produce another encryption key to encipher
the session key. By this, a receiver will not receive the same polarization qu-bits even if
identical session key is retransmitted. Hence, the secrecy of pre-shared secret key can be
preserved and thus this secret key can be long term and repeatedly used between TC and
participant. Due to combined use of classical cryptographic techniques over quantum
channel, a receiver can authenticate user identity, verify the correctness and freshness of
the session key and detect the presence of eavesdroppers.
Page 38
Truste
d
center
Secret
Key
Sende
r
Level1
Key Generation
Secret
Key
Sessio
n Key
Encrypted Msg by
Session Key
Receiv
er
Page 39
Sec Key
Random String
Generation
Qubit Generation
Sessio
n Key
Gener
ationo
nonon
Session key
Page 40
Start
Perform Encryption
If
Encrypte
d
No
Exit
Yes
Stop
Page 41
Start
Stop
Fig: 6.5 Data Decryption process
Page 42
Page 43
Page 44
Page 45
Page 46
Page 47
Page 48
Page 49
Page 50
Page 51
Page 52
Page 53
Page 54
Page 55
Page 56
REFERENCES
[1] L. Eschenauer and V.D.Gligor, A key management scheme for distributed sensor
networks, Ninth ACM Conference on Computer and Communication Security,
November 2002.
Dept. of P.G Studies,VTU Belgaum
Page 57
Sensor
Network
Key
Distribution
Scheme
Nygard,
Global
[8] Xiaojiang Du, Hsiao-Hwa Chen, Yang Xiao, Mohsen Guizani, A Pseudo-Random
Function based Key Management Scheme for Heterogeneous Sensor Networks Global
Telecommunications
Conference,
GLOBECOM
'07.
IEEE
Nov
2007.
[9] Qing Yang, Qiaoliang Li, Sujun Li, An Efficient Key Management Scheme for
Heterogeneous Sensor Networks Networks, ICON 2008. 16th IEEE International
Conference on Dec 2008.
Page 58
Page 59
Page 60