27-03-2012, 12:04 AM
respected sir,myself Rakshitha,m in my final yr engineering of ISE branch,
i m in need of the ppt of rumor riding anonymizing unstructured peer to peer systems for my seminar!!!!! as soon as possible!!
27-03-2012, 12:04 AM
respected sir,myself Rakshitha,m in my final yr engineering of ISE branch, i m in need of the ppt of rumor riding anonymizing unstructured peer to peer systems for my seminar!!!!! as soon as possible!!
27-03-2012, 09:39 AM
to get information about the topic "rumor riding anonymizing unstructured peer to peer systems" related topic refer the link bellow
https://seminarproject.net/Thread-rumor-...stems-java
12-04-2012, 03:12 PM
explain the concept using rumor ridding unstructure peer to peer system send ppt
02-07-2012, 01:53 PM
Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems ORGANIZATION PROFILE: Vedha Technologies is a leading global consulting and IT Service Company, offering a wide array of solutions customized for a range of key verticals and horizontals. We are the preferred choice for many worldwide - whether it is Development or Training. Vedha Technologies has been established to take up the challenging world of IT Development. Vedha Technologies has been set up with the pure thought of developing software products and satisfying our customers to the peak. Abstract: Although anonym zing Peer-to-Peer (P2P) systems often incurs extra costs in terms of transfer efficiency, 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. The overhead of maintaining and updating such paths is significantly high. In this paper, we propose Rumor Riding (RR), a lightweight mutual anonymity protocol for decentralized P2P systems. RR employs a random walk scheme which frees initiating peers from the heavy load of path construction. Compared with previous RSA-based anonymity approaches, RR also takes advantage of lower cryptographic overhead by mainly utilizing a symmetric cryptographic algorithm to achieve anonymity. We demonstrate the effectiveness of this design through trace-driven simulations. The analytical and experimental results show that RR is more efficient than existing protocols. Introduction: In this project mainly used to provide the anonymity. Recently, a number of P2P users have encountered problems caused by being traced on non-anonymous P2P systems due to their plain-text query messages and direct-downloading behaviors. Hence, the requirement for anonymity has become increasingly essential in current P2P applications for both content requesters and providers. For this reasons we proposed rumor riding design pattern. It fully based on non-path based approach. it eliminate the huge overhead of path construction and maintenance. A Mutual Anonymous Peer-to-peer Protocol Design: In this paper, we propose a mutual anonymity protocol, called Secret-sharing-based Mutual Anonymity Protocol (SSMP), for decentralized P2P systems. SSMP employs Shamirs’ secret sharing scheme to allow peers to issue queries and responders to deliver requested files anonymously. Compared with previous designs, SSMP achieves mutual anonymity in P2Psystems with a high degree of anonymity and a low cryptography processing overhead. There are two major architectures for P2P systems: centralized and decentralized. A centralized P2P system, such as Napster, is vulnerable to denial of service attacks and suffering from a single point of failure. Decentralized P2P systems, which have the advantages of high fault-tolerance, sufficient autonomy, and flexible scalability, are widely deployed. First, a peer’s identity is exposed to all its neighbors. Some malicious peers can acquire information easily by monitoring packet flows, distinguishing packet types, and analyzing the TTL value of these queries. In this way, initiators and responders are not anonymous to their neighbors and P2P systems fail to provide anonymity in each peer’s local environment. Second, in the query and reply packet transfer path, there are high risks that the identities of both the initiators and responders are exposed. In an untrustworthy public network, when the files are transferred in a plain text model, the contents of the files also help the attackers on the path guess the identities of the communication parties. Existing System: Path-based approaches, users usually need to construct anonymous paths before transmissions. Data is pre-wrapped by the initiator in a layered-encryption packet, which will be peeled off along the path to the receiver. Paths require users to obtain a large number of IP addresses and public keys. Initiators have to periodically update middle nodes along the anonymous paths - increase the maintenance and update overhead. o Extend the length of anonymous paths, as a longer path entails a higher degree of anonymity. o An invariable path might otherwise become increasingly vulnerable under the analysis of attackers. Dynamic P2P systems, peers randomly join and leave. Node goes offline, the whole path fails. Proposed System: we propose a non path-based anonymous P2P protocol called Rumor Riding (RR). The design goal is twofold: first, to eliminate the huge overhead of path construction and maintenance; second, to use a symmetric cryptographic algorithm to replace the asymmetric one so as to reduce the cryptographic overhead and make the protocol more practical. we first let an initiator encrypt the query message with a symmetric key, and then send the key and the cipher text to different neighbors. The key and the cipher text take random walks separately in the system, where each walk is called a rumor. Once a key rumor and a cipher rumor meet at some peer, the peer is able to recover the original query message and act as an agent to issue the query for the initiator. A similar idea is also employed during the query response, confirm, and file delivery processes. |
|