International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org

Volume 3, Issue 6, November-December 2014

ISSN 2278-6856

A Digital Certification Technique to Message

Authentication and Source Privacy in Wireless
Sensor Networks
Sri Divya Chinta1, SatyanarayanaGandi2AndAmarendraKothalanka 3
1

Department of computer science &technology

Dadi Institute of Engineering Technology,NH-5, Anakapalle
2

Associate Professor &Head of Information Technology

Dadi Institute of Engineering Technology,NH-5, Anakapalle
3

Professor &Head of the Computer Science& Engineering

Dadi Institute of Engineering &Technology,NH-5, Anakapalle

Abstract
Message authentication is the one of the most effective ways
to unauthorized and corrupted messages from being
forwarded in wireless sensor networks. For this reason so
many techniques are available for authentication message in
the networks. This paper basically three concepts i.e, secret
key generation, message authentication,message encryption
and decryption. First one is used for generating secret key for
message encryption decryption. After completion of genera ting secret key,we are using digital certification technique for
message authentication. In this user1 generating signature for
that message and sent to user2.After receiving signature from
user1, user2 will verify his/her the message is authen -ticated
or not. Before sending signature user1 encrypt message by
using binary xor operation technique and send to user2. User2
can decrypt the message after successful comple -tion of
authentication process. By providing this concept we can
provide more computational and communication of proposed
system.

Keywords:-secret key generation, message authentica tionmessage encryption and decryption,digitalcertifica

-tion technique.

1.Introduction
In peer to peer networks for the security systems the
traditional approaches uses key distribution methods such
as cryptographic systems. There is increase in usage,
bandwidth and network applications is required novel
ideas. In many different key distribution methods there is
pair of users such as session keys. The general idea is
purely secure methods which consist of distributing initial
keys to users that is the possible group of users spreads a
common key. In conferences generally the users
symmetric encryption it must share common key. In the
key distribution methods the common keys of secure
communication in conference. The data is generated and
distributed by trusted server whichare mainly active at the
distributive stage.Given the high complexity of such a
distribution mechanism, a natural step is to trade
complexity for security. We may still require that keys are
perfectly secure, but only with respect to an adversary
controlling coalitions of a limited size. This novel
approach was initiated by Blomfor the case of session keys

Volume 3, Issue 6, November-December 2014

