Security applications of peer-to-peer networks

Vlachos, Vasileios; Androutsellis-Theotokis, Stephanos; Spinellis, Diomidis

doi:10.1016/j.comnet.2004.01.002

Cited by 40 publications

(19 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…NetBiotic. NetBiotic [Vlachos et al 2004] is a distributed CIDS that is based on the JXTA P2P framework [Gong 2001]. The focus of NetBiotic is not on detecting specific attacks, but rather on the fast creation of a network of interested peers for alert information exchange.…”

Section: Unstructured Cidssmentioning

confidence: 99%

Taxonomy and Survey of Collaborative Intrusion Detection

et al. 2015

View full text Add to dashboard Cite

The dependency of our society on networked computers has become frightening: In the economy, all-digital networks have turned from facilitators to drivers; as cyber-physical systems are coming of age, computer networks are now becoming the central nervous systems of our physical world-even of highly critical infrastructures such as the power grid. At the same time, the 24/7 availability and correct functioning of networked computers has become much more threatened: The number of sophisticated and highly tailored attacks on IT systems has significantly increased. Intrusion Detection Systems (IDSs) are a key component of the corresponding defense measures; they have been extensively studied and utilized in the past. Since conventional IDSs are not scalable to big company networks and beyond, nor to massively parallel attacks, Collaborative IDSs (CIDSs) have emerged. They consist of several monitoring components that collect and exchange data. Depending on the specific CIDS architecture, central or distributed analysis components mine the gathered data to identify attacks. Resulting alerts are correlated among multiple monitors in order to create a holistic view of the network monitored. This article first determines relevant requirements for CIDSs; it then differentiates distinct building blocks as a basis for introducing a CIDS design space and for discussing it with respect to requirements. Based on this design space, attacks that evade CIDSs and attacks on the availability of the CIDSs themselves are discussed. The entire framework of requirements, building blocks, and attacks as introduced is then used for a comprehensive analysis of the state of the art in collaborative intrusion detection, including a detailed survey and comparison of specific CIDS approaches.

show abstract

Section: Unstructured Cidssmentioning

confidence: 99%

Taxonomy and Survey of Collaborative Intrusion Detection

et al. 2015

View full text Add to dashboard Cite

show abstract

“…(However, despite a large churn rate, these studies also show that the total number of peers in the network is relatively stable.) P2P algorithms have been proposed for a wide variety of tasks such as data storage and retrieval [45,19,18,14,26], collaborative filtering [11], spam detection [15], data mining [17], worm detection and suppression [38,59], privacy protection of archived data [23], and recently, for cloud computing services as well [57,8]. However, all algorithms proposed for these problems have no theoretical guarantees of being able to work in a dynamically changing network with a very high churn rate, which can be as much as linear (in the network size) per round.…”

Section: Introductionmentioning

confidence: 99%

Storage and search in dynamic peer-to-peer networks

Augustine

Molla

Morsy

et al. 2013

Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

We study robust and efficient distributed algorithms for searching, storing, and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave the network continuously over time). Our goal is to guarantee, despite high node churn rate, that a large number of nodes in the network can store, retrieve, and maintain a large number of data items. Our main contributions are fast randomized distributed algorithms that guarantee the above with high probability even under high adversarial churn. In particular, we present the following main results:1. A randomized distributed search algorithm that with high probability guarantees that searches from as many as n − o(n) nodes (n is the stable network size) succeed in O(log n)-rounds despite O(n/ log 1+δ n) churn, for any small constant δ > 0, per round. We assume that the churn is controlled by an oblivious adversary (that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm).2. A storage and maintenance algorithm that guarantees, with high probability, data items can be efficiently stored (with only Θ(log n) copies of each data item) and maintained in a dynamic P2P network with churn rate up to O(n/ log 1+δ n) per round. Our search algorithm together with our storage and maintenance algorithm guarantees that as many as n − o(n) nodes can efficiently store, maintain, and search even under O(n/ log 1+δ n) churn per round. Our algorithms require only polylogarithmic in n bits to be processed and sent (per round) by each node.To the best of our knowledge, our algorithms are the first-known, fully-distributed storage and search algorithms that provably work under highly dynamic settings (i.e., high churn rates per step). Furthermore, they are localized (i.e., do not require any global topological knowledge) and scalable. A technical contribution of this paper, which may be of independent interest, is

show abstract

“…A number of different applications based on peer-topeer infrastructures have emerged for supporting a variety of Internet services. Examples of such applications include peer-to-peer multicast systems [VanRenesse et al 2003;, Internet indirection infrastructures , and security applications, providing protection against denial of service or virus attacks [Keromytis et al 2002;Janakiraman et al 2003;Vlachos et al 2004].…”

Section: Classification Of Peer-to-peer Applicationsmentioning

confidence: 99%

A survey of peer-to-peer content distribution technologies

Androutsellis-Theotokis

2004

Self Cite

View full text Add to dashboard Cite

Distributed computer architectures labeled "peer-to-peer" are designed for the sharing of computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring the intermediation or support of a centralized server or authority. Peer-to-peer architectures are characterized by their ability to adapt to failures and accommodate transient populations of nodes while maintaining acceptable connectivity and performance.Content distribution is an important peer-to-peer application on the Internet that has received considerable research attention. Content distribution applications typically allow personal computers to function in a coordinated manner as a distributed storage medium by contributing, searching, and obtaining digital content.In this survey, we propose a framework for analyzing peer-to-peer content distribution technologies. Our approach focuses on nonfunctional characteristics such as security, scalability, performance, fairness, and resource management potential, and examines the way in which these characteristics are reflected in-and affected by-the architectural design decisions adopted by current peer-to-peer systems.We study current peer-to-peer systems and infrastructure technologies in terms of their distributed object location and routing mechanisms, their approach to content replication, caching and migration, their support for encryption, access control, authentication and identity, anonymity, deniability, accountability and reputation, and their use of resource trading and management schemes.

show abstract

Security applications of peer-to-peer networks

Cited by 40 publications

References 17 publications

Taxonomy and Survey of Collaborative Intrusion Detection

Taxonomy and Survey of Collaborative Intrusion Detection

Storage and search in dynamic peer-to-peer networks

A survey of peer-to-peer content distribution technologies

Contact Info

Product

Resources

About