National Conference on Architecture, Software systems and Green computing-2013(NCASG2013)
Kalyana Chakravarthy. M
1
,
Master of Science (Computer Networks)
Department of Computer Networks,
Kumaran.T
2
,
Assistant Professor,
Department of Computer Science and Engineering
Manipal University kalyanachakravarthymurthy@gmail.com
Aarupadai Veedu Institute of Technology
Kumaran_ssn@yahoo.co.in
Abstract: Even though ano nymizing 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 preconstruct an anonymous path before transmission.
Proposing Rumor Riding (RR), a lightweight mutual anonymity protocol for decentralized P2P systems. RR employs a random walk scheme – frees the peers from the heavy load of path construction. Previous RSAbased anonymity approaches, RR also takes advantage of lower cryptographic overhead by mainly utilizing a symmetric cryptographic algorithm to achieve anonymity.
Keywords: Peer-to-Peer (P2P) systems, anonymous path, mutual anonymity, random walk
1.
In distributed and decentralized P2P environments, the individual users cannot rely on a trusted and centralized authority. Peer-to-Peer Networks such as Direct connect,
BitTorrent, Mininova, eDonkey, Demonoid have become essential media for information dissemination and sharing over the Internet. This project is mainly used to provide the anonymity. Recently, P2P users have encountered problems caused by being traced on non-anonymous P2P systems due to their plain-text query messages and directdownloading behaviors. Hence, the requirement for anonymity has become increasingly essential in current
P2P applications for both content requesters and providers. For this reasons I proposed Rumor Riding design pattern. It fully based on non-path based approach.
It eliminates the huge overhead of path construction and maintenance.
2.
I NTRODUCTION
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. a.
Extend the length of anonymous paths, as a longer path entails a higher degree of anonymity. b.
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.
2.1
DISADVANTAGES
Memory high cost for initiator both the collection of information and the preparation of packets incur high costs. In existing system based on asymmetric algorithm,
It too overhead and difficult to maintenance. If destination node failed whole path will be failed. Path based approach is very unreliable, and users have to frequently probe the path and retransmit messages.
3.
PROPOSED SYSTEM
Non path-based anonymous P2P protocol called
Rumor Riding (RR).
Design goal is twofold:
Eliminate the huge overhead of path construction and maintenance.
Use a symmetric cryptographic algorithm to replace the asymmetric one so as to reduce the cryptographic overhead.
We design a lightweight mutual anonymous P2P protocol, RR, in which anonymous paths are automatically constructed via the rumors’ random walks. So it reduce the memory management cost for initiator. Encrypt the query message with a symmetric key. Key and the cipher text take random walks separately in the system, where each walk is called a Rumor. 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. Agent passes the request to all the hosts in the network. And the host which is having the data will respond to that query. Agent gets the data from server and sends the data to the requester.
3.1 ADVANTAGES
Propose Rumor Riding design pattern to provide anonymity. It fully based on non-path based approach. In
Rumor pattern symmetric algorithm for encrypt and decrypt the query. It will reduce the overhead and also maintenance cost. Design a lightweight mutual anonymous P2P protocol, RR, in which anonymous paths are automatically constructed via the rumors’ random
ISBN NO: 978-93-80609-14-0

