Title: Reputation Estimation and Query in Peer-to-Peer Networks ABSTRACT Several peer-to-peer systems will imagine that the

peers will support to share as well as to communicate the data. However in the released situation of Internet there are even difficult, hateful and also uncooperative peers. The reputation system is been used in order to identify the difficult peers and also to return or remunerate the fine and well performed peers. This article will give a detailed outline of the P2P reputation systems as well as will examine the two fundamental issues in the aim: such as Reputation Estimation along with Reputation Query. These are classified in to different categories and the agent examples are been revised. These are qualitatively compared and evaluated and are summarized to design the open problems for the future research. Index 1. Introduction 1.1 Background 1.2 Existing System 1.3 Proposed System 1.4 Aims and Objectives 1.5 Research methodologies 2. Literature Review 2.1 Introduction to Reputation Estimation 2.2 Introduction to Reputation Query 2.3 Comparisons 2.4 Advantages of P2P Network 2.5 List of problems solved by P2P Network 2.6 Disadvantages of P2P Network 2.7 Design Issues in Reputation-based P2P Systems

3. Reputation-based Trust Systems for P2P Applications 3.1 Conceptual Representation of P2P Reputation-based Trust Systems 3.2 Design of P2P Reputation Systems & Comparison Framework 3.3 Design Considerations for Information Gathering 3.4 Design Considerations for Reputation Estimation 3.5 Design Considerations for Trustworthiness Representation 4. Results 5. Conclusion and Future work 6. References

Chapter 1 INTRODUCTION 1.1 Background (P2P) Peer-to-peer is a substitute network representation provided by traditional client-server architecture. A decentralised model is used by P2P networks, in which every machine is referred as a peer, and it functions as a user by its own layer of server functionality. A peer plays a major role of a customer as well as a server at the similar moment. One peer can open requests for the other peers, as well as it can respond to the received requests from the other peers in the network. Peer-to-peer network is differed from the traditional client-server model in which the customers can only send the requests and should wait for the reply from the server. The performance of the server will decrease by a client-server approach, at the same time the number of customers requesting for the services form the server will increase. As the increasing number of peers is added to the network, the overall performance of P2P networks is improved. By classifying them in to unplanned group these peers will speak and work together and will share a bandwidth with both peers in order to finish the work responsibilities. Each and every peer can be uploaded and downloaded at once, in this kind of process fresh peer can be connected with the crowd, where as previous peers may disappear at any moment. The collection of this peer groups are reliable to end-users. 1.2Existing System: The existing system consists of comparing the values of a reputation estimation and query in peer to peer networks. The existing estimation methods are classified in to the following types: 1) Social network, 2) Probabilistic estimation, and 3) Game-theoretic

1.3Proposed System: The proposed system investigates two main reputation systems they are reputation estimation and reputation query. The detailed information based on this reputation systems are discussed in detail with in this research work. This system consists of many security features than the previous systems. It avoids the attacks which are happened with in the peer to peer network and recognizes the efficient path so that the data transferred will be secured. 1.4 Aim and Objectives Aim To perform the research regarding the Peer to Peer reputation systems which include reputation estimation and reputation query and to develop an application accordingly. Objectives To analyze the reputation estimation method with in the peer to peer network To analyze the reputation query method with in the peer to peer network To develop the applications based on the reputation systems such as reputation estimation and query in P2P networks Key Words Peer to Peer Network Reputation Estimation Reputation Query

Research Questions: 1. What is Peer to Peer Reputation system or Network? 2. In to how many types peer to peer networks are classified? 3. What do you mean by Reputation Estimation in Peer to Peer Networks? 4. What do you mean by Reputation Query in Peer to Peer Networks? 5. What are the advantages and disadvantages of Peer to Peer networks? 6. What kind of problems is solved by Peer to Peer Networks? 7. What are the Reputation Estimation methods used in peer to Peer networks? 8. What are the Reputation Query methods used in Peer to Peer Networks?

1.4 Research Methods: To answer my above mentioned research questions I will follow some methods like taking different articles in to concern to support my above mentioned statement. After my research on the above taken articles, I will describe the Reputation Estimation and Reputation Query systems in Peer to Peer networks. Based on my research I will try to investigate the Reputation estimation and Reputation Query in Peer to Peer Networks which would be useful for future enhancements. CLASSIFICATION OF P2P NETWORKS The P2P networks are classified in to two different types such as Pure P2P networks as well as Hybrid P2P networks. Another characteristic of a P2P network is its capability in terms of fault-tolerance. When a peer goes down or is disconnected from the network, the P2P application will continue by using other peers. For example, in a Bit Torrent system, any clients downloading a certain file are also serving as servers. When a client finds one of the peers is not responding, it searches for other peers, picks up parts of the file where the old peer was, and continues the download process. Compared to a client-server model, where all communication will stop if the server is down, a P2P network is more fault-tolerant.

More than the Internet in the previous years (P2P) peer-to-peer systems has noticed huge and massive success along with wealthy growth and development. The characteristic application will include sharing of files, Internet telephony, streaming as well as overlay routing. In the year 2006 based on the research done by CacheLogic the Peer-to-peer traffic is been accounted for more than 72% of the Internet in the same year. The supportive peers in the P2P systems will arrange themselves by their own in to different overlay networks in order to store or communicate the data to both. Most of the P2P systems will work or effort on the guess or statement of the honest support between the peers. Still in the released conditions of Internet, the peers which participate will not support as preferred. The peers may become self-interested and are not showing interest in uploading the data to the others and might have some irregular actions like frequent or repeated rebooting which will harmfully influence and affect their neighbors. With in the overlay network various peers will open or initiate some attacks in order to disturb the services or to issue or share the viruses. These kinds of peers are known as unsupportive, irregular or aggressive behaviours with hateful/ malicious actions and the connected peers as hateful/ malicious peers. The presentation or the performance of the P2P networks is been corrupted or degraded critically by these malicious peers. Various attacking behavior in the practical P2P sharing systems is been followed by Liang et al. They discovered that nearly 50 % of the copies of the famous songs in kaZaa are infected and the content which is downloaded from network is dissimilar from the downloaders belief. The study will also demonstrate that the structured as well as unstructured P2p file sharing systems are extremely susceptible when the attackers include the enormous false records to destroy the search directories. The reputation system is been frequently been used to identify the malicious peers or to reward or remunerate the well performed peers. Based on the history of performance or presentation each and every peer is been allotted with a reputation value in the classic or typical reputation system. The distinguished services are been given to the peers based on the reputation of peers. There are three functional components in the P2P reputation systems: gathering the information required on the behavior of the peer, scoring, achieving and grading the peers, and giving response in the peers based on scores. All the above mechanisms are nontrivial particularly given in the above consideration: Scalability:

