Volume: 03, June 2014, Pages: 1048-1053

International Journal of Computing Algorithm

ISSN: 2278-2397

Secure Disclosure of Trespassing Mechanisms using Digital Signature Algorithm

V.VishwaPriya1, VijiVinod2
1

Research Scholar, Department of Computer Applications, Dr. M.G.R. Educational and Research
Institute University, Chennai

Professor, Department of Computer Applications, Dr. M.G.R. Educational and Research Institute
University, Chennai
E-mail: vishwapriya13@gmail.com, vijivinod@gmail.com

ABSTRACT
The migration to wireless network from wired network has been a global trend in the past few
decades. The mobility and scalability brought by wireless network made it possible in many
applications. Among all the contemporary wireless networks, Mobile Ad hoc NETwork (MOBILE ADHOC NETWORK) is one of the most important and unique applications. On the contrary to
traditional network architecture, MOBILE AD-HOC NETWORK does not require a fixed network
infrastructure; every single node works as both a transmitter and a receiver. Nodes communicate
directly with each other when they are both within the same communication range. It is crucial to
develop efficient intrusion-detection mechanisms to protect MOBILE AD-HOC NETWORK from
attacks. With the improvements of the technology and cut in hardware costs, we are witnessing a
current trend of expanding MOBILE AD-HOC NETWORKs into industrial application

I.Introduction
Wireless networks are always preferred since
the rst day of their invention. Owing to the
improved technology and reduced costs,
wireless networks have gained much more
preferences over wired networks in the past
few decades.Mobile Ad hoc NETwork
(MOBILE AD-HOC NETWORK) is a
collection of mobile nodes equipped with both
a wireless transmitter and a receiver that
communicate with each other via bidirectional
wireless
links
either
directly
or
indirectly.MOBILE AD-HOC NETWORK
solves this problem by allowing intermediate
parties to relay data transmissions. This is
achieved by dividing MOBILE AD-HOC
NETWORK into two types of networks,
namely, single-hop and multihop. In a singlehop network, all nodes within the same radio
range communicate directly with each other.
On the other hand, in a multihop network,
nodes rely on other intermediate nodes to
transmit if the destination node is out of their
radio range.

S.
Year
No.

Author

Work

2012

R. H.
Akbani,
S. Patel

A
Survey
on
Intrusion Detection
in Mobile Ad Hoc
Networks

2011

Ms.
Usha
Sakthiv
el

Introduced
a
powerful decision
support tool, data
mining, in the
context
of
knowledge
management

2010

Sunilku
mar S.
Manvia

Routing
Misbehavior
Detection
in
MANETs Using
2ACK

2007

Kejun
Liu

Detection
of
Routing
Misbehavior
in
mobile ad-hoc net.

II.Review of Literature
The review of literature for secure disclosure
for trespassing mobile ad-hoc network

Integrated Intelligent Research (IIR)

1048

Volume: 03, June 2014, Pages: 1048-1053

International Journal of Computing Algorithm

ISSN: 2278-2397

III. Role Play for Secure Disclosure and

Trespassing System

which has the result of interfering with the

conduct of tribal area .The unknown person
enter into our node theit will be suffer by
violation. Control the process without
affecting the person information it will allow
the node to the system this is called
trespassing mechanism

Misbehavior
(MRA):

Report

Authentication

The MRA scheme is designed to resolve the

weakness of watchdog with respect to the false
misbehavior report. In this source node checks
the alternate route to reach destination. Using
the generated path if the packet reaches the
destination then it is concluded as the false
report.
Digital Signature Validation:
In all the three parts of EAACK, namely,
ACK,
S-ACK,
and
MRA,
are
acknowledgment-based detection schemes.
They all rely on acknowledgment packets to
detect misbehaviors in the network. Thus, it is
extremely important to ensure that all
acknowledgment packets in EAACK are
authentic and untainted. Otherwise, if the
attackers are smart enough to forge
acknowledgment packets, all of the three
schemes will be vulnerable.
River-Shamir-Adleman(RSA):
The typically embed some form of structured,
randomized padding into the value before
encrypting it. This padding ensures that does
not fall into the range of insecure plaintexts,
and that a given message, once padded, will
encrypt to one of a large number of different
possible cipher texts. A cryptosystem is called
semantically secure if an attacker cannot
distinguish two encryptions from each other
even if the attacker knows (or has chosen) the
corresponding plaintexts
Secure Disclosure
Secure the information without hacking our
details by third person. Information security
specialists are almost always found in any
major area due to the nature and value of the
data within larger area. They are responsible
for keeping all of the technology within the
company secure from malicious cyber attacks
that often attempt to breach into critical private
information or gain control of the internal
systems. Secure a node without hacking the
information is a trusted node.

IV.Intrusion-Detection System in Mobile