(other related schemes are given. We are motivated by

Bloms (somewhat forgotten) pioneering work. We
consider key distribution for dyna -mic conferences and
study the theory and applications of such systems. Our
scheme has two parameters: t, the size of the conference
(group),and the size of adversary coalitions. Another
characteristic of such schemes is whether they are
interactive or non-interactive.
secret key generation
message authentication
message encryption and decryption
digital certification technique
Key generation is the process of generating keys. A key is
used to encrypt and decrypt whatever data is being
encrypted/decrypted.Moderncryptographic
systemsincludesymmetric-keyalgorithms
(such
as DES and AES)and public-keyalgorithms (such
as RSA). Symmetric-key algorithms use a single shared
key; keeping data secret requires keeping this key secret.
Public-key algorithms use a public key and a private key.
The public key is made available to anyone (often by
means of adigital certificate). A sender encrypts data with
the publickey; only the holder of the private key can
decrypt this data.Since public-key algorithms tend to be
much slower than symmetric-key algorithms, modern
systems such as TLS and SSH use a combination of the
two: one party receives the other's public key, and encrypts
a small piece of data (either a symmetric key or some data
used to generate it).
Message Authentication is a short piece of information
used to authenticate a message and to provide integrity
and authenticity assurances on the message. Integrity
assurances detect accidental and intentional message
changes, while authenticity assurances affirm the
message's origin.

Page 127

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 3, Issue 6, November-December 2014

ISSN 2278-6856

A digital certificate contains information that identifies

the certificates owner and their public key. The certificate
also has information that identifies its issuer i.e. the
Certified Authority (CA) that issued the certificate. The
CA digitally signs each certificate with its own private
key. To do this, the CA generates a message digest from
the certificate, encrypts the digest with its private key and
includes the digital signature as part of the certificate.
Clients can use the message digest and the CAs public
key to verify the certificates integrity. If a certificate
becomes tampered, its message digest will not match the
digest in the CAs digital signature.
Message Encryption and Decryption
Encryption is the process of translating plain text data
(plaintext) into something that appears to be random and
meaningless(ciphertext). Decryption is the process of
converting ciphertext back to plaintext.To encrypt more
than a small amount of data, symmetric encryption is
used. A symmetric key is used during both the encryption
and decryption processes. To decrypt a particular piece of
ciphertext, the key that was used to encrypt the data must
be used.
Digital certificate technique is an attachment to an
electronic message used for security purposes. It is the
digital equivalent of a physical or paper certificate. Just as
a physical license serves to identify an individual and
show what they are allowed to do e.g. a drivers license
identifies someone who can legally drive, a digital
certificate is presented to prove your identity and the right
you have to access certain information on the internet.It is
used to ensure that when data passes from one computer to
another over a network, the data will not be able to be read
by an unauthorized entity and for extra security measures,
the data will be checked by the receiving computer using a
digital certificate to verify the integrity of the data and to
ensure that it was not altered in transit.When data is sent
through a network, there is usually a risk that the message
may be intercepted, read and even modified by an
unauthorized person. To prevent this, data is usually
encrypted to prevent it from being read and understood
until it is decrypted. This is where digital certificatecome.
Digital certificates use a cryptographic technology called
public-key cryptography to sign data and to verify the
integrity of the certificate itself.Public key cryptography is
a system based on pairs of keys called public key and
private key. Apublic key is used to encrypt data and its
corresponding private key is used to decrypt the data.

Volume 3, Issue 6, November-December 2014

2.Existing System
Methods for key pre-distribution provides nodes in a huge
network to achieve on pairwise secret keys. At the time of
deployment a global authority reads and loads some secret
data Sd into each node ni,for i {1, . . . , N} and N is the
network size. By taking two nodes i and j can achieve on a
shared key ski,j of size using their secret information.In
Probabilistic methods where any two nodes are capable to
calculate a shared key with more probability and also have
been assumed but will not take concern us here. The main
aim is to offer resilience as large as possible and where a
method has resilience t if an adversary who consists t
nodes I = {i1, . . . , it} is not able to define any information
about the shared key ski,j for any i, j I. The efficient
assumptions needs calculation of the shared keys to be
quick performance and thus ruling out of public key
methods, and explanation is that the storage that is the
size of the keying information si should be minimized.One
simple approach is for all nodes to share a single key k
that is the set si = k for all I that is used also as the pair
wise key for any pair of nodes. While having minimal
storage this scheme has resilience t = 0 since it is
completely broken after only one node is compromised. A
second trivial approach is for each pair of nodes to store
an independent key. This has optimal resilience t = N, but
the storage requirement of (N 1) per node is
unacceptably high.There are two main methods in
distribution of keys to reduce the complexity of the public
key distributions in authentication servers. There are so
many researches are done for secure key generation and
distribution methods for shared keys. In another method
that is pioneering the key generation methods. Which is
calculated for very seemingly negated results. In another
methods such as innovated methods is a method which
isbased on ID that is predated the formatted definition
given by several researchers. Some other authors extended
the works on symmetric and asymmetric key distribution
methods in way of explanation. Some authors show that
information theoretic resilience to t corruptions can be
achieved with (t+1) bits of secret information stored per
node; moreover, this is optimal if information-theoretic
security is desired. Let F be a field of size 2 > N. To
achieve resilience t using the scheme the authority chooses
a random symmetric, bivariate polynomial F F[x, y] of
degree t in each variable as the master secret key; a node
with identity i F is given the unvaried polynomial si(y) =
Page 128

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 3, Issue 6, November-December 2014
F(i, y) as its secret information. The shared key ki,j
between nodes i, j is si(j) = F(i, j) = sj(i), which both nodes
can compute (since F is symmetric). It is not hard to see
that an attacker who compromises atmost t nodes learns
no information about any key that is shared between two
non-compromised nodes.However, an attacker who
compromises t + 1 nodes can use interpolation to recover
the master polynomial and thus obtain all the keys in the
system.

3.Proposed System
Message authentication plays a key role in unauthorized
and corrupted messages from being forwarded in networks
to save the precious sensor energy. For this reason, many
authentication schemes have been proposed in literature to
provide message authenticity and integrity verification for
wireless sensor networks. In this paper we proposed
message authentication and privacy message in a wireless
sensor network. By performing this operation we are
proposed three concepts.
Authentication of Message
User1 Calculate the SA =rSAA modp and send values m!A,
rA, SA to User2 then
If gmA_= yrAA SA mod p authentication fails.
Otherwise, User1randomly selects vB[1, p 2]and
calculates cB= rvB A mod p and send to Alice
Calculates KA,B= csA
B mod p,KtA,B=
D(KA,B)Randomly selects vA[1, p 2]
Calculates cA= rvA
A mod p and Ack= h(KtA,B, cB_cA) and sends ack value
and CA to User2
Calculates the value KB,A= SvB A mod p KtB,A=
D(KB,A)
If Ack= h(KtB,A, cB_cA)
thenUser1is authenticated and cvA B = cvB
A mod p
is the established key.
otherwise, the authentication fails
Now both User1and User2 are in Authentication with
Each Other.
secret key generation
User1
Calculates SA = gsA
A mod n mA, SSK(hHK(m_,
s_)), SA, hHK(m_, s_)
And sends it to User2
Verifies signature S(hHK(m_, s_)) of hHK(m_s_), and
hHK(mA, SA) = hHK(m_, s_))
The program ends if the authentication fails.Otherwise, it
randomly selects vB[n 1], andcalculatescB= gvBmodn
and sends the CB to the Alice
Calculates KA,B= csA B mod n,K_ A,B = D(KA,B)
Then it randomly selects an integer vA[1, n
1]calculates cA= gvAmodn, and Ack= h(KtA,B, cB_cA)
and sends Ack and CA to User2
Computes KB,A= SvB A mod p KtB,A= D(KB,A)
If Ack= h(KtB,A, cB_cA),
thenAis authenticatedand cvA B = cvB
A mod n is the established key.Otherwise, the
authentication fails.