There are hundreds of thousands of peers in the big P2P network. For instance the Skype is having huge number of millions of online user. In the conditions of peer numbers the reputation system must be extremely scalable. Adaption to peer dynamics: The peers may connect or depart at any moment. By the time when the peers depart it may cause the information loss when the reputation information is been preserved at the peers. The strong reputation system must receive the peer dynamics in to the account. Security: The malicious peers will try to break or smash down the reputation system in order to perform malicious actions without detection. For instance, in order to discard any dreadful reputation some of the peers may depart and will rejoin by a new individuality. In the P2P reputation systems the superior reputation system should be secured or protected in order to oppose the adversarial behaviours. It all started becoming popular when millions used Napster to download their favourite song rather then trekking to WalMart to buy the CD. Although, Napster is now legal, others arent, and nowadays a whole lot more then music can be found on peer-to-peer networks. So just what is peer-to peer networking (P2P)? When you access the internet you open a browser such as Netscape, Internet Explorer, etc. P2P is a similar concept. It is an application that runs on your computer and allows you to share files.P2P networking allows computers to communicate directly with one another rather then through a central server like a website. With P2P software you can allow anyone in the world to copy files directly from your computer. This could be a single file, a whole folder, or even your entire hard drive. Like a search engine on the Internet, P2P software allows a user to type in a search term. The search will turn up files with that term in them. While P2P can be neat and fun to use, there are definitely many dangers associated with it.P2P networks have been the centre piece of intellectual property lawsuits, especially those involving illegally downloaded music. Numerous P2P users have been sued by record companies for illegally downloading copyrighted music that they didnt pay for. Its not just music, either. Pirated Hollywood movies and software are frequently traded across P2P networks. File sharing across the peer-to peer network can lead you to inadvertently breaking copyright laws. File-sharing over P2P

networks also puts the user at risk for computer viruses attached to the shared files. While P2P networks are useful and provide a beneficial service, they also provide an opportunity for abuse and computer virus transmission.

Chapter 2 Literature Review 2.1 Introduction to Reputation Estimation: The estimation method which will explain the ways to produce peer reputation related on the others response or comments. The existing estimation methods are been classified in to three categories: Social Network, Probabilistic Estimation as well as Game-Theoretic Model. The representative examples are been selected to each and every category and the advantages as well as the limitations are been discussed. The response or comments i.e. the feedback collection mechanisms are also been discussed when required because many of the estimation methods will communicate on the particular feedback collection mechanisms. Reputation Estimation In the present P2P networks there are three reputation estimation methods such as social network, probabilistic estimation as well as game theoretic model. In the social network the total feedback is present with in the network are considered to the compute peer reputation. In the probabilistic estimation it will make use of the sample of internationally obtainable feedback in order to compute the peer reputation. In the game theoretic model in order to make the reputation system the peers are imagined which are having the rational behavior. The detailed information of these three methods is discussed below. SOCIAL NETWORK The approaches which are related to the social network are then divided in to two different categories such as separated reputation model as well as correlated reputation model. In the model of separated reputation the straight associates of the peer are only capable of expressing the views on reputation of the peer. The eBay reputation system is the sensible example for this. With in the transaction happened in eBay, consumer as well as the retailer will rate both through the positive, negative or else the neutral feedback. A reputation is been computed with in the central server

through passing on 1point to each and every positive feedback, 0point to each and every neutral feedback as well as -1 point to each and every negative feedback. With in a particular period the reputation of the applicant is been calculated by sum of its points. By taking in to consideration that the peers will recline on their feedback, Mekouar et al. proposed to observe the doubtful feedback. In order to explain the transaction each and every transaction among the pair of the peers should produce the feedback. In this process is there is a apparent gap among the two pieces which belongs to the feedback are considered to be suspicious or doubtful.

Then after, the peer will produce the suspicious feedback which consists of less rate of reputation computing. It has been proved that the feedback of the reputation computing depends on its performance. Xiong et al developed a common reputation model which will consider the feedback from the peers, the reliability factor of the sources of the feedback as well as the transaction context factor which is used for selective transaction value. This model will express all the reputation models which are removed. In the model of correlated reputation model, based on the estimation or opinion of the straight associates and even the third party peers the reputation of the peer is been calculated. In the correlated reputation model the peer A will try to recognize or identify the other peer B and even will enquire some of the other peers to generate their view on the peer B. The opinions and views of the peer are combined by A in order to compute the reputation of the B. The Eigen Trust is been considered as an example for this. With in the Eigen Trust, when a peer performs the transaction with

the other peer it will maintain the reputation values for both. While, if there is no straight transaction among the two peers they will maintain the zero reputation value for both. The reputation values are been updated by the peers relatively. Every time the peer A will request to inform the reputation of the peer B, with in the system from the total peers, the peer A will request for the reputation of the B. The weighted amount of the reputation values is been calculated by the peer A as well as it leads to the fresh reputation of the B. The reputation update is been conducted by all the peers in each and every iteration. Until the reputation values are reserved at different peers meet this process is been continued. NICE- Network Information and Control Exchange is the other example for this model. Based on the quality of the transactions each and every peer will hold the reputation of its own transaction associates. Depending on the reputation values the total peers will outline the trusted graph. The overlay path among the two peers are been considered as constant path among them with in the trust graph. Mostly the correlated reputation model is similar to the real social network in which the third party peers are capable of expressing their views and opinions on the peer. It is expensive to gather the opinion of the third party. For instance the Eigen Trust will take long period in order to remain for the reputation values to join.

PROBABILISTIC ESTIMATION This approach will make use of the sample of internationally existing feedback in order to calculate the peer reputation. Generally it will depend on few statements which are taking place on the behavior of the peer. For example it is been supposed that a peer constant through definite other than the unidentified probability. In the process of sharing with the others it may be a self experience that the peer may recline with several unidentified probability. In order to estimate or evaluate the unidentified parameters it will make use of the probabilistic estimation techniques. Several estimation methods are been used. The highest probability or maximum likelihood estimation is been used by Despotovic et al that will imagine that the peers will not join together. The Bayesian estimation is been used by Mui-et al that will make use of only the direct communication between the peers as well as it will not make use of the third party opinion. By making use of the small section of internationally offered feedback the probabilistic model is having low cost with in the feedback collection rather than the social network approach. Simultaneously the complex or complicated reputation model is been used the social network approach as well as it is strong towards the large variety of the malicious actions. Whereas, the probabilistic model should be applied only to the common and simple reputation models as well as it useful only to some kind of the malicious actions. The comparison is been done between these two models. It is been proved that the probabilistic model will act or achieve better or superior for the small malicious peoples whereas, the social network approach is superior while many of the peers are malicious. GAME-THEORETIC MODEL The game theoretical approach is unlike different form the social network approach and probabilistic approach; it will imagine that the peers are having rational behavior as well as it will make use of the game theory in order to assemble or build the reputation system. The rational behavior involves that there is a presence of the fundamental or underlying economic model in which the application are been connected through different choices of the peers as well as the peers will act to increase the applications or tools. The game theoretic framework is been offered by Fudenberg et al in order to propose certain classification of the balance payoffs with in the existence of the reputation effects. Since the work will imagine that the central

