This is a project to distribute the One Time Password in the Online Banking applications securely using a QR(Quick Response) code Mechanism.

1. A Novel Approach for Trust
Management in Peer-Peer Network
System
Guided By:
Dr. A.V.K.SHANTHI M.Sc., M.Phill., Ph.D
Presented by:
SNEHITH PANGULURI (3011211)
TUMMALA SATYAKAMA (3011298)

2. Abstract
 Malicious attacks are a major problem in peer to peer networks. To overcome this
problem, trust relations are shared with the peers in proximity within the network.
The trust relationship is made based upon the local level information, but not the
global level information. Distributed algorithm is used to make trust relations from
the past transactions and recommendations.
 SORT provides services and giving recommendation to the peers using two
different metrics. They are service and recommendation metrics. The service metric
is used to give the service to the peers and the recommendation metric is used to
give the recommendations to the system. The interaction and recommendations are
evaluated based on the recentness, importance and peer satisfaction parameters. It
evaluates the recommendations for finding the trustworthiness of recommendation
and confidence of the recommendation.
 This work deals with the issues of network security and attacks. By implementing
the SORT model, malicious activity on peer to peer networks is reduced. Trust and
reputation information that is passed across the peers in the network is used as the
main factor to find the peers that are trustworthy.

3. Objective
 The proposed system, Self-Organizing Trust model (SORT) that aims to decrease
malicious activity in a P2P system by establishing trust relations among peers in
their proximity.
 The final node in the chain of mimics acts as the Network Address Translator(NAT)
for the transport layer, and sends the packet to its final destination through the
Internet. This final node must know the content and destination, but has no
information about the sender.
 Web Services Trust Language brings trust management into the environment of web
services. The core proposition remains generally unchanged: the Web Service
(verifier) is accepting a request if the request contains proofs of credentials that
satisfy the a Web Service.

4. Introduction
 PEER-PEER:- It’s a decentralized network, in which all the in the network
acts as client and server.
 REPUTATION:- A peer’s trust in another peer based on the experiences of
other peers.
 TRUST:- A peer’s trust in other peers based on his own past experience.
 SORT:- Self-Organizing Trust model (SORT) that aims to decrease malicious
activity in a P2P system by establishing trust relations among peers in their
proximity.
 NS:- Network Simulator, A package of tools that simulates behavior of
networks. NS are a discrete event simulator targeted at networking
research.

5. Sl.
No
Year Researchers Discussions Description
1 2006 R. Zhou, K. Hwang,
and M. Cai,
“Gossiptrust
Fast Reputation Aggregation in Peer-to-
Peer Networks
In peer-to-peer (P2P) networks,
reputation aggregation and ranking
are the most time-consuming and
space-demanding operations.
2 2007 A. Jøsang, R. Ismail,
and C. Boyd
A Survey of Trust and Reputation
Systems for Online Service Provision
Trust and reputation systems
represent a significant trend in
decision support for Internet
mediated service provision.
3 2008 H. Yu, M. Kaminsky,
P.B. Gibbons, and A.
Flaxman
Sybil guard: Defending against Sybil
Attacks via Social Networks
Peer-to-peer and other
decentralized, distributed systems
are known to be particularly
vulnerable to Sybil attacks.
Literature Survey

6. Literature Survey (Contd.)
Sl. No Year Researchers Discussions Description
4 2010 Bin Yu, Muninder P.
Singh
Propogation of Trust and Distrust Obtaining user opinion (using votes) is
essential to ranking user-generated
online content. However, any content
voting system is susceptible to the Sybil
attack where adversaries can out-vote
real users by creating many Sybil
identities
5 2011 Li Xiong,
Ling Lin
Peer Trust: Supporting reputation based trust
for Peer-Peer Electronic Communication.
Reputation systems provide mechanisms
to produce a metric encapsulating
reputation for a given domain for each
identity within the system.
6 2011 Bin Yu,
Muninder P. Singh
A Social Mechanism of reputation
management in Electronic Communities
Internet commerce and online
commodity exchanges suffer from
distrust among sellers and buyers, who
are often strangers to each other.

7. Problem Statement
The existing system has a problem of how to
trace the users behavior dynamically and
guarantee that their behavior is within the
limits imposed by the role they hold.
The number of uncertain interpretations is
evaluated during build trust relationship.
This increases the resource usage.

8. Existing system
 In existing system, RBAC (Role Based Access Control)