Ad-Hoc Network in Secure Disclosure in
Trepassing
We assume that other nodes always cooperate
with each other to relay data. This assumption
leaves the attackers with the opportunities to
achieve significant impact on the network with
just one or two compromised nodes. To
address this problem, an INTRUSIONDETECTION SYSTEM should be added to
enhance the security level of MOBILE ADHOC NETWORKs. If MOBILE AD-HOC
NETWORK can detect the attackers as soon as
they enter the network, we will be able to
completely eliminate the potential damages
caused by compromised nodes at the first time.
MOBILE AD-HOC NETWORK PROCESS
DIGITAL

SIGNATURE:

Digital signature is a widely adopted approach

to ensure the authentication, integrity, and
non-repudiation of MOBILE AD-HOC
NETWORKs. Digital signature schemes can
be mainly divided into the following two
categories.
1) Digital signature with appendix: The
original message is required in the signature
verification algorithm (digital signature
algorithm (DSA)).
2) Digital signature with message recovery:
This type of scheme does not require any other
information besides the signature itself in the
verification process (RSA).

Trespassing Mechanism
The unauthorized entering into or upto tribal
premises or private property by any one person

Integrated Intelligent Research (IIR)

1049

Volume: 03, June 2014, Pages: 1048-1053

International Journal of Computing Algorithm

ISSN: 2278-2397

Secure Acknowledgment (S-ACK)

Step2:

In the S-ACK principle is to let every three

consecutive nodes work in a group to detect
misbehaving nodes. For every three
consecutive nodes in the route, the third node
is
required
to
send
an
S-ACK
acknowledgment packet to the first node. The
intention of introducing S-ACK mode is to
detect misbehaving nodes in the presence of
receiver collision or limited transmission
power.

The sender Vishwa needs to apply its own

private key Pr Vishwa on the computed
message digest d. The result is a signature
Vishwa, which is attached to message m and
Vishwas secret private key,

ARCHITECTURE
SIGNATURE

FOR

DIGITAL

SP
rVishwa(d)

= Sig Vishwa

Step3:
To ensure the validity of the digital signature,
the sender Vishwa is obliged to always keep
her private key PrVishwa as a secret without
revealing to anyone else. Otherwise, if the
attacker Eve gets this secret private key, she
can intercept the message and easily forge
malicious messages with Vishwas signature
and send them to Tamil. As these malicious
messages are digitally signed by Vishwa,
Tamil sees them as legit and authentic
messages from Vishwa. Next, Vishwa can
send a message m along with the signature
Vishwa to Tamil via an unsecured channel.
Tamil then computes the received message m
against the pre agreed hash function H to get
the message digest d. This process can be
generalized as,
H (m) = d

DIGITAL SIGNATURE VALIDATION:

All three parts of EAACK, namely, ACK, SACK, and MRA, are acknowledgment-based
detection schemes. They all rely on
acknowledgment
packets
to
detect
misbehaviors in the network. This scheme
ensures that all acknowledgment packets in
EAACK are authentic and untainted.
Otherwise, if the attackers are smart enough to
forge acknowledgment packets, all of the three
schemes will be vulnerable.

Tamil can verify the signature by applying

Vishwas public key PkVishwa on SigAlice,
by using
SP
kVishwa

(SigVishwa)
=
d
If d == d, then it is safe to claim that the
message m_ transmitted through an unsecured
channel is indeed sent from Vishwa and the
messages itself are intact.
DIGITAL SIGATURE PROCESS:

V. Digital Signature Algorithm:

The general flow of data communication with
digital signature is shown in above diagram.
Step1:
A fixed-length message digest is computed
through a pre agreed hash function H for every
message m. This process can be described as,
H (m) = d

Vishwa
Integrated Intelligent Research (IIR)

Tamil
1050

Volume: 03, June 2014, Pages: 1048-1053

International Journal of Computing Algorithm

ISSN: 2278-2397

The Security of RIVEST-SHAMIR-ADLEMAN

checking available service.For each operating

system different applications have to be used,
regardless they are doing exactly the same.All
malicious nodes to send out false misbehavior
report to the source node whenever it is
possible. This scenario setting is designed to
test
the
INTRUSION-DETECTION
SYSTEMs performance under the false
misbehavior report. The introduction of MRA
scheme
mainly
contributes
to
this
performance. EAACK is the only scheme that
is capable of detecting false misbehavior
report.We believe that this is because EAACK
is the only scheme which is capable of
detecting forged acknowledgment packets.

Four possible approaches to attacking the RSA

algorithm are:
Brute force: This involves trying all possible
private keys.
Mathematical attacks:
There are several approaches, all equivalent in
effort to factoring the product of two primes.
Timing attacks: These depend on the running
time of the decryption algorithm.
Chosen cipher text attacks:
This type of attack exploits properties of the
RSA algorithm. The defense against the bruteforce approach is the same for RSA as for
other cryptosystems, namely, to use a large
key space. Thus, the larger the number of
bitsin d, the better. However, because the
calculations involved, both in key generation
and in encryption/ decryption, are complex,
the larger the size of the key, the slower the
system will run.
Hash Function using Cryptography:
Plain text not recoverable from cipher text.
Hash function
Plain text