trusted ability will do the feedback aggregation which is not scalable to the large scale peer to peer networks. 2.2 Introduction to Reputation Query: The reputation query in the P2P networks is not trivial which means which is not small. In the P2P networks the storage of the efficient data as well as retrieval or recovery is the main difficult issue. Various number of data need a distributed storage approaches. Then after the proficient retrieval- recovery may turn to be nontrivial. The peer dynamics have brought more troubles. The second reputation data is to be largely secured and sensitive. A reputation of the peer could not stored nearby on the peer, as a false peer might misreport its reputation value to obtain the rewards or to stay away from the penalties or punishments. With in the reputation delivery the security issues should also been taken in to consideration. Several significant issues are happened in P2P reputation systems such as preventing the under attacks as well as adversarial attacks, to interrupt the reputation and considering the complete outline of the P2P reputation issues. Reputation Query The reputation query techniques in the peer to peer networks is been discussed below. Centralized and Partially Centralized Structures In order to maintain the reputation of all the peers the simple solution is to make use of the dominant or powerful server. For instance in order to gather and maintain all reputations of the clients eBay will make use of the central server. With in the server the feedback from clients is been forwarded as well as stored. The query which belongs to the clients reputation is even been forwarded as well as responded through the server. It is simple to execute and organize the centralized approach. It is easy to Complete the security with in the central server rather than the distributed components with in the distributed approach. In addition with in the centralized approach the reputation management is autonomous of the peer combination as well as peer separation through which the reputation recovery is been made easy. On the other hand, to the large peer to peer networks the centralized approach is not scalable. The server will form the single end of breakdown which makes the system susceptible. In order to identify and deal with the limitations or restrictions which belongs to the

centralized approach moderately which will make use of the group of servers rather than the single server is been proposed. In order to identify the and discover the malicious peers with in the KaZaa like systems Mekouar et al proposed the MDAMalicious Detector Algorithm. KaZaa is moderately centralized peer to peer file sharing system which consists of group or set of super nodes. Each and every normal peer is connected to the single super node. Malicious detector algorithm will imagine that all the super nodes are constant as well as they will sustain the reputation information intended for simple or ordinary peers. The total estimated results regarding the peer are been sustained and are connected to the super node. Based on their reputation the super nodes are capable of implementing separated service to the peers. It should be noted that the super nodes with in the KaZaa are been chosen by it self from the common peers as well as it is not totally constant. Rather than the super nodes a single approach will make use of the pre deployed in order to maintain the reputation. With in this approach, based on the IP address each and every peer is connected to the single substitute. Respectively each and every proxy or substitute is dependable for assured IP range as well as the proxies are been arranged which are addicted to the binary search tree depending on IP ranges which are been maintained by them. Each and every peer will regularly produce the information on the streaming neighbours. The information of the peers are been sent to the connected proxy. The query which is related to the reputation of peer is been promoted as well as it is replied through the connected proxy of the peer. The efficient search as well as the load balancing is the two significant issues happened with in the moderately centralized approaches towards the multiple super nodes or else proxies. Firstly each and every peer must be connected to the single super node or else the proxy. With in MD this process is been completed through the KaZaas built in mechanism. It is not simple if the peer to peer network is not having the built in mechanism. Assume that each and every proxy is answerable for the assured range of peers. By prearranging the peers with in the systems there is a necessity to recognize the proxy which is answerable for the reputation update or else query. If at all the amount of the proxies is minute then the simple flooding could be used for the purpose of search. If not the highly complex overlay structure must be constructed between the proxies. Secondly, the loads intended for the reputation management must be regularly circulated between the super nodes or else proxies.

MDA will make use of KaZaa built mechanism in order to connect the peers with supernodes and it will not take the issues in to considerations. In order to balance the loads between the proxies the dynamic load redistribution method. While comparison with the centralized approaches the moderately centralized approaches are having extensively developed or improved system scalability. Any how to provide the large peer to peer network the significant number of the supernodes or else the proxies is required that directs to the high implementation as well as the protection costs. STRUCTURED OVERLAY In order to accumulate as well as explore the peer reputation the other class of the approaches will make use of the DHT distributed hash table. With in the DHT each and every peer is been allocated with the single peer ID as well as each and every object is been mixed to the key with in the similar space intended for the peer Ids. In order to store the location of the object the peer is identical towards the mixed key. Based on the hashed key of the object the query of the object is been routed throughout the peers with in the DHT to the peer which is answerable on behalf of the object. In order to route the messages each and every peer with in the DHT will maintain the routing table. The peer trust is been taken in to consideration as an example. It will accept the p-grid as the fundamental or else essential network. It will even make use of the system wide has function which will map a single peer ID to the other. Assume that the peer is having ID called ID (p). When a p is having the transaction through the peer q then peer p will produce the information about the q as well as it will send it to peer through ID hash ID (q) by means of DHT routing. The reputation of the q is been accumulated as well as sustained on the peer through the ID hash (ID(q)) which is known as reputation manager of q. By making use of the DHT routing the queries of the peer reputation is been sent to the reputation manager. In this manner the peer reputation is distributedly accumulated with in the system. This approach is having many advantages. Firstly the peer reputation is distributedly accumulated as well as calculated on the reputation managers. There is no necessity of the central server or else the supernodes. Then after the peer reputation manager is been resoluted by means of the universal hash function that could not be considered through the peer by its own. This will decrease the chance of the collusion among the peer as well as its reputation manager. On the other hand this approach is even having some security issues. Firstly the reputation managers might behave badly through

generating the fake or casual data in the process of responding to the query. Popular determination is used in order to deal with it. With in this the DHT network could be assembled in order to contain the multiple replicas which are answerable for the similar key or else the multiple hash functions could be used in order to map each and every peer to the multiple reputation managers. Once the peer explores for the reputation of the other peer it will recognize the total replicas which are answerable for the key as well as it will make use of the voting scheme in order to calculate the final result. Anyhow the voting could not assure to obtain the accurate result as well as it will not totally deal with the problem. The easy collusion might critically change the result of the voting. Then after the information on the reputation or the query is been transferred among its producer as well as the reputation manager through DHT routing. The report or the information of the query is been modified, interrupted or else removed by the malicious peer with in the delivery path. The peer trust is been projected to encrypt messages to protect the data modification throughout the delivery. However it is not able to protect the data departure through out the routing. In an overview the DTH related approaches cannot assure the secure or protected reputation calculation as well as the delivery. In addition the DHT is having its own restrictions. While the peers are extremely active with in the P2P networks, the reputation manager might suddenly go away from the system. Because of this the data which is been preserved through it is not available anymore. Additionally the load balancing mechanisms which are stand through the DHT storage as well as the routing methods are complex particularly with in the dynamic networks. On the other hand DHT is even having its own security issues as well as weaknesses and even there are several targeted attacks on the routing scheme, data placement scheme, IP mapping scheme e UNSTRUCTURED OVERLAY XREP will make use of the polling algorithm in order to select the consistent source with in the Gnutella related file sharing networks. It contains four types of operations such as resource searching, vote polling, vote evaluation as well as resource downloading. The initial operation is same as searching in the Gnutella. The query message is been transmitted by the peer which contains the search keywords. In the process while the peer accepts the query message which matches it and it will react through the query hit message. In the further process ahead accepting the query hit