methods for building secure systems that operate efficiently
in large-scale environments is used.
 Adapting RBAC to enforce security in the Web is
increasingly seen as a solution for scalability issues,
because permissions are associated to roles instead of users
and the number of roles is much smaller than the number of
users.
 The merit of the existing system is to build a prototype of a
Role Server that securely assigns roles to users.

9. Proposed System
 To overcome the problem identified in the existing system, the method of SORT is
used. SORT provides services to the system and giving recommendations about
another system to the peer as different tasks.
 The SORT defines two contexts of trust. One is service and another is
recommendation contexts. Information about past interactions and
recommendations are stored in separate histories to assess competence and integrity
of acquaintances in these contexts.
 The recommendation trust metric is important when requesting recommendations.
When calculating the reputation metric, recommendations are evaluated based on
the recommendation trust metric.
 Recommender’s trustworthiness and confidence about recommendation are
considered when evaluating recommendations. Additionally, service and
recommendation contexts are separated. This enabled us to measure trustworthiness
in a wide variety of attack scenarios. Most trust models do not consider how
interactions are rated and assume that a rating mechanism exists.

10. System Architecture

11. Algorithms
SORT algorithm.
 In SORT, instead of considering a particular trust holder’s
feedback as authentic, public opinion from all acquaintances is
considered as more credible information.

12. Modules
1) Cluster head selection
2) Issue certificate
3) Validate certificate
4) Revoke function
5) Reconstruction of peer

13. Module Explanation
CLUSTER HEAD SELECTION:-
 The cluster is formed on that peer to peer network. From that cluster we have to
choose one head called cluster head. For that cluster selection, the cluster members
in the cluster send the hello packet to the nearest members.
 Clustering, one of the fundamental data mining tasks, in P2P systems. Clustering,
which groups a set of data objects into clusters of similar data objects, can be
applied in many different problem domains, such as spatial data analysis, scientific
pattern discovery, document categorization, taxonomy generation, customer/market
analysis, etc. Various clustering techniques have been proposed for either
centralized systems or distributed systems.
 In addition, these clustering techniques were designed to minimize the computation
cost and/or disk access cost. However, minimization of the communication cost is
the primary goal for the design of clustering techniques in P2P systems.

14. ISSUE CERTIFICATE:-
 The certificate means we generate the signature for each and every peer in the peer
network. There are two different kinds of attacks are involved in the peer
construction. To resolve or identify these two attacks we issue the certificate to each
peer.
 After selecting the cluster head then issue the certificate to the peers for security
purpose. The certificate means that to generate the signature for each and every
peer in the peer network. There are two different kinds of attacks are involved in the
peer construction. They are service attack and recommendation attack. Service
attack means providing the misbehave service to the peer. Recommendation attack
means recommending the unauthorized peer for the transaction.
 To resolve or identify these two attacks we issue the certificate to each peer. And
also it gives some access control permission to the system for more security. The
permissions are read write and forward permissions. This is the future concept we
implement it. The access permission is provided to the system because the SORT is
trust worthiness and maintains more security.

15. VALIDATE CERTIFICATE:-
 In that situation the certificate is verified. This means the created signature
is verified. We can transmit the file from one peer system to another peer in
secure manner.
 The process of certificate validation takes place simultaneously with
various aspects of the program. After the certificate is successfully
validated, the process transfers to the next level where the information is
secured and the certificate is then revoked using the revoke function.
 At the certificate validation level, the network is simulated on the basic
principle of certificate validation. The validated certificate contains
information that explains the reputation metrics of all the peers. In simple
terms can be said as between the sender and receiver.
 This model is very exhaustive as the information between both the peers is
passed, the necessary certificates that explain to the network the reputation
of these peers in the neighborhood.

16. REVOKE FUNCTION:-
 The Revoke function is used for preventing the system from the two attacks
such as service based attack and recommendation based attack. These two
peer can be revoked and act as normal peer for transaction. These
operations are performed in the revoke function. First it identifies which
peer can act as malicious during the transaction after that it revokes or
changes the malicious peer into the normal peer. This process is called as
the revoke function.
 The revoke function acts to stop the functions of the certificate and all other
activities of that certificate. The actual implementation of this function is
that the certificate and all the associated functions of this certificate are
revoked and are dumped as well.
 This module of the program ensures that the certificate is revoked
completely and the this function also helps to reduce any malicious activity
that is to take place in this program successfully using the above explained
trust model that is the basis and structure of the complete program.

