May I sleep in your bed? Getting permission to book

Potential Security Issues in a Peer-to-Peer Network from a Database Perspective

Peer-to-Peer Computing ◽

10.4018/978-1-59140-429-3.ch006 ◽

2011 ◽

pp. 131-144

Author(s):

Sridhar Asvathanarayanan

Keyword(s):

Denial Of Service ◽

Database Security ◽

Vital Role ◽

Peer To Peer ◽

Peer Networks ◽

Distributed Denial Of Service ◽

Security Issues ◽

Peer Network ◽

Peer To Peer Networks ◽

Peer To Peer Network

Computing strategies have constantly undergone changes, from being completely centralized to client-servers and now to peer-to-peer networks. Databases on peer-to-peer networks offer significant advantages in terms of providing autonomy to data owners, to store and manage the data that they work with and, at the same time, allow access to others. The issue of database security becomes a lot more complicated and the vulnerabilities associated with databases are far more pronounced when considering databases on a peer-to-peer network. Issues associated with database security in a peer-to-peer environment could be due to file sharing, distributed denial of service, and so forth, and trust plays a vital role in ensuring security. The components of trust in terms of authentication, authorization, and encryption offer methods to ensure security.

Download Full-text

Data Dissemination and Query Routing in Mobile Peer-to-Peer Networks

Mobile Peer-to-Peer Computing for Next Generation Distributed Environments ◽

10.4018/978-1-60566-715-7.ch002 ◽

2010 ◽

pp. 26-49

Author(s):

Thomas Repantis ◽

Vana Kalogeraki

Keyword(s):

High Probability ◽

Data Dissemination ◽

Peer To Peer ◽

Peer Networks ◽

Query Routing ◽

Data Propagation ◽

Peer Network ◽

Peer To Peer Networks ◽

Routing Mechanism ◽

Peer To Peer Network

In this chapter the authors study the problems of data dissemination and query routing in mobile peerto- peer networks. They provide a taxonomy and discussion of existing literature, spanning overlay topologies, query routing, and data propagation. They proceed by proposing content-driven routing and adaptive data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile users. In the authors’ mechanism, nodes build content synopses of their data and adaptively disseminate them to their most appropriate peers. Based on the content synopses, a routing mechanism is being built, to forward the queries to those peers that have a high probability of providing the desired results. The authors provide an experimental evaluation of different dissemination strategies, which shows that content-driven routing and adaptive data dissemination is highly scalable and significantly improves resource usage.

Download Full-text

Potential Security Issues in a Peer-to-Peer Network from a Database Perspective

Information Security and Ethics ◽

10.4018/978-1-59904-937-3.ch073 ◽

2008 ◽

pp. 1070-1079

Author(s):

Sridhar Asvathanarayanan

Keyword(s):

Denial Of Service ◽

Database Security ◽

Vital Role ◽

Peer To Peer ◽

Peer Networks ◽

Distributed Denial Of Service ◽

Security Issues ◽

Peer Network ◽

Peer To Peer Networks ◽

Peer To Peer Network

Computing strategies have constantly undergone changes, from being completely centralized to client-servers and now to peer-to-peer networks. Databases on peer-to-peer networks offer significant advantages in terms of providing autonomy to data owners, to store and manage the data that they work with and, at the same time, allow access to others. The issue of database security becomes a lot more complicated and the vulnerabilities associated with databases are far more pronounced when considering databases on a peer-to-peer network. Issues associated with database security in a peer-to-peer environment could be due to file sharing, distributed denial of service, and so forth, and trust plays a vital role in ensuring security. The components of trust in terms of authentication, authorization, and encryption offer methods to ensure security.

Download Full-text

Peer-to-Peer Networks as Extensions of Web-Based Education - Handhelds in Support of Coordination and Autonomy

Web-Based Education ◽

10.4018/978-1-59140-102-5.ch007 ◽

2011 ◽

pp. 105-119

Author(s):

Malu Roldan

Keyword(s):

Rapid Evolution ◽

Peer To Peer ◽

Peer Networks ◽

Handheld Devices ◽

Web Based ◽

Handheld Computing ◽

Peer Network ◽

Microsoft Corporation ◽

Peer To Peer Networks ◽

Peer To Peer Network

In recent years, we have witnessed the rapid evolution of handheld computing devices from leading manufacturers, somewhat fueled by a battle being waged between Palm Computing and Microsoft Corporation. Handheld devices are attractive for educational settings, because they are inexpensive, portable, and customizable. Furthermore, most handheld devices come “out of the box” with infrared ports, enabling them to automatically form a peer-to-peer network with other handhelds. In this chapter, how such peer-to-peer networks could support the interplay of autonomy and coordination underlying current and emerging learning models will be discussed. Findings from a pilot study suggest that the information management and connectivity features of the machines make them ideal devices for such learning environments. The entertainment capabilities of the devices motivate students to learn how to use them. However, students found the machines and add-ons expensive, limited in capability, and difficult to use.

Download Full-text

Correlation Trust Authentication Model for Peer-to-Peer Networks

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.756-759.2237 ◽

2013 ◽

Vol 756-759 ◽

pp. 2237-2242

Author(s):

Wei Cheng ◽

Zhen Hua Tan

Keyword(s):