messages the query designer will chose the correct matching source between all the achievable options. It will then poll another peers by making use of the encrypted poll message in order to investigate the opinions and views of the particular sources or else the resource supplier. With in XREP the information of each and every peer is been maintained by its self practice through the resource as well as the other peers. Ahead of accepting the poll message each and every peer will verify the experience data. If at all any kind of information is available regarding the resource or else the provider which is specified through the poll message, then the peer will send its vote to the polling peer through the encrypted poll reply message. In the process of the third operation the polling peers will collect the group of votes as well as it will calculate the votes. Firstly the votes are been decrypted as well as it will reject the damage ones. Then in the further process the voters IPs are been analyzed as well as it will deduct the group of duplicate or else inhibited votes. Then after erratically the group of votes are been selected as well as it will openly contact the voters through the trust vote message. Each and every contacted voter needs to forward the vote reply message intended for the vote confirmation. This leads the attackers to give the cost of making use of the original IPs as the fake witness. After completion of this checking process a polling peer could not achieve the reputation of a resource or else the supplier. Depending on the value of the reputation the polling peer could also download the resource or it can remove the resource as well as it can do the voting process again on the other resource. The approaches which are related to unstructured overlays are having same kind of limitations or restrictions towards the DHT based types. In the process of transmission the messages might be stopped or else blocked as well as the voting becomes weak towards the collision between the peers. As a result the protected reputation calculation or the delivery is not been assured. Depending on flooding only the searching or else voting taking place on the unstructured overlay, which sustains the heavy traffic with in the network. For instance, each and every time the poll messages of XREP are been communicated all over the network, then there is a necessity to the peer to identify the reputation of the resource or the contributor. 2.3 COMPARISONS The reputation query techniques are compared below. The centralized approach need the central server in order to store the reputation, where as the partially centralized

approaches needs the supernodes or else the predeployed proxies. In order to control the reputation the approaches which are related to the structures overlays as well as unstructured overlays depends on the peer without involving the extra services. Especially in the case of DHT based approaches the reputation of the peer is been controlled through the reputation manager which is been calculated by making use of the universal hash function. In the case of approaches which are related to the unstructured overlays the peers will frequently embrace the reputation of the transaction partners. Depending on several diverse storage mechanisms the approaches are having the dissimilar reputation search methods. The reputation query is openly or straightforwardly transmitted to the server. Whereas, in the partially centralized initially the query is forwarded to the supernode there after it will transfer the query to the objective or target supernode. The DHT routing is been used or directed to the queries with in the DHT based approach. The approach which is related to the unstructured overlays, the flooding is been used regularly which will get absorb much more network bandwidth. Between these approaches the centralized approach is having poor scalability, where as the DHT based approach is having huge scalability. The partially centralized approach is having the improved or superior scalability rather than the centralized approach, but it will depend on the predeployed proxies or else the supernode as well as it is not totally scalable. The approach which is related to the unstructured overlays doesnt require any kind of the central component, though it is not scalable such as DHT based approach because it is having high bandwidth consumption with in the reputation search. The centralized approaches as well as the partially centralized approaches are very strong towards the peer dynamics. With in these approaches the reputation values are been accumulated on the server or else supernodes which are extremely secure and constant. With in the approaches which are related to DHT, the departure of the reputation manager may direct to loss of the data which is been accumulated or stored in it. Below the peer churn the DHT is having its own mechanisms or systems in order to maintain the data which is available. Because of peer departure, there is some safety towards the loss of the data with in the approaches which are related to the unstructured overlays. With in the existence of the peer churn the huge loss in the data is been noticed. Then about the security of the centralized as well as the partially centralized approaches are highly secure is imagining that the servers as well as the supernodes are totally constant. In the case of this approaches the information or the queries is been openly

sent to the server or else the supernodes as well as there is no presence of the third party peers with in the delivery paths. The approaches which are related to the structured overlays or else the unstructured overlays will not assure the secure or constant reputation calculation or else the delivery. With in these approaches the reputation maintainer might happen to be the spiteful as well as it will produce the fake data and even the delivery path might have the malicious or spiteful peers. Even though there are several systems or techniques to develop the system security but no method will assure 100 % security. 2.4 Peer-to-peer networking has the following advantages over client/server networking: The resources as well as the information could be transferred by means of the centre as well as the edge of the network. With in the client, user or the server networking the resources as well as the information are extremely transferred only by the centre of the network. The peer network can be measured in an easy manner and considered more efficient when compared to a single server. The single server is been issued to the single point of the breakdown or else it could be blocked with in the usage of the high network. The network of the peer is capable of sharing its processor, by combining the calculating resources intended for the purpose of the circulated calculating tasks in spite of depending on the single computer like the supercomputer.

The resources of the peer computers which are been shared could be openly accessed. In spite of sharing the file which is been stored with in the central server, the peer is capable of sharing the file openly by making use of its local storage.

2.5 Peer-to-peer networking solves the following problems:

Peer to peer network will permit the resources which are been processed related to the edge computers that are used to the distributed tasks.

Peer to Peer network will permits the resources which are to be shared openly without the necessity of the transitional servers.

Peer to Peer network will allow the well organized multipoint statement or communication without depending on the IP multicast infrastructure.

2.6 Disadvantages of Peer to peer networks: With in the process is at all there are several users that are associated to the peer to peer network, there is a high chance that a network will not perform well, since the peer to peer network is not capable of handling the huge number of users or clients. In order to maintain the network users or clients the network performance is The security features with in the peer to peer networks are low. In a peer network there is no chance of preventing the in secured aspects Each and every person can act as the server in the peer to peer network as well enough.

which often takes place with in the network. there is no authorization is required for the users or clients. 2.7 Design Issues in Reputation-based P2P Systems Several number of online community sites like eBay, Amazon, SETI project, Morpheus, KaZaa and Slashdot are having some kind of reputation management which is built with in it. Many issues are included with in the design of the reputation based peer to peer systems. There are four main issues which are happened with in the reputation based peer to peer systems such as General Security Issues, Distributed Systems Security Issues, Social Issues and Performance Issues. General Security Issues Generally, now a days the peer to peer systems like Gnutella or else KaZaa is not meant to be secured for the users who are making use of it. If the entire PC which is running through the machine or device is been corporate with the malicious peer attack then it is been initiated to generate the fake information which is requested in the form of recurring the fake directions or else the false date in order to identify the query. Additionally, the users or clients should depend on the peer to peer