ISSN 2278-6856

PT=plain Text
1.Enter Some Character in the plain text in between as a
random
character
and
add
them
for
every three character as a duplicate character.
2. Change the Plain text which is added with random
character into ASCII codes.
3. Now convert into Binary format from ASCII codes.
4. Complement of the plain text.
5. Apply Exclusive OR (XOR) for both characters of plain
text and selected series
6. Convert the result after Xor into decimal values. Now
you will get the cipher text.
Decryption
1. Convert the cipher text into Binary format.
2. Apply Exclusive OR (XOR) operation between cipher
text and key.
3. Select the series and convert it into the binary format
(the series must be same in both encryption side and
decryption side).
4. Get complement of the result of step3.
5. Convert the result from binary to decimal format.
6. Now you can get the plaintext

4.Conclusion
The data transferring plays an important part in our day to
day life but the transfer may not be secure so to prevent
this we follow the technique of authentication and for the
communication key generation algorithm is used.In this
we are using another technique for generation of secret
key for the encryption and decryption of transmitted data.
For the generation key we are using binary xor operation
technique equation. By providing those technique we are
provide more security and efficiency for transferring data.

References
[1] R. Bird, I. Gopal, A. Herzberg, P. Jansen, S. Kutten,
R. Molva and M. Yung SystematicDesign of TwoParty Authentication, Advances in Cryptology:
Proceedingsof Crypto 91, Lecture Notes in Computer
Science, vol. 576, Springer-Verlag, Berlin,1991.
[2] R. Blom, An Optimal Class of Symmetric Key
Genemtion Systems, Advances inCryptology:
Proceedings of Eurocrypt 84, Lecture Notes in
Computer Science, vol.209, Springer-Verlag, Berlin,
1984, pp. 335-338.
[3] E. Brickell, P.J. Lee and Y. Yacobi, Secure Audio
Conferencing, Advances in Cryptology: Proceedings
of Crypto 87, Lecture Notes in Computer Science, vol.
239,Springer-Verlag, Berlin, 1987, pp. 418-426.
[4] I. Csiszk and J. Kcmer, Information Theory. Coding
theorems for discrete memory less systems, Academic
Press, 1981.
[5] W. Diffie and M.E. Hellman, New Direction in
Cryptography, IEEE Transactionon Information
Theory, vol. 22, no. 6, December 1976, pp. 644-654.
[6] M.J. Fischer, M.S. Paterson and C. Rackoff, Secure
Bit Transmission Using aRandom Deal of Cards, in
Distributed Computing and Cryptography, AMS,
1991,

Encryption

Volume 3, Issue 6, November-December 2014

Page 129

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 3, Issue 6, November-December 2014

ISSN 2278-6856

[7] M.J. Fischer and R.N. Wright, Multiparty Secret Key

Exchange Using a RandomDeal of Cards, Advances
in Cryptology: Proceedings of Crypto 91, Lecture
Notesin Computer Science, vol. 576, Springer-Verlag,
Berlin, 1991, pp. 141-155.
[8] W. Fumy and M. Munzert, A Modular Approach to
Key
Distribution,
Advancesin
Cryptology:
Proceedings of Crypto 90, Lecture Notes in Computer
Science, vol. 537, Springer-Vedag, Berlin, 1990, pp.
274-283.
[9] R. G. Gallager, information Theory and Reliable
Communications, John Wiley &Sons, New York, NY,
1968.
[10] L. Gong and D.J. Wheeler, AMatris Key-Distribution
Scheme, Journal of Cryptography.

Volume 3, Issue 6, November-December 2014

Page 130