SECURE FOR HANDHELD DEVICES

AGAINST MALICIOUS SOFTWARE

IN MOBILE NETWORKS
Guided by,
Mr.S.Kannudurai,
Assistant Professor,
Department Of CSE.

Presented by,
K.Surya,
951513405019.

ABSTRACT
From the aspect of malware, since some sophisticated malware
that can bypass the signature detection would emerge with the
development of the defense system, new defense mechanisms
will be required.
At the same time, our work considers the case of OS-targeting
malware. Although most of the current existing malware is OS
targeted, cross-OS malware will emerge and propagate in the
near future.
How to efficiently deploy the defense system with the
consideration of cross-OS malware is another important
problem

INTRODUCTION
Defense system distribute the optimal signature using special
nodes.
To deploy an efficient defense system to help infected nodes
to recover and prevent healthy nodes from further infection.
Avoiding whole network unnecessary redundancy using
distribute signatures.
The efficiency of our defense scheme in reducing the amount
of infected nodes in the system.
Security and authentication mechanisms should be considered.

EXISTING SYSTEM
Develop a simulation and analytic model for Bluetooth
worms, and show that mobility has a significant impact on the
propagation dynamics.
The former one has the limitations that signature flooding
costs too much and the local view of each node constrains the
global optimal solution.
Not using design of defence System to detect malware. Could
not optimally distribute the signatures.

PROPOSED SYSTEM
To deploy an efficient defense system to help infected nodes
to recover and prevent healthy nodes from further infection.
Introduce an optimal distributed solution to efficiently avoid
malware spreading and to help infected nodes to recover.
To encounter and diffuse the detected malware using digest
algorithm
It helps us to evaluate the malware free transmission
between nodes even helper nodes are also present

MODULES
Node Creation
Helper Creation
Distribute Signatures
Malware encounter and Digest

MODULES
DESCRIPTION

Node Creation:
Create a mobile networks including a number of nodes.
First defined number of nodes and also defined source node,
destination node, intermediate nodes.
The network contains heterogeneous devices as nodes.
Mobile nodes are more efficient to disseminate content and
information in the network.

Helper Node Formation:

Helper nodes are referred to as special nodes.
This node is used to focusing the all nodes.
Helper node is intermediate node for every nodes in the
network.
File can be transmit from source node to destination node
through the help of helpers node.

Distribute Signatures:
This module is used to analyzing the malware nodes through
passing the signatures.
This signatures distributed for every intermediate node from
source node to destination node with the help of the special
node.
The special node is the helper node. Helper node distribute the
signatures for every intermediate nodes based on the file
contents key will be generated.

Malware Encounter and Digest Malwares:

Detect the malware with the help of a content based
signatures. Exponential parameter obtained from the contact
records between helpers and general nodes.
Every intermediate node receive the signatures from helper
node and which intermediate nodes receiving the signatures
twice.
This time to detecting the malware spreading nodes and
recovering the infected nodes.

LITERATURE SURVEY

1. Identity-Based Aggregate Signatures

The main motivation of aggregate signatures is compactness.
However, while the aggregate signature itself may be compact,
aggregate signature verification might require potentially lengthy
additional information namely, the (at most) n distinct signer public
keys and the (at most) n distinct messages being signed.
This paper initiates a line of research whose ultimate objective is to
find a signature scheme in which the total information needed to
verify is minimized.
In particular, the verification information should preferably be as
close as possible to the theoretical minimum: the complexity of
describing which signer(s) signed what message(s).

2. The Sybil Attack in Sensor Networks:

Analysis & Defenses
This is the first paper that systematically analyzes the Sybil attack
and its defenses in sensor networks.
They introduce taxonomy of the different forms of the Sybil attack
as it applies to wireless sensor networks.
They analyze how an attacker can use the different types of the
Sybil attack to perturb or compromise several sensor network
protocols.
They propose several new defenses against the Sybil attack,
including radio resource testing, key validation for random key predistribution, position verification, and registration.
They also present a quantitative evaluation for the random key predistribution approach showing that it is robust to compromised
nodes.

3. Secure Friend Discovery in Mobile Social

Networks
First, they identify a range of potential attacks against friend
discovery by analyzing real traces.
Second, they develop a novel solution for secure proximity
estimation, which allows users to identify potential friends by
computing social proximity in a privacy-preserving manner.
A distinctive feature of their solution is that it provides both privacy
and verifiability, which are frequently at odds in secure multiparty
computation.
Third, they demonstrate the feasibility and effectiveness of their
approaches using real implementation on smartphones and show it is
efficient in terms of both computation time and power consumption.