applications through its code to function in the proper way. As a result the nodes should act vigorously towards the malicious attacks. Few attacks which are common on peer to peer systems are discussed below. Man-in-the-middle attack It is a kind of security threat through which the peer is acquired among the receiving peer as well as the sending peer with in the peer to peer network and even it will sniff the information which is been forwarded. In general it is been used to study the public keys encrypted communication. These kinds of attacks are not such easy to transmit. The attacks depend on the whole access to the total messages among both the peers who are waiting to converse or communicate. For example two peers like A as well as B who are capable to share assured resources. The total messages among A as well as B should be passes among the main with in the middle M which is been rationally situated among A and B. With in the process of communication the public keys should be replaced among A and B peers. In this process it self M will begin to involve by means of generating the own key pairs which are designed for the purpose of A as well as B. Then after this key pairs are been circulated back to A as well B in which M is capable of decrypting, reading and encrypting the messages which are passed through A and B, then they will imagine that they are communicated with in the secured channel, other than the channel among A as well as M and even M as well as B which is usually secured as well as M is capable of reading and modifying the total messages. The system such as Gnutella is very famous for these types of attacks. Gnutella system is the best example for this in which the Query Hit will strike the message which is been customized through some of the malicious node with in the path. The altered or modified Query Hit will direct the downloading application to the non existent node or else the undependable or malicious node. Denial of service (DoS) attacks The DoS (denial of service) attacks are been vitally used in order to protect or stop the victim or user to make use of the network connection usually. Each and every peer with in the network should react to the query which is happened from the other peers. This responding is been simply demoralized by making use of the malicious peers which are capable of collaborating the repeated sending matching queries that will ultimately create the network connection to be variable or else worthless. These kinds

of attacks will respond on the limitations with in the TCP or IP protocol. The peer is been bound in order to respond to the query message. The method of managing the query messages by making use of the digital messages could be simply demoralized for the purpose of (DoS) Denial of Service attacks through the attackers who are could repeatedly subject the high value queries. These type of attacks are even considered as group attacks. For instance, the peer to peer systems which are using the digital signatures to verify the peers, the attackers could be simply attack the peer through high match queries that will excess the computational system. Therefore the performance of the system is been corrupted which leads to the high reaction point. Buffer Overflows The KaZaa type of peer to peer applications are suffered through the Buffer overflow vulnerability that are demoralized through the attacker in order to activate the (DoS) denial of service condition or else the it has its own code which is to be completed which is taking place on the attacked machine. These kinds of vulnerabilities will make the users or clients affect to several security dangers. In these kinds of attacks the additional data might have the codes which are designed in order to run the particular programs or else the scripts, that are been used in order to send the information regarding the machine in the direction of the attacker. Generally this is happened because of the poor programming of the applications which belongs to peer to peer are offered. FastTrack peer to peer is one of the best example to the buffer overflows vulnerability which is been demoralized in order to cause the (DoS) denial of service on the supernodes as well as it is even capable of cooperating them. Supernodes are to be the clients who are having high uptime, large bandwidth, the public IP address, the dominant and powerful CPU as well as the huge quantity of RAM. The supernodes will hold the ways of another supernodes as well as the clients are been logged against the network. The user who belongs to the peer to peer client depends on the FastTrack may accidently happen to be the supernode. The information which belongs to the other supernodes is been accepted by these supernodes. The information about only 200 another supernodes is contained with in the packets which are forwarded to the supernode at highest limit. The allotted buffer is been overflowed is at all the packet is having more than that of 203 supernodes. This leads to the crash or collapse with in the supernodes. It is even noted that it is

even demoralized to perform or finish the random code which is taking place on the supernode through 50 percent success ratio. This vulnerability is been demoralized in order to decrease the total peer to peer networks which depends on FastTrack. Privacy Concerns In order to make or generate the malicious program there is a necessity of the virus writer, the easy usage of the P2P connections are been proved to be the best threat to the firm. By making use of the P2P software in the vast situations, it can produce the unexpected hole with in the network security. This kind of software can be simply operated with the limitations of the configured firewall; the software normally will create external connections than that of depending on the accommodating incoming connections. This kind of software could be wrongly used or configured by the users or clients in order to permit the outside systems to surf as well as to achieve the files starting from the computers. These kinds of files involve the data which is confidential with in the inbox of the email to the proprietary design documents. Even though if at all the peer network is been configured in a proper way, then the network must not be utilized to transmit the information which is confidential. In general the data is been forwarded including the data with in the network which is unencrypted. These type of the data is been accessed in the easy way through the network sniffing program. The limited usage must be taken in to consideration because of the privacy problems which are alone. Network Issues The network will affect the performance of the peer to peer network through which it is been connected. This is the main reason for several users or clients of the P2P users because they cannot be downloaded through simplicity as well as speed. The functioning of the peer to peer network is been affected by various factors. Topological-Changes The reliability problem will take place if at all the peer to peer network is been prone to the topological changes which will happen in the peers as well as the initial changing neighbors there is no assurance of the fool proof behavior which belongs to the new peers. The overlay network becomes unbalanced with the topological changes

which happens in it, as the total steering information is been updated regularly. The total properties will show effect on how the people will replace the content on the P2P file sharing networks. Distributed Systems Security Issues Scalability Problem Several peer to peer applications such as Gnutella will collapse if at all the user will not use the huge bandwidth. Any how to search this type of the systems is not scalable to the better amount. For using this self scaling behavior the node will look for the files and the peers should have preferred content. Unstructured overlay network of the peers is been created with in the Gnutella type of peer to peer systems. To search this it will make use of the flooding through the random walk approach. The queries are been forwarded to the central site and as a alternatively distributed between the peers. The list of the total content which is similar to the query is been forwarded with in the received query to the originating node. The system like KaZaa will make use of the appropriate supernode approach through which the supernodes contain high bandwidth connectivity. Chapter 3 Reputation-based Trust Systems for P2P Applications: Design Issues and Comparison Framework The Peer to Peer systems are the decentralized applications in which the heterogeneous peers are happened to be independent as well as it is having irregular existence with in the network and even the high level of the secrecy interoperate intended for some of the reasons like file sharing, distributed computing as well as ecommerce transactions with out the necessity of the centralized server. With in the Peer to Peer systems the decentralized nature will cause the requirement of the superior trust among the peers which will allow for the constant communication as well as the replacement of the services among them. The peers with in the peer to peer systems require to take some trust resolutions in order to select the peers which will manage the resources which are been requested between the existing ones. As a result, there is a necessity of minimum a single trust system in order to certify the pleasing level of the strength towards several types of attacks which are been examined with in the peer to peer systems. This kind of trust system must be decentralized; therefore