Service Provider ◽

Peer To Peer ◽

Peer Networks ◽

Communication History ◽

Peer Network ◽

Peer To Peer Networks ◽

Similarity Calculation ◽

History Of ◽

Trust Metric ◽

Peer To Peer Network

A requester node requesting a service in a peer to peer network transmits a request to a service provider node. The request may include a communication history of the requester node identifying other nodes with which the requester node has previously communicated. The service provider node authenticates the requester node based on the communication history. The service provider node may ask other nodes with which the requester node has communicated for evaluation of the requester node. The other nodes may calculate a trust metric of the requester node and provide this metric to the service provider node. The service provider node may use this trust metric in combination with a similarity calculation of the requester node and the service provider node to make a determination whether the requester node is to be authenticated. The service provider node may evaluate the requester node and store the evaluation in its communication history.

Download Full-text

Data Dissemination and Query Routing in Mobile Peer-to-Peer Networks

Networking and Telecommunications ◽

10.4018/978-1-60566-986-1.ch025 ◽

2010 ◽

pp. 371-394

Author(s):

Thomas Repantis ◽

Vana Kalogeraki

Keyword(s):

High Probability ◽

Data Dissemination ◽

Peer To Peer ◽

Peer Networks ◽

Query Routing ◽

Data Propagation ◽

Peer Network ◽

Peer To Peer Networks ◽

Routing Mechanism ◽

Peer To Peer Network

In this chapter the authors study the problems of data dissemination and query routing in mobile peerto- peer networks. They provide a taxonomy and discussion of existing literature, spanning overlay topologies, query routing, and data propagation. They proceed by proposing content-driven routing and adaptive data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile users. In the authors’ mechanism, nodes build content synopses of their data and adaptively disseminate them to their most appropriate peers. Based on the content synopses, a routing mechanism is being built, to forward the queries to those peers that have a high probability of providing the desired results. The authors provide an experimental evaluation of different dissemination strategies, which shows that content-driven routing and adaptive data dissemination is highly scalable and significantly improves resource usage.

Download Full-text

Bitcoin and modern alchemy: in code we trust

Journal of Financial Crime ◽

10.1108/jfc-11-2013-0067 ◽

2015 ◽

Vol 22 (2) ◽

pp. 156-169 ◽

Cited By ~ 13

Author(s):

Jeffrey Simser

Keyword(s):

Money Laundering ◽

Computer Code ◽

Peer To Peer ◽

Virtual Currency ◽

Content Type ◽

Peer Network ◽

Peer To Peer Networks ◽

Asset Forfeiture ◽

Transactional Costs ◽

Peer To Peer Network

Purpose – This paper aims to explore the challenge posed by Bitcoin to regulators, particularly anti-money laundering regulators. Bitcoin is a crypto-currency based on open-source software and protocols that operates in peer-to-peer networks as a private irreversible payment mechanism. The protocol allows cross-border payments, for large and small items, with little or no transactional costs. Design/methodology/approach – Case studies and case law are examined as are relevant reports by regulators. Findings – Bitcoin is based on complex computer code supported by a robust community in a peer-to-peer network. Unlike other virtual currencies, Bitcoin appears to have obtained purchase and as such poses unique challenges to regulators. Research limitations/implications – Bitcoin is at a nascent stage and the evolution of the virtual currency is difficult to predict. Practical implications – Those who study financial systems, anti-money laundering regimes and asset forfeiture laws will have an interest in this topic. Originality/value – This is a new and emerging currency; there is limited literature on the implications of this currency to anti-money laundering systems.

Download Full-text

Probabilistic Proximity-aware Resource Location in Peer-to-Peer Networks Using Resource Replication

International Journal of Computers Communications & Control ◽

10.15837/ijccc.2010.4.2492 ◽

2010 ◽

Vol 5 (4) ◽

pp. 418 ◽

Cited By ~ 3

Author(s):

Morteza Analoui ◽

Mohsen Sharifi ◽

Mohammad Hossein Rezvani

Keyword(s):

Peer To Peer ◽

Large Network ◽

Resource Location ◽

Location Services ◽

Distributed Caching ◽

Peer Network ◽

Peer To Peer Networks ◽

Digital Contents ◽

Caching Scheme ◽

Peer To Peer Network

Nowadays, content distribution has received remarkable attention in distributed computing researches and its applications typically allow personal computers, called peers, to cooperate with each other in order to accomplish distributed operations such as query search and acquiring digital contents. In a very large network, it is impossible to perform a query request by visiting all peers. There are some works that try to find the location of resources probabilistically (i.e. non-deterministically). They all have used inefficient protocols for finding the probable location of peers who manage the resources. This paper presents a more efficient protocol that is proximity-aware in the sense that it is able to cache and replicate the popular queries proportional to distance latency. The protocol dictates that the farther the resources are located from the origin of a query, the more should be the probability of their replication in the caches of intermediate peers. We have validated the proposed distributed caching scheme by running it on a simulated peer-to-peer network using the well-known Gnutella system parameters. The simulation results show that the proximity-aware distributed caching can improve the efficiency of peer-to-peer resource location services in terms of the probability of finding objects, overall miss rate of the system, fraction of involved peers in the search process, and the amount of system load.

Download Full-text