Protecting individuals’ privacy in online communications has become a challenge of paramount importance. To this end, anonymous communication (AC) protocols such as the widely used Tor network have been designed to provide anonymity to their participating users. While AC protocols have been the subject of several security and anonymity analyses in the last years, there still does not exist a fr...

Anonymity has been regarded mainly as anonymity of the person who did something. We believe that the anonymity of the subject may not be a primary concern and the more important part would be the fact that the subject did some deed. We focus on the relationship of the subject and the deed. Another argument we raise here is the need of quantitative measures for the anonymity. Anonymity has been ...

Anonymity, which is more and more important to multi-receiver schemes, has been taken into consideration by many researchers recently. To protect the receiver anonymity, in 2010, the first multi-receiver scheme based on the Lagrange interpolating polynomial was proposed. To ensure the sender's anonymity, the concept of the ring signature was proposed in 2005, but afterwards, this scheme was pro...

There is a growing concern about anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, the importance of probabilistic aspect of anonymity is claimed recently by many authors. Several different notions of “probabilistic anonymity” have been studied so far, but proof methods for such probabilistic notions are not yet elaborat...

This paper explains why existing anonymity models such as k-anonymity cannot be applied to the most common form of private data release on the internet, social network APIs. An alternative anonymity model, PP-anonymity, is presented, which measures the posterior probability of an attacker logically deducing previously unknown private information using a social network API. Finally, the feasibil...

In this paper we explore an approach to privacy preserving data mining that relies on the k-anonymity model. The k-anonymity model guarantees that no private information in a table can be linked to a group of less than k individuals. We suggest extended definitions of k-anonymity that allow the k-anonymity of a data mining model to be determined. Using these definitions, we present decision tre...

We propose, develop, and implement techniques for achieving contractual anonymity. In contractual anonymity, a user and service provider enter into an anonymity contract. The user is guaranteed anonymity and message unlinkability from the contractual anonymity system unless she breaks the contract. The service provider is guaranteed that it can identify users who break the contract. The signifi...

Anonymity and privacy have become important issues in the digital world. Various techniques that augment the level of anonymity are available, but their motivation and implementation is often based on an ad-hoc rationale, which makes it is hard to compare them. Moreover, reflecting upon and implementing improvements to the anonymity properties of a system is considerably complicated in this way...

This paper re-examines the incompatibility of Strong Pareto, as an axiom sensitivity, and Anonymity, impartiality, when comparing well-being profiles with a countably infinite number components. We ask how far Paretian principle can be extended without contradicting Anonymity. show that Anonymity combined four auxiliary axioms has two consequences: (i) There is sensitivity for increase in one c...