each and every peer is capable of creating independent trust decisions depending on the reputation of another peer. Through the peer reputation the efficient peer can be identified in a particular aspect. Depending on the direct experiences as well as another peers transaction information the measure is been approximated. In recent times the reputation based trust models intended for the peer to peer systems achieved a lot of the attention through the research community with in the areas of trust as well as the peer to peer systems. Various number of the trust models are initiated with in the literature which will make use of the same models such as reputation credibility, recommendation and it will concentrate more on the dissimilar aspects such as social probabilistic modelling of the behavior, trust data management. In many situations the mentioned models are not useful in real time peer to peer applications even though those are analysed as well as tested. Hence these models normally will not contain particular design features which are required to design an efficient reputation system that can be used in real time peer to peer application. These models differ according to the design features like input information, the methods of the reputation estimation and reputation representation. Hence there is no existence of the normal model intended for the purpose of the peer to peer systems as well as the selection of the reputation model on behalf of the specific peer to peer application is difficult. In addition there is a necessity of the design issues for the designer of the decentralized reputation based trust system in order to take the typical decisions based on them. The information on concepts based on the reputation based trust model intended for peer to peer applications as well as conceptual representation of that kind of model is been represented. The components as well as the design considerations of the reputation based trust system which is been able to deployed with in the peer to peer network in order to generate the reputation based trust functionality is also been referred. In addition the comparison between the framework intended for the reputation systems as well as the existing approaches is been discussed. The main objectives for this are as follows: In order to recognize the elements of the reputation based trust models which are designed for the purpose of peer to peer systems as well as to represent the main thoughts of the reputation based trust systems design.

To allow the correct variety of the reputation system or else the particular elements of the reputation system designed for the specific peer to peer applications all the way through the association or comparison.

The concepts based on trust as well as its applicability with in the peer to peer systems and will represent the theoretical illustration of the peer to peer reputation based trust model. The components as well as the design considerations which are related to the reputation system and the organizational framework are based up on the thoughts. In addition the representative peer to peer reputation systems intended for several application areas as well as will make use of the framework in order to compare them based on the represented features. In the case of World Wide Web, the interactions of systems which are decentralized, opened and are distributed widely are considered according to their domains by enabling administratively for the purpose of creating trust among the efficient resources and the malicious peers. Many peer to peer applications are been proposed based on trust systems which are as follows: The policy based trust systems in which the peers will utilize the record certification in order to facilitate the access control towards the limited resources. The reputation based trust systems which will make use of the information by taking the recent communications in to consideration through the individual in order to create the reputation measure which will maintain the trust decision. Because of the extensive applicability these trust systems with the peer to peer systems are been examined. 3.1 Conceptual Representation of P2P Reputation-based Trust Systems The essential elements of the reputation based trust model are as follows: Trustee: The individual which is been provided for the reputation value to the service which gives the productivity of the transaction or else the quality it will group like the originality of the file. Trustor: The peer which is required to estimate or calculate the trustees reputation to create the trust decision regarding it like to choose whether to complete the transaction happened with in it.

Third Party or else Witness: The peer which will produce the suggestion to the trustee related with its self knowledge through the last. Context: The reputation of the peer depends on the particular situation through which it is applied such as the particular facilities which the trustee will offer, the qualities of the service.

Recommendation: It will represent the feedback which is been generated through the peers regarding the other peers credibility. In order to represent these type of information the terms such as recommendation, trust information or else feedback is been used.

Trustworthiness or reputation: It is the indicator for the quality regarding the services of trust or attributes which depend on the recommendations along with the particular situation and time.

Therefore the research will concentrate on the trust management, while the framework for the decentralized security decisions in those kinds of systems. Trust is the difficult, complicated as well as the context dependent notion that is been symbolically known in Sloman. With in the peer to peer systems the peers which do not identify each other should replace the services as well as the resources with no central control. Therefore there is a necessity of the decentralized trust system which will help the peers to recognize their dependable peers. 3.2 Design of P2P Reputation Systems & Comparison Framework Generally the reputation based trust system will help or support the peers to select the dependable or reliable peers in order to perform with it. In order to produce these kind of function the peer to peer reputation system: It will gather the information based on the transactional behavior of each and every peer. The transacting individuals will generate the ratings regarding the performance of one another which are near by combined in order to outline the individuals opinion or view regarding others. The individual ratings or else the views will represent the recommendations which are been circulated with in the peer to peer network. Each and every peer is capable of storing that kind of information as well as it is capable of providing the request or else by broadcasting with in the network.

It will provide the trust information which affects the transactional behavior which belongs to the trustee as well as it will provide the credibility or else the reputation value to it. The reputation score depends on the subset of ratings because it is too expensive to gain the ratings or else the opinions or views which results in interactions through the particular peer.

It will rank the peers based on their credibility or trustworthiness or else the peer credibility or trustworthiness is been compared with the threshold to accept the Trustor in order to select the peer to execute with the system to receive the action towards the malicious peers when satisfying the contributions. The functionality of the reputation system is been broken down in to several components. In order to design each and every component several issues related to the design should be considered which are represented as follows. The design issues will represent the comparison of the framework which is used in order to evaluate or calculate the number of peer to peer reputation systems.

3.3 Design Considerations for Information Gathering Trust information storage, dissemination as well as the search mechanisms: The data management is the significant aspect with in the decentralized trust system which is referred to as the trust information which is been utilized in which it is accumulated as well as transmitted and obtained. In order to accumulate and recover the trust information several peer to peer systems will make use of the fundamental peer to peer structure. In other each and every peer will store the information based on the own transactions as well as the group of neighbours which will request for the recommendations. In order to send the queries which are intended for the purpose of recommendations or else the circulated self experiences the broadcasting, flooding as well as the probabilistic flooding techniques are been used. The local control towards the trust information is been accumulated locally with in the peer. The peers may or may not have the local control towards the trust information which is been accumulated locally with in them is having the affect on the trustworthiness of the reputation system as the malicious peer

