A peaceful pyramid? Hierarchy and anonymity in newspaper comment sections

Several studies have linked deindividuation to an increase in aggression and incivility. This paper seeks to ascertain the influence of anonymity and hierarchy in online aggression by comparing two different newspaper comment sections: one with a hierarchical system and the other with an equalitarian setting. This study distinguishes itself form previous works by analyzing systems where identification is optional and where identified and anonymous users coexist. The hierarchical solution might be relevant to dissuade aggression when optional identifiability is seen as an essential asset. Results show that a hierarchical system provides some improvements in terms of civility and comment moderation, but that poor implementation of the hierarchy causes perversions in the system and affects its effectiveness.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Recipients' Anonymity in Multihop Ad-hoc Networks

Multihop ad-hoc networks have a dynamic topology. Retrieving a route towards a remote peer requires the execution of a recipient lookup, which can publicly reveal sensitive information about him. Within this context, we propose an efficient, practical and scalable solution to guaranteethe anonymity of recipients' nodes in ad-hoc networks.

JXTAnonym: An anonymity layer for JXTA services messaging

With the evolution of the P2P research eld, new problems, such as those related with information security, have arisen. It is important to provide security mechanisms to P2P systems, since it has already become one of the key issues when evaluating them. However, even though many P2P systems have been adapted to provide a security baseline to their underlying applications, more advanced capabilities are becoming necessary. Speci cally, privacy preservation and anonymity are deemed essential to make the information society sustainable. Unfortunately, sometimes, it may be di cult to attain anonymity unless it is included into the system's initial design. The JXTA open protocols speci cation is a good example of this kind of scenario. This work studies how to provide anonymity to JXTA's architecture in a feasible manner and proposes an extension which allows deployed services to process two-way messaging without disclosing the endpoints'identities to third parties.

JXTA anonymity through a replicated message-based approach

JXTA is a mature set of open protocols, with morethan 10 years of history, that enable the creation and deployment of peer-to-peer (P2P) networks, allowing the execution of services in a distributed manner. Throughout its lifecycle, ithas slowly evolved in order to appeal a broad set of different applications. Part of this evolution includes providing basic security capabilities in its protocols in order to achieve some degree of message privacy and authentication. However, undersome contexts, more advanced security requirements should be met, such as anonymity. There are several methods to attain anonymity in generic P2P networks. In this paper, we proposehow to adapt a replicated message-based approach to JXTA, by taking advantage of its idiosyncracies and capabilities.

Split message-based anonymity for JXTA applications

JXTA is an open peer-to-peer (P2P) protocols specification that, in its about 10 years of history, has slowly evolved to appeal to a broad set of applications. As part of this process,some long awaited security improvements have been included in the latest versions. However, under some contexts, even more advanced security requirements should be met, such as anonymity. Several approaches exist to deploy anonymity in P2P networks, but no perfect solution exists. Even though path-based approaches are quite popular, it is considered that, in dynamicgroups, using a split message-based one is better. In this work, we propose an anonymity service for JXTA using such approach. The proposal takes advantage JXTA's core services, in a manner so that it can be easily integrated to existing end applications and services.

Security, Privacy and Anonymity in Legal Distribution of Copyrighted Multimedia Content over Peer-to-Peer Networks: A Brief Overview

Peer-reviewed

Online Anonymity and the Kantian Publicity Principle: Can the Internet Solve the Paradox of Tyranny?

Immanuel Kant’s publicity maxim states that other-regarding actions are wrong if their maxim is not compatible with their being made public. This has the effect of forbidding dissent or rebellion against tyranny, since rebels cannot make their intentions and plans public. However, new internet technologies offer public speech from behind the “shield” of anonymity, allowing dissent to be public but preventing reprisals from tyrants. This thesis examines not only this possibility, but the value of internet-based discursive spaces for politics, their viability as a mode for political communication, and their implications for Classical and Enlightenment approaches to politics and intellectual virtue. Anonymous internet communications favour logos-based reasoning and discourse, which, in the liberal-democratic tradition, is preferable to phronesis and its attendant elitism and chauvinism. These technologies can open new vistas for liberal-democratic politics.

Crowds: Anonymity for Web Transactions

This is the original Crowds paper from Reiter and Rubin. Please consider it required reading.

An analysis of trust in anonymity networks in the presence of adaptive attackers

Introduces extended Crowds protocols. Optional reading