07-08-2012, 02:38 PM
Rumor Riding: Anonym zings Unstructured Peer-to-Peer Systems
rumor riding.docx (Size: 5.9 MB / Downloads: 232)
ABSTRACT
The anonym zing Peer-to-Peer (P2P) systems often incurs extra traffic costs, many systems try to mask the identities of their users for privacy considerations. Existing anonymity approaches are mainly path-based: peers have to pre-construct an anonymous path before transmission. We propose a lightweight and non-path-based mutual anonymity protocol for P2P systems, Rumor Riding (RR).Employing a random walk concept, RR issues key rumors and cipher rumors separately, and expect that they meet in some random peers. The overhead of maintaining and updating such paths is significantly high. We propose Rumor Riding (RR), a lightweight and non-path-based mutual anonymity protocol for decentralized P2P systems. Employing a random walk mechanism, RR takes advantage of lower overhead by mainly using the symmetric cryptographic algorithm. We conduct comprehensive trace-driven simulations to evaluate the effectiveness and efficiency of this design, and compare it with previous approaches.
Scope of the project
The anonymzing Peer-to-Peer (P2P) systems often incurs extra traffic costs, many systems try to mask the identities of their users for privacy considerations. Existing anonymity approaches are mainly path-based: peers have to pre-construct an anonymous path before transmission. We propose a lightweight and non-path-based mutual anonymity protocol for P2P systems, Rumor Riding (RR).Employing a random walk concept, RR issues key rumors and cipher rumors separately, and expect that they meet in some random peers. The overhead of maintaining and updating such paths is significantly high. We propose Rumor Riding (RR), a lightweight and non-path-based mutual anonymity protocol for decentralized P2P systems. Employing a random walk mechanism, RR takes advantage of lower overhead by mainly using the symmetric cryptographic algorithm. We conduct comprehensive trace-driven simulations to evaluate the effectiveness and efficiency of this design, and compare it with previous approaches.
Abstract
—We present several protocols to achieve mutual communication anonymity between an information requester and a provider in a P2P information-sharing environment, such that neither the requester nor the provider can identify each other, and no other peers can identify the two communicating parties with certainty. Most existing solutions achieve mutual anonymity in pure P2P systems without any trusted central controls. Compared with two such representative ones, our protocols improve efficiency in two different ways. First, utilizing trusted third parties and aiming at both reliability and low-cost, we propose a group of mutual anonymity protocols. We show that with some limited central support, our protocols can accomplish the goals of anonymity, efficiency, and reliability. Second, we propose a mutual anonymity protocol which relies solely on self-organizations among peers without any trusted central controls. In this protocol, the returning path can be shorter than the requesting path. This protocol does not need to broadcast the requested file back to the requester so that the bandwidth is saved and efficiency is improved. In addition, this protocol does not need special nodes to keep indices of sharing files, thus eliminating the index maintenance overhead and the potential for inconsistency between index records and peer file contents. We have evaluated our techniques in a browser-sharing environment. We show that the average increase in response time caused by our protocols is negligible, and these protocols show advantages over existing protocols in a P2P system.
Title: A Protocol for Scalable Anonymous Communication
Author Name Rob Sherwood Bobby Bhattacharjee Aravind Srinivasan
Year: SEPTEMBER 2002
Abstract
We present a protocol for anonymous communication over the Internet. Our protocol, called P5 (Peer-to-Peer Personal Privacy Protocol) provides sender-, receiver-, and sender-receiver anonymity. P5 is designed to be implemented over the current Internet protocols, and does not require any special infrastructure support. A novel feature of P5 is that it allows individual participants to trade-off degree of anonymity for communication efficiency, and hence can be used to scalable implement large anonymous groups. We present a description of P5, an analysis of its anonymity and communication efficiency, and evaluate its performance using detailed packet-level simulations.
Abstract
Data transfer over TCP/IP provides no privacy for network users. Previous research in anonymity has focused on the provision of initiator anonymity. We explore methods of adapting existing initiator-anonymous protocols to provide responder anonymity and mutual anonymity. We present Anonymous Peer-to-peer File Sharing (APFS) protocols, which provide mutual anonymity for peer-to-peer file sharing. APFS addresses the problem of long-lived Internet services that may outlive the degradation present in current anonymous protocols. One variant of APFS makes use of uncast communication, but requires a central coordinator to bootstrap the protocol. A second variant takes advantage of multicast routing to remove the need for any central coordination point. We compare the TCP performance of APFS protocol to existing overt file sharing systems such as Napster. In providing anonymity, APFS can double transfer times and requires that additional traffic be carried by peers, but this overhead is constant with the size of the session.
Abstract-
We quantify the effectiveness of random walks for searching and construction of unstructured peer-to-peer (P2P) networks. We have identified two cases where the use of random walks for searching achier better results than Hooding: a) when the overlay topology is clustered, and h) when a client re-issues the same query while its liorizon does not change much. For construction, we a r p e that an expander can he maintained dynamically with constant operations per addition. The key teelinical ingredient of our approach is a deep result of stnehastic processes indicating that samples taken from consecutive steps of a random walk can achieve statistical properties similar to independent sampling (if the second eigen value of the transition matrix is hounded away from 1, which translates to good expansion of the network; such connectivity is desired, and Believed to Iiold, in every reasonable network and network model). This property has been previously used in complexity Theory for constriction of pseudorandom number generators. We reveal another facet of this theory and translate savings in Random hits to savings in processing overhead. Keywords: Peer-to-Peer networks. Statistics, Random Walks, Graph Theory
Abstract
—Peer-to-peer and other decentralized, distributed systems are known to be particularly vulnerable to sybil attacks. In a sybil attack, a malicious user obtains multiple fake identities and pretends to be multiple, distinct nodes in the system. By controlling a large fraction of the nodes in the system, the malicious user
is able to “out vote” the honest users in collaborative tasks such as Byzantine failure defenses. This paper presents SybilGuard, a novel protocol for limiting the corruptive influences of sybil attacks. Our protocol is based on the “social network” among user identities, where an edge between two identities indicates a human-established trust relationship. Malicious users can create many identities but few trust relationships. Thus, there is a disproportionately small “cut” in the graph between the sybil nodes and the honest nodes. SybilGuard exploits this property to bound the number of identities a malicious user can create.We show the effectiveness of SybilGuard both analytically and experimentally.
EXISTING SYSTEM
Existing anonymity approaches are mainly path-based: peers have to pre-construct an anonymous path before transmission. The overhead of maintaining and updating such paths is significantly high. Existing works, for example P5, employ the flooding pattern, which is not suitable for P2P systems due to the huge traffic overhead. The end-to-end delivery, which is used by the path-based approaches, however, may compromise the anonymity of the initiator or responder, as the destinations of the delivered messages has to be known in advance.
DRAWBACK IN EXISTING SYSTEM
Huge traffic overhead
Delay Transaction
PROPOSED SYSTEM
We propose a lightweight and non-path-based mutual anonymity protocol for P2P systems, Rumor Riding (RR).Employing a random walk concept, RR issues key rumors and cipher rumors separately, and expect that they meet in some random peers. The results of trace-driven simulations and simple implementations show that RR provides a high degree of anonymity and outperforms existing approaches in terms of reducing the traffic overhead and processing latency.
ADVANTAGES IN PROPOSED SYSTEM
The overhead of maintaining and updating such paths is significantly Low.
Efficient Transaction
Initiator Request
First initiator can get all client or peer details form server. The initiator is going to check whether file available or not. If any client has initiator file that client act as a Responder and other client act as Sower. The initiator send request to Responder. Initiator send the Decryption key and encrypted data or request to Sower (proxy).Sower is going to be verifying the both key . If both key is valid the data will decrypt and the decrypted data is going to send the particular client
Responder response
Server send the Decryption key and encrypted data to the client and Sower (proxy).After getting the data and key the Client should send the Decryption Key to Sower. Sower is going to be verifying the both key client. If both key is valid the data will decrypt and the decrypted data is going to send the particular client. Rumor Riding (RR).Employing a random walk concept, RR issues key rumors and cipher rumors separately, and expect that they meet in some random peers. The results of trace-driven simulations and simple implementations show that RR provides a high degree of anonymity and outperforms existing approaches in terms of reducing the traffic overhead and processing latency. In this module we designed the server which randomly generate the Key, at the same time all the other processes also handling in this module. The processes of the server are doing encryption through encryption key.
Server is going to monitor only Sower, no need to monster client. Couriers or other secure means are not needed to transmit keys, since a message can be enciphered using an encryption key publicly revealed by the intended recipient. Only he can decipher the message, since only he knows the corresponding decryption key. 2. A message can be signed" using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key.
Sower Response
After getting all details about client and encrypted data, it will waiting for client Decryption key after receiving Decryption key from client Sower. Sower is going to decrypt the data and send to the particular client. If any hacker hack the Decryption key they cannot get encrypted data from Sower .because Sower doesn’t have details about hacker. If any hacker hack the encrypted data they cannot get decrypted data from Sower .because need Decryption. The results of trace-driven simulations and simple implementations show that RR provides a high degree of anonymity and outperforms existing approaches in terms of reducing the traffic overhead and processing latency. We also discuss how RR can effectively defend against various attacks. Future and ongoing work includes accelerating the query speed, introducing mimic traffic to infuse attackers We will also investigate other security properties of RR, such as the unlink ability, information leakage, and failure tolerance when facing different attacks. It would also be interesting to explore the possibility of implementing this lightweight protocol in other distributed systems, such as grid systems and ad-hoc networks