through the local control may modify the information which is been accumulated locally through out it. Credibility of the recommender: While the peers might produce the incorrect recommendation, the credibility of the recommender must be taken in to consideration. Several systems might recommend for maintaining the separate ratings taking place on the probability of the peer in order to overcome the transaction as well as its probability in order to suggest the malicious peers. Some of them will make use of the credibility value of the peer respective to the services it will generate the filter intended for the recommendations it will make and assume the peer which will produce the trusted services and even will produce the truthful recommendations. Type of behavior taken in to account: Reputation evaluation depends on the positive behavior or else the negative behavior or both on the positive as well as negative behavior of the trustee. In the last situation the negative behavior must generally taken in account through the higher weight, it is having the superior affect on the credibility of the peer rather than its positive behavior. Context dependency: The reputation estimation as well as the trust decisions is based on the specific context of the transaction. This context is capable of representing the factors which are related to the transaction like the capacity as well as the price of the transaction in the situation of e-commerce application or else it is capable of referring the type of transaction like the service condition or else the recommendation condition. The context is been considered with some of the trust systems the openly or else the completely ignored context, imagining that it is similar for each and every transaction. 3.4 Design Considerations for Reputation Estimation Initialization of trust information: Allotting the original value of the peer in the time when the information based on the transaction exist is tough as well as it is significant to differentiate among the fresh peer as well as the peer with poor performance which is long term as well as it also protect from the poor

credibility. The selection of the first trust value is based on the strategies which represent the complete distrust, complete trust, neutral trust or else the default values based on the role played by the peer with in the community. Scope of trust information (global versus localized information): Several reputation systems will imagine that each and every peer is having the similar access to the active trust information as well as the different peers will estimate the credibility of the other peer in which their evaluation will be similar. With in these systems the trust is having the universal capacity as well as it could be the purpose. With in the other systems the trust estimation is he localized process, which depends on the direct information as well as the information which is coming through the group of the trustors neighbours. With in the localized trust systems trustworthiness is individual. Trustworthiness estimation method: The feedback about the previous interactions through the trustee is been combined in order to generate the trustees trustworthiness value. Several association methods are been projected like the easy statistic functions, probabilistic methods and unclear logics. Transitivity extent: The trust transitivity is totally taken in to consideration with in the reputation based trust systems because they will imagine that if at all A will trust B then B will trust C as well as B will suggest C to A and then after A will calculate the trustworthiness metric for C depends on the recommendation B as well as As trust is B. The transitivity is been imagined by the recommendation chain or else only through the single level of the trust in direction. Recency dependency: In the process of evaluating the reputation more than the previous transaction behaviour must contain the superior impact on the peer score rather than the older transactions.

3.5 Design Considerations for Trustworthiness Representation Range of trustworthiness values: The trustworthiness values could be separated or else permanent as well as it is capable of having the changing range which will reflect the dissimilar trust semantics. The example of that kind of domains is interval as well as the group in which o will represent the

suspect as well as 1. The other example is the usage of the particular period in which it is separated in to smaller period in order to signify the dissimilar levels of the trust. Rank or threshold based: The trust decisions with in the reputation systems are basically taken in to consideration after the comparison of the peer trustworthiness by the threshold or else after the comparison of trustworthiness of the different kinds of peers. When ever the threshold is been utilized its selection is based on the semantics of the trustworthiness values as well as the wants and needs of the particular implementation. Distrust representation: The representation of the distrust is capable of separating the malicious peers. In some of the trust systems the distrust is openly represented as the particular choice of reputation values or else by maintaining the different ratings of the trust as well as the distrust. Comparison of P2P Reputation Systems : The comparison framework is been used in order to observe as well as to compare the number of the reputation systems through the way they will deal with the recognized issues and it will recognize the active approaches, shortages as well as the probable design options. Most of the active peer to peer reputation systems are been improved for the natural purpose of the peer to peer applications like file sharing. Any how the reputation systems are projected to the other classes of the peer to peer systems like the supportive as well as the peer to peer e-commerce applications. The systems which are taken in to consideration for the purpose of P2P applications are limited, even though there are several other systems which are available for P2P application. The observations which will represent the framework as well as the options of the several reputation based trust systems based on the recognized design thoughts. The selected reputation based trust systems are descried in detail as follows: Regret is the reputation system which is considered on behalf of the multi agent marketplaces which depends on the social relations among the peers. It will take three different dimensions in to consideration, the individual dimensions will consider only the direct communication among the peers, the social dimension will consider the information regarding the trustee

which is coming through the another peers as well as the social associations among the peers and the ontological dimension will refer to the uniting reputations on different situations. Several types of reputation including their trustworthiness measures are been calculated as well as united to outline the final reputation of the peer. A social Mechanism for Reputation: With in this type of systems the peers are having tow types of reputations in order to provide the services as well as to provide the recommendations. The peer A will allot the rating to the B depending on its open experience with B and the recommendations, the ratings of A to the recommenders. The peer which will receive the query and will choose that it is having the capability in order to respond or forward the query in order to the group of the neighbouring peers. The response which is been given may have the answer or the recommendation or both are been used in order to calculate the capability of the responding peer as well as its recommenders. Managing the Dynamic Nature of Trust: With in this system the peer needs to take the trust decision regarding the other peer inside the present time slot, it will make use of the local rating if at all it is been related with the trustee with in the same slot. If not it will request for the reputation information as well as it will calculate the trustworthiness of the trustee as the standard of the inward reputation values, which are contained with in the witnesses of the trustworthiness. Probably the trustworthiness of the peer intended for the expectations of the future time slot could bee calculated. Once the communication is been completed then the Trustor will rectify the values of the trustworthiness of the trustee as well as the individuals of the viewers. Peer Trust: The peer trust is been designed for the purpose of peer to peer eCommerce communities. It will take the feedback in to consideration in the situations where the quantity of the approving the peer is been achieved by means of transactions, the number of transactions of the trustees, the trustworthiness of the feedback, the transaction of the context factor and to refer to the characteristics of the community. By making use of the P-Grid structure each and every peer will store or accumulate the

minute portion of the trust data. The peer will gather the required trust data as well as it will estimate the trustworthiness of the other peer with in the fly when it is required. Fuzzy Trust: The fuzzy logic reputation system is meant for the purpose of peer to peer eCommerce applications. The peers will complete the fuzzy assumption with in the local parameters in order to produce the local scores intended for the peers through which they are interacted. By making use of the qualified peers the local scores is been collected together, which relate to the aggressive threshold as well as it is been aggregated or combined in to the global reputation values. For the purpose of the global reputation aggregation or combination the Fuzzy Trust will make use of the DHT based peer to peer overlay network. Managing Trust: This system depends on the binary trust. If a peer undergoes cheating then it will happen to be untrustworthy as well as the objection is been produced towards it and it is accumulated as well as replicated with in the P-Grid data structure. If at all the peer needs to evaluate the trustworthiness of the other peer it will look out for the objections in which the peer is received as well as filed. Then after the trustworthiness of the peer is been calculated depending on the overall experience on these kind of objections or complaints. (MLE) Maximum Likelihood Estimation based trust system: The proposed system will make use of the structured peer to peer overlay for the purpose of storing and retrieving of the information related to trust and also consists of information based on the performance of the peers. The reports give results as 0 and 1 in which 0 indicates the dishonesty of the peer and 1 indicates the honesty of the peer. The reputation of a peer justifies the measures of honesty as well as dishonesty in the process of transaction with the other peers. Depending on the probabilistic method it is been calculates by considering the probability of the peer to recline in the process when the peer will report on the performance of the other peer. A Reputation-based Trust Management System for P2P systems: In this particular system peer to peer file sharing will be done in which each and