17. RECONSTRUCTION OF PEER:-
 The final stage is the reconstruction of peers. Once it identifies and
removes the attacks present in the peer to peer system, the network
will be reconstructed. This reconstruction network or the peer to
peer system act as the self organized and provide more security.
 For that reason, it has to reconstruct our network. The reconstructed
system does not contain not contain any malicious peer. It acts as a
good peer.
 Using this functional module of the program, the peers are
reconstructed using the explained trust model. The process restarts
from the beginning with the resection of the program with all its
modules successfully and executing all the modules in the code.

18. Nam Generator

19. Node Formation

20. Cluster Formation

21. Cluster Head Selection

22. Issue Certificate

23. Validate Certificate

24. Revoke Function

28. Reconstruction of peer

32. Performance Analysis
X Axis: Frequency Y Axis: Time

33. (Cont…)
 When the communication between two peers is
happening, the frequency will be shown high. It may
have some malicious attacks while the
communication is done. To overcome the attacks the
certificate is being issued to the peers. It will reduce
the time and gives more secure data.

34. Output

35. Conclusion
 A new approach is proposed for trust management in peer to peer network
communications. It will generate the own peer networks, after that it forms
the cluster in the peer networks. Each cluster member in the cluster sends
the hello packets to each other. From those packets they choose the cluster
head for providing services.
 The service based attacks and recommendation based attacks are involved.
To overcome and identify these attacks the certificate authority to each
member in the cluster is done. Certificate authority means first it issue the
certificate to the each nodes in the network and then it uploads the files
from one system to another. That situation the certificate is validated.
 The revoke function is used to resolve the two attacks and make the system
as normal node. After that it reconstructs the network. That network
contains only good peer not the malicious attacker in the network.

36. Future work
 The current model SORT can be extended in various
new dimensions to serve for some real time application
models that have peers spread across a large extent and
also ensure faster and smarter data flow across with
better redundancy and can also create a system that is
sustainable for the future, through all the advancements
that may come into existence in the future with it’s
better packet routing over the peer network
environment.

37. References
[1] Abdul-Rahman.S and Hailes.S, “Supporting Trust in Virtual Communities,” Proc.
33rd Hawaii Int’l Conf. System Sciences (HICSS), 2000.
[2] Almeroth.K.C, Swamynathan.G and Zhao.B.Y, “Decoupling Service and Feedback
Trust in a Peer-to-Peer Reputation System,” Proc. Int’l Conf. Parallel and
Distributed Processing and Applications (ISPA), 2005.
[3] Atallah.M, Bhargava.B, Chuang.J, Habib.A and Xu.D, “A Tree- Based Forward
Digest Protocol to Verify Data Integrity in Distributed Media Streaming,” IEEE
Trans. Knowledge and Data Eng., vol. 17, no. 7, pp. 1010-1014, July 2005.
[4] Bhattacharjee.B, Lee.S, and Sherwood.R, “Cooperative Peer Groups in Nice,”
Computer Networks, vol. 50, no. 4, pp. 523-544, 2006.
[5] Boyd.S, Ghosh.A, Prabhakar.B, and Shah.D, “Randomized Gossip Algorithms,”
IEEE/ACM Trans. Networking, vol. 52, no. 6, pp. 2508-2530, June 2006.

38. (Cont…)
[6] Boyd.S, Ismail.R, and Jøsang.A, “A Survey of Trust and Reputation Systems for
Online Service Provision,” Decision Support Systems, vol. 43, no. 2, pp. 618-644,
2007.
[7] Cai.M, Hwang.K and Zojkua.C, “Gossiptrust for Fast Reputation Aggregation in
Peer-to-Peer Networks,” IEEE Trans. Knowledge and Data Eng., vol. 20, no. 9, pp.
1282-1295, Sept. 2008
[8] Can.A.B, “Trust and Anonymity in Peer-to-Peer Systems,” PhD thesis, Dept. of
Computer Science, Purdue Univ., 2007.
[9] Chandrasekaran.M, Jadliwala.M, Upadhyaya.S and Virendra.M, “Quantifying Trust
in Mobile Ad-Hoc Networks,” Proc. IEEE Int’l Conf. Integration of Knowledge
Intensive Multi-Agent Systems (KIMAS), 2005.
[10] Cornelis.C, De Cock.M, Pinheiro da Silva.P and Victor.P, “Gradual Trust and
Distrust in Recommender Systems,” Fuzzy Sets Systems, vol. 160, no. 10, pp.
1367-1382, 2009.