Cipher text

In hash function it will inserting the

nodes into budgets.

The process should be in correct way.

After finishing the process it send the

node to proper channel
Plain Text:
The text should be clean and clear understand
of the sender the it will encrypt after sending
the plain text.
Cipher text:
This text will change our information to secret
code then it will convert to bytes and send to
destination, when it reach destination it will
convert to cipher text to plain text.
Advantages and Limitations
Network Intrusion Detection Systems gain
access to network traffic by connecting to a
hub, network switch configured for port
mirroring, or network tap.To minimize this
effort a specialized tool securing network and

Integrated Intelligent Research (IIR)

VI Result
Process Input
Client Request is the sample input of the
project to get responses from the server
without disturbance of malicious nodes. After
given client request we have to check the
trusted nodes to send the request to server.
Process Output
Client Responses is the sample output of the
project to receive the datas from server
without disturbance of malicious nodes. A
server gets the request from client and its
verified the node and message without reached
without disturbance of the hackers.
VII Analysis
Using an algorithm to implement get best
result
ONE PACKET DELIVERY RATIO
PDR

Malicious
node 0%

Malicious
node 10%

Malicious
node 20%

DSI

.82

.73

WATC
H DOG

.83

.77

2ACK

.97

.96

AACK

.96

.96

EAACK

.96

.97

.96

.97

(DSA)
EAACK
(RSA)

1051

Volume: 03, June 2014, Pages: 1048-1053

International Journal of Computing Algorithm

ISSN: 2278-2397

ANALYSIS FOR PDR

VIII CONCLUSION:

ONE ROUTING OVERHEAD

A more efficient intrusion detection system is

required. Among existing distributed intrusion
detection algorithms, anomaly detection
systems are more economic due to distributed
nature of ad hoc network. To give clear view
about EAACK we have presented details and
implementation
about
EAACK.
Our
mechanism is able to handle both detect
malicious nodes with the presence of false
misbehavior
report
and
forged
acknowledgment packets. Packet-dropping
attack has always been a major threat to the
security in MOBILE AD-HOC NETWORKs.
In this research paper, we have proposed a
novel INTRUSION-DETECTION SYSTEM
named EAACK protocol specially designed
for MOBILE AD-HOC NETWORKs and
compared it against other popular mechanisms
in different scenarios through simulations. The
results demonstrated positive performances
against Watchdog, TWOACK, and AACK in
the cases of receiver collision, limited
transmission power, and false misbehavior
report.

R O/H

Malicio
us node
0%

Malicious
node 10%

Malicious
node 20%

DSI

.02

.023

.023

WATCH
DOG

.02

.025

.025

2ACK

.18

.4

.43

AACK

.03

.23

.32

EAACK

.15

.28

.35

We plan to investigate the following issues in

our future research:

.16

.3

.37

1)
Possibilities
of
adopting
hybrid
cryptography techniques to further reduce the
network overhead caused by digital signature.

(DSA)
EAACK
(RSA)

2) Examine the possibilities of adopting a key

exchange mechanism to eliminate the
requirement of pre-distributed keys.

ANALYSIS FOR R O/H

0.5
0.45
0.4
0.35
0.3
0.25
0.2
0.15
0.1
0.05
0

DSI
WATCH
DOG

3) Testing the performance of EAACK in real

network environment instead of software
simulation.

2ACK

4)
Possibilities of implementing hybrid
cryptography techniques to further reduce the
network overhead caused by security.

AACK

IX REFERENCES:

EAACK(DS
A)
EAACK(RSA
)

1. K. Al Agha, M.-H. Bertin, T. Dang, A.

Guitton, P. Minet, T. Val, and J.-B. Viollet,
Which wireless technology for industrial
wireless sensor networks? The development of
OCARI technol, IEEE Trans. Ind. Electron.,
vol. 56, no. 10, pp. 42664278, Oct. 2009.
2. R. Akbani, T. Korkmaz, and G. V. S. Raju,
Mobile Ad hoc Network Security, in Lecture

Integrated Intelligent Research (IIR)

1052

Volume: 03, June 2014, Pages: 1048-1053

International Journal of Computing Algorithm

ISSN: 2278-2397

Notes in Electrical Engineering, vol. 127. New

York: Springer-Verlag, 2012, pp. 659666.
3. R. H. Akbani, S. Patel, and D. C. Jinwala,
DoS attacks in mobile ad hoc networks: A
survey, in Proc. 2nd Int. Meeting ACCT,
Rohtak, Haryana, India, 2012, pp. 535541.
4. T. Anantvalee and J. Wu, A Survey on
Intrusion Detection in Mobile Ad Hoc
Networks, in Wireless/Mobile Security. New
York: Springer- Verlag, 2008.
5. L. Buttyan and J. P. Hubaux, Security and
Cooperation
in
Wireless
Networks.
Cambridge, U.K.: Cambridge Univ. Press,
Aug. 2007.

Integrated Intelligent Research (IIR)

1053