every peer can evaluate the ratings of the trust as well as distrust among other peers depending on the binary trust vectors. NICE: NICE is been designed for the purpose of the Internet supportive applications. After the completion of the transaction each and every transacting peer will specify its views based on the value of the transaction. If at all this specified view is positive then it is been accumulated with in the other transacting peer, if not is accumulated with in the peer which is signing it. When the peer A needs to contact the resource of peer B then it should demonstrate its trustworthiness to B, then it will send the B cookies which are signed by the B. If at all A is not having that kind of cookies it should gather the chains of the cookies through B to the A and should show them to A.

Chapter 4 Results: By double clicking the file MainServer.sln, the following screen will appear.

In this screen, three buttons will be shown for three clients and a message box by which a message can be sent. If first send button is clicked then the authentication will be received from client1. In the same way, if second send button is clicked then the authentication will be received

from client2. If the third send button is clicked then the authentication will be received from client3. By double clicking Client1.sln, the following screen will be displayed.

The message sent from the server can be shown in this screen. In the same way when Client2.sln and Client3.sln are clicked, then the other two screens will be displayed. Finally the application shows the correct path which is secured and efficient. In this application, Client1 is the correct and secured path. Chapter 5 5.1 Conclusion This study examines the two major significant aspects with in the peer to peer reputation systems such as reputation estimation and reputation query. The particular examples are been discussed with in the literature and are compared for the purpose of the multiple aspects. Like anonymity there are several research issues with in the peer to peer reputation systems. In several applications the clients or users will show interest only when a particular amount of the anonymity is been assured. In order to provide the secure underlying protocols many existing reputation systems have kept

the anonymity aside in which each and every peer will preserve the single permit as well as the peers will make use of the certificates in order to verify each other. The other aspects might contain the issues like examining the security threats as well as studying the punishment mechanisms. This study will even provide the information on the advantages as well as disadvantages of the peer to peer networks. This study will even provide the detailed information on the Reputation-based Trust Systems for P2P Applications. The reputation is playing the fundamental role with in the process of creating the trust among the communicating peers with in the peer to peer system. Based on the previous systems for peer to peer applications it has been proved that those are lacking in their design complete framework. There by this proposed system may rectify the previous systems in the case of reputation based trust systems as well as the required analysis regarding the design of the reputation systems which can be efficiently used in peer to peer applications. Several representative approaches are been examined for the purpose of the three peer to peer application areas then after they are compared between the ways they deal with those issues. The presented design issues must be taken in to consideration by the designer of the reputation based trust system which is designed for the purpose of peer to peer systems as well as it should take some suspicious decisions regarding them to improve the successful solution for the purpose of the reputation functionality with in those kind of systems. Further there are certain aspects like anonymity handling, in order to support the fault tolerance as well as the scalability and different types of attacks which affect the efficiency of reputation system.

5.2 Future Work: There is a chance of developing an efficient reputation system for peer to peer applications in future which consists of better design framework and to avoid the attacks in order to provide secured and efficient peer to peer reputation systems. References 1. Aberer, K., Despotovic, Z., Managing trust in a peer-2-peer information system, 10th Intl Conference on Information and Knowledge Management (CIKM), Atlanta, 2001

2. Z. Despotovic and K. Aberer, P2P Reputation Management: Probabilistic Estimation vs. Social Networks, Comp. Net., vol. 50, no. 4, Mar. 2006, pp. 485500 3. L. Mekouar, Y. Iraqi, and R. Boutaba, Peer-to-Peers Most Wanted: Malicious Peers, Comp. Net., vol. 50, no. 4, Mar. 2006, pp. 54562 4. Aberer, K., P-Grid: A self-organizing access structure for P2P information systems, 6th Intl Conference on Cooperative Information Systems (CoopIS), 2001 5. S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina, The EigenTrust Algorithm for Reputation Management in P2P Networks, Proc. WWW 03, 2003, pp. 64051. 6. 3 Chang, E., Dillon, T., Hussain, F. K., Trust and Reputation Relationships in Service Oriented Environments, 3rd Intl Conference on Information Technology and Applications 7. Chang, E., Hussain, F. K., Trust and Reputation Relationships in Service-Oriented Environments, Keynote, ICITA 2005 8. Despotovic, Z., Aberer, K., Maximum Likelihood Estimation of Peers' Performance in P2P Networks, 2nd Workshop on the Economics of Peer-to-Peer Systems, 2004 9. Despotovic, Z., Aberer, K., Possibilities for Managing Trust in P2P Networks, Technical Reports in Computer and Communication Sciences (EPFL Technical Report IC/2004/84), November 2004 10. Dillon, T.S., Chang, E., Hussain, F.K., Managing the dynamic nature of trust, IEEE Transaction of Intelligent Systems, vol. 19, no. 5, pp. 79-82, Sept/Oct 2004 11. Jsang, A., Ismail, R., Boyd, C., A Survey of Trust and Reputation Systems for Online Service Provision (to appear), Decision Support Systems, 2005 12. Jurca, R., Faltings, B., An Incentive Compatible Reputation Mechanism, IEEE Conference on E-Commerce, Newreport Beach, CA, USA, 2003 13. Budiarto, S. Nishio, and M. Tsukamoto. Data management issues in mobile and peer-to-peer environments. Data Knowl. Eng., 41(2-3):183 { 204,June 2002.

14. S. Buchegger and J.-Y. L. Boudec. A Robust Reputation System for P2P and Mobile Ad-hoc Networks. In Workshop on the Economics of Peer-to-Peer Systems, Boston, MA, June 2004 15. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Secure Routing for Structured Peer-to-Peer Overlay Networks. In Symposium on Operating Systems Design and Implementation, Boston, MA, December 2002 16. E. Damiani, S. D. C. di Vimercati, S. Paraboschi, P. Samarati, and F. Violante. A Reputation-Based Approach for Choosing Reliable Resources in Peer-to-Peer Networks. In ACM Conference on Computers and Communications Security, Washington, DC, October 2002 17. J. R. Douceur. The Sybil Attack. In International Workshop on Peerto-Peer Systems, Cambridge, MA, March 2002 18. S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The Eigen Trust Algorithm for Reputation Management in P2P Networks. In International World Wide Web Conference, Budapest, Hungary, May 2003 19. M. Gupta, P. Judge, and M. Ammar. A Reputation System for Peer-toPeer Networks. In ACM Intl. Workshop on Network and Operating System Support for Digital Audio and Video, Monterey, CA, June 2003 20. S. Saroiu, K. P. Gummadi, and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Multimedia Computing and Networking, San Jose, CA, January 2002