The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Peer sampling - the capability of obtaining a random sample from a large population of peers - is a basic building block for the gossip paradigm. Current peer sampling services have been designed for ''first-class'' citizens of the Internet: peers that are able to accept incoming, sporadic connections. Unfortunately, the vast majority of peers do not belong to this class, as they are behind firewalls...
In the wake of the success of peer-to-peer networking, privacy has arisen as a big concern. Even though steps have been taken in order to attain an anonymous communications channel, all approaches consider the overlay network as a single entity and none of them take into account peer group based environments. In this paper, we describe a method in order to maintain unlinkability in group membership...
We discuss how the notion of gradual information disclosure can be incorporated into basic social computing protocols, such as reputation based service selection. Our technique links the decrease in anonymity a subject is ready to endure (e.g., by disclosing the values of some of her attributes) to the weight her views will carry in the final outcome of the protocol.
In peer-to-peer (P2P) systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third authorities to mediate the interactions. A peer will need reputation mechanisms by self-experiencing and incorporating the knowledge of other peers to decide whether to trust another peer in P2P systems. On the basis of introduction on the trust properties and common problems...
Threats against computer networks evolve very fast and require more and more complex measures. We argue that teams respectively groups with a common purpose for intrusion detection and prevention improve the measures against rapid propagating attacks similar to the concept of teams solving complex tasks known from field of work sociology. Collaboration in this sense is not easy task especially for...
We developed a model to investigate the phenomenon of whitewashing in peer-to-peer (P2P) systems. A white washer is a node that leaves the network and re-joins using a different identity. Whitewashing is a common problem in P2P systems and is a difficult to manage properly for reputable systems. The paper discusses the definition and properties of trust, formally represents the node by the labeled...
A federated identity management system extends identity information across multiple security domains. It is an enabler for sharing information and services among organizations while respecting the authorization decisions of each organization. Federation can be realized in two ways: (1) Conventional federation that is based on a multilateral agreement among participants and (2) peer-to-peer (P2P) federation...
Effective security mechanisms are essential to the widespread deployment of pervasive systems. Much of the research focus on security in pervasive computing has revolved around distributed trust management. While such mechanisms are effective in specific environments, there is no generic framework for deploying and extending these mechanisms over a variety of pervasive systems. We present the design...
Online Social Networks like Facebook, MySpace, Xing, etc. have become extremely popular. Yet they have some limitations that we want to overcome for a next generation of social networks: privacy concerns and requirements of Internet connectivity, both of which are due to web-based applications on a central site whose owner has access to all data. To overcome these limitations, we envision a paradigm...
Peer-to-peer (p2p) networking technology has gained popularity as an efficient mechanism for users to obtain free services without the need for centralized servers. Protecting these networks from intruders and attackers is a real challenge. One of the constant threats on P2P networks is the propagation of active worms. In 2007, Worms have caused damages worth the amount of 8,391,800 USD in the United...
Structured peer-to-peer networks overlay provide a substrate for the contribution of scalability, load balance, decentralization, and availability. However, new nodes are confronted with hijacking attacks on the peer-to-peer overlay with attackers. This paper proposes a model that the malicious nodes can not modify messages over the links and therefore can not control identifiers of correct nodes...
We analyse different worm and patch propagation models along with the ones we have developed and evaluated as a part of our ongoing passive P2P worm & patch modelling project. This is followed by a brief discussion on worm detection mechanisms proposed by various authors. Towards the very end of this article, we propose a distributed framework for passive worm throttling in P2P networks and discuss...
In P2P file-sharing applications, distributed virtual payment mechanism is designed to encourage resource sharing among peers and thus restrain free-riding behaviors. However, it does not provide any protection on the security of the transaction process and the quality of the trading contents. We design a fair transaction mechanism for P2P file-sharing applications, in which a trusted third party...
Peer-to-peer (P2P) networks are vulnerable to Distributed Denial-of-Service (DDoS) attacks, which cause invalid packets to be flooded through the P2P network, preventing valid packets from being delivered. This causes a disruption of the services provided by the P2P network. Since, anonymity and lack of centralized control/censorship are the salient features of P2P networks; it often encourages malicious...
ULTRA GRIDSEC" is a high performance symmetric key cryptography schema used to increase the performance of symmetric key encryption algorithms like DES and TDES by decreasing their execution time and increasing their security by using compression and multithreading techniques and other enhancement points. In this paper we enhancing the performance of a "ULTRA GRIDSEC" by using a pure...
Reputation systems aim to reduce the risk of loss due to untrustworthy peers. This loss is aggravated by dishonest recommenders trying to pollute the recommendation network. The objective of an honesty checking mechanism is to detect dishonest recommenders. Existing honesty checking mechanisms assume that contradicting recommendations are due to the dishonesty of the recommenders. However, such difference...
A new programming model for secure (embedded) peer-to-peer systems has been recently proposed in the context of the European project SMEPP. In this paper we present the design and implementation of such a model on top of tuple spaces. More precisely, we show how the SMEPP service-oriented interaction primitives can be effectively implemented using SecureLime.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.