National Conference on Architecture, Software systems and Green computing-2013(NCASG2013) walks. So it reduces the memory management cost for initiator.
4.
SYSTEM ARCHITECTURE
A system architecture or systems architecture is the conceptual design that defines the structure and/or behavior of a system. An architecture description is a formal description of a system, organized in a way that supports reasoning about the structural properties of the system. It defines the system components or building blocks and provides a plan from which products can be procured, and systems developed, that will work together to implement the overall system. This may enable one to manage investment in a way that meets business needs.
The fundamental organization of a system, embodied in its components, their relationships to each other and the environment, and the principles governing its design and evolution. The composite of the design architectures for products and their life cycle processes. done so that there would be no node duplication. Then I identify the source and the destinations.
5.2 Rumor Generation and recovery
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.
RR employs the AES algorithm to encrypt original messages. The key size is 128-bit. To determine whether a pair of cipher and key rumors hit, I employ a Cyclic
Redundancy Check (CRC) function to attach a CRC value.
It organizes the key and the cipher text into two query rumors. Each packet is labeled with a Descriptor ID, a string that uniquely identifies the packet. RR also uses the descriptors to identify rumors.
A representation of a system in which there is a mapping of functionality onto hardware and software components, a mapping of the software architecture onto the hardware architecture, and human interaction with these components. An allocated arrangement of physical elements which provides the design solution for a consumer product or life-cycle process intended to satisfy the requirements of the functional architecture and the requirements baseline. Architecture is the most important, pervasive, top-level, strategic inventions, decisions, and their associated rationales about the overall structure (i.e., essential elements and their relationships) and associated characteristics and behavior.
5.
MODULE SPECIFICATION
5.1 Topology Construction
In this module, I construct a topology structure. Here we use mesh topology because of its unstructured nature.
Topology is constructed by getting the names of the nodes and the connections among the nodes as input from the user. While getting each of the nodes, their associated port and IP address is also obtained. For successive nodes, the node to which it should be connected is also accepted from the user. While adding nodes, comparison will be
5.3 Query issuance and response
For received key rumors and cipher rumors, the sower uses AES to recover a message and the checksum CRC. It then performs the CRC function to the recovered message and compares the result with CRC.
If they match, the sower S is aware that it has successfully recovered a message. The purpose of the CRC function is to avoid using a complex text understanding technique to distinguish a meaningful Message.
If a decrypted rumor holds a plaintext matching the CRC value, q will be successfully recovered. Whatever there is a match or not, this intermediate node reduces the TTL value of the received rumor by one, keeps a temporary record containing the ID of the rumor in the local cache, and forwards it to a randomly chosen neighbor. The procedure continues until the TTL value of this rumor is reduced to zero.
ISBN NO: 978-93-80609-14-0

National Conference on Architecture, Software systems and Green computing-2013(NCASG2013)
5.4 Query Confirm and File Delivery
RR requires every node to temporarily keep a local cache to store the received rumors. When a node receives a query key rumor, it performs the rumor recovery procedure to check all cached cipher rumors.
If a decrypted rumor holds a plaintext matching the CRC value, q will be successfully recovered.
The large data cipher rumor and the small data key rumor first take random walks to meet each other at a sower , and eventually reach along the reversed paths of initiator.
Upon receiving the digital envelop, recovers the desired file using its private key.
Anonymous Communications Systems,” ACM Trans.
Information and System Security, vol. 7, no. 4, pp. 489-
522, Nov. 2004.
[3] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker,
“Search and Replication in Unstructured Peer-to-Peer
Networks,” Proc. 16th ACM Int’l Conf. Supercomputing, pp. 84-95, 2002.
[4] R. Dingledine, N. Mathewson, and P. Syverson, “Tor:
The Second-Generation Onion Router,” Proc. 13th
USENIX Security Symp.,pp. 303-320, 2004.
[5] S. Sen and J. Wang, “Analyzing Peer-to-Peer Traffic across Large Networks,” IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 219- 232, Apr. 2004.
[6] S.J. Murdoch and G. Danezis, “Low-Cost Traffic
Analysis of Tor,” Proc. IEEE Symp. Security and Privacy,
2005.
[7] V. Scarlata, B.N. Levine, and C. Shields, “Responder
Anonymityand Anonymous Peer-to-Peer File Sharing,”
Proc. IEEE Int’l Conf.Network Protocols (ICNP), pp. 272-
280, Nov. 2001.
[8] Y. Liu, L. Xiao, X. Liu, L.M. Ni, and X. Zhang,
“Location Awareness in Unstructured Peer-to-Peer
Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 2, pp. 163-174, Feb.
7. CONCLUSION
Existing anonymity approaches are mainly path-based.
Peers have to recruit middle nodes and construct paths before transmissions. The overhead of maintaining and updating the paths is also significantly high. In this paper,
I propose a lightweight and non-path-based mutual anonymity protocol for unstructured P2P systems, Rumor
Riding (RR). Employing a random walk concept, RR issues key rumors and cipher rumors separately, and expects that they meet in several random peers. The results of extensive trace-driven simulations show that RR provides a high degree of anonymity and outperforms existing approaches in traffic overhead and processing latency. I also discuss how RR can effectively defend against popular attacks. The early experience of our prototype implementation shows its practicality.
8. REFERENCES
[1] H. Yu, M. Kaminsky, P.B. Gibbons, and A. Flaxman,
“SybilGuard: Defending against Sybil Attacks via Social
Networks,” IEEE/ACM Trans. Networking, vol. 16, no. 3, pp. 576-589, June 2008.
[2] M.K. Wright, M. Adler, B.N. Levine, and C. Shields,
“The Predecessor Attack: An Analysis of a Threat to
ISBN NO: 978-93-80609-14-0