Anonymous Mechanism Research Articles

A novel passive website fingerprinting attack on tor using fast fourier transform

One of the main applications of low latency anonymity networks, such as Tor, is to protect data and users’ privacy from interception over the Internet. This paper presents a novel passive website fingerprinting attack to defeat Tor's anonymity mechanism with a significant improvement in comparison with similar methods. Unlike the state-of-the-art approaches, the proposed method does not need to change the sequence of IP packets exchanged between users and the first relay in the network. We introduce a new method based on the Fast Fourier Transform to calculate the similarity distance of instances from traffic patterns. In this way, the time complexity of feature extraction is reduced by a factor of 400 during the classification process. Considering a closed-world scenario, our method easily spots on target websites with a minimum success rate of 95%. As yet another notable payoff, the accuracy keeps up more robustly while the polarity of target website grows gradually.

Comment on "Unique in the shopping mall: On the reidentifiability of credit card metadata".

De Montjoye et al. (Reports, 30 January 2015, p. 536) claimed that most individuals can be reidentified from a deidentified transaction database and that anonymization mechanisms are not effective against reidentification. We demonstrate that anonymization can be performed by techniques well established in the literature.

LinkA: A Link Layer Anonymization Method Based on Bloom Filter for Authenticated IoT Devices

AbstractIn point-to-point communication channels, an anonymization mechanism is necessary for a data link layer because link layer IDs such as MAC addresses can reveal further private information about communicating devices, which may threaten cyber security. Previous mechanisms based on heavy cryptographic operations are not suitable for link layer that needs to immediately accept or drop frames, particularly in resource-constrained IoT. In this paper, we study a link layer anonymization method that functions efficiently for the current existing systems using 48-bit or 64-bit MAC addresses. Our method called LinkA is based on the Bloom Filter and the use of pre-authenticated structure regarding MAC addresses. LinkA can efficiently frustrate passive adversaries to distinguish unicast from multicast frames. We also implement and analyze LinkA.

An anonymity mechanism with reduced server-side cost in peer-to-peer networks

In peer-to-peer (P2P) networks, each peer's trustworthiness is evaluated according to its pseudonym's rating values given by other peers. One of the fundamental challenges in peer-to-peer networks is to protect peers' identity privacy on the communication path. In this paper, we present an anonymity mechanism to achieve all the peers' anonymity in peer-to-peer networks by changing pseudonyms with the help of a trusted third party (TTP) server. Compared with the existing reputation using pseudonyms (RuP) mechanism, our mechanism has reduced TTP server's cost by more than 50% in terms of numbers of RSA and AES decryption operations and message overhead. Simulation results show the effectiveness of our proposed anonymity mechanism to counter malicious peers.

An anonymity mechanism with reduced server-side cost in peer-to-peer networks

An anonymity mechanism with reduced server-side cost in peer-to-peer networks

Hoarding Mutual Data via Security-Arbiteron the Cloud

Most of the organizations outsource data cache to the cloud such that a proprietor of an organization can easily allocate data with other users. Due to the presence of security issues in the cloud, both proprietors and users are suggested to verify the integrity of cloud data with Provable Data Possession (PDP). However, previous methods disclose the identity of a data proprietor to the untrusted cloud or any public verifiers, or introduce distinct overheads on authentication metadata to preserve privacy. In this work, we propose a simple and efficient publicly verifiable approach to ensure cloud data integrity without sacrificing the privacy of data proprietors or requiring distinct verification metadata. Specifically, we introduce a security arbiter (SEA), which is able to generate authentication metadata (i.e., signatures) on deployed data for data proprietors. Thus, an organization can employ its own anonymous verification mechanism, and the cloud is unaware to that since it only deals with typical PDP-metadata, consequently, there are no extra hoards overhead when compared with existing non-anonymous PDP solutions. The significant features include data secrecy, such that the SEA does not learn anything about the data to be uploaded to the cloud at all, which is able to minimize the requirement of trust on the SEA. Security scrutinizations prove our pattern is secure, and experiment results demonstrate our pattern is efficient.

Strategic embeddedness and the microfoundations of collective action: A comparative institutional analysis of the rule of law and informal institutions in cooperation games

Typical accounts of the ability of social networks to enable collective action focus on either whole group or individual advantages. Adding an intermediate perspective, this paper advances a core notion of strategic embeddedness that applies to social interactions involving a subset of society. Strategic embeddedness is modeled with a game-theoretic approach that places an otherwise isolated game into a broader social structure. To facilitate a comparative institutional analysis of formal and informal mechanisms, this paper advances a complementary notion of the cooperative value of a network to evaluate the maximum payoffs possible under various network structures that define the social context of two-person cooperation games. A formal analysis indicates that decentralized network structures can maximize this cooperative value: under some conditions, these are both optimal and efficient structures that can effectively substitute for anonymous public enforcement mechanisms. In conditions where private enforcement is relatively ineffective vis-à-vis a public rule of law enforcement mechanism, then hierarchical network structures are shown to be optimal but inefficient. In general, more connectedness or a higher network density does not readily translate into more cooperation because when most players are connected to the rest of society, the added value of social networks diminishes in the absence of extraneous rules to discriminate among players with common social connections.

A Social Network Model with Privacy Preserving and Reliability Assurance and its Applications in Health Care

Social media has become a platform to provide big data services. In healthcare applications, online E-health platforms have enabled patients to obtain useful references on the Internet, as well as to share information and exchange experiences among people with similar diseases. Such social networks also enable researchers and marketers to conduct studies or advocates on targeted groups of patients. However, how to protect user privacy while assure user and data reliability at the same time remains a challenge in practice. This article tackles the problem by exploring trust-engagement mechanism and developing a dynamic multi-trust model integrating multilevel access control, credible anonymity, and mutual rating mechanism for a multi-purpose healthcare social network. The social network model we presented in this study mainly focuses on the purpose of big data privacy preserving, and user and data reliability assurance. We discuss the mechanism of the model and present practical implementation designs on achieving the goals. We also apply the model in the healthcare social network to elaborate how electronic health records (EHRs) and personal health records (PHRs) can work together to support a social health record (SHR) network which enables privacy preserving and user and data reliability.

English

This paper details about various methods prevailing in literature of anonymous authentication mechanisms for data stored in clouds. It is a Decentralized access of system in which every system have the access control of data . The Cloud which is a Secured storage area where the anonymous authentication is used, so that only the permitted users can be accessed. Decrypting of data can be viewed only by a valid users and can also stored information only by Valid users. This Scheme prevents Replay attack which mean Eaves Dropping can be avoided, Support Creation of data inside storage, Modifying the data by unknown users , and Reading data stored in Cloud. User can revocate the data only by addressing through the cloud. The authentication and accessing the Cloud is Robust, Hence Overall Communication Storage are been developed by comparing to the Centralized approaches. This paper would promote a lot of research in the area of Anonymous Authentication.

Quantifying and Protecting Location Privacy

Quantifying and Protecting Location Privacy

Standing out in the academic LIS job market: An interactive panel for doctoral students

ABSTRACTThis proposal builds on the previous successes of the interactive doctoral student panels sponsored by SIG ED at the 2013, 2012, and earlier ASIS&T annual meetings. The all‐new 2015 panel features faculty in various stages of their academic careers, including a relatively new assistant professor to a seasoned chair or dean. The panelists are prepared to address audience questions on such topics as the traditional academic job market, alternative career paths including post‐doctoral opportunities, the development of personal research agendas, and the challenges of online instruction.The panel discussion will focus around the academic job market and how applicants can present themselves in the best light depending upon the type of position sought. Doctoral students will gain valuable insights on finishing their dissertation, weighing postdoctoral opportunities, and preparing for their first academic position by interacting with the panelists. This panel will provide for an anonymous mechanism for doctoral students and new faculty to ask questions without feeling inhibited or intimidated. The panel may be of greatest benefit to those doctoral students nearing the end of their doctoral program, but will also be useful to new doctoral students and new assistant professors.

Forms of global governence

Global governance as a concept defines the meaning of contemporary world politics both as a discipline and as reality. Interdependent and globalized world requires governance, and a global government has not been formed yet. The theoretical possibility of global governance without global government is proved and justified. The purpose of this article is to analytically identify possible forms of global governance. Three such forms of global governance are identified: hierarchical, market and network. In a hierarchy the governance is due to the asymmetry of power between the parties. Market control happens via anonymous pricing mechanism. Network, in contrast to the market is characterized by a closer value link between the actors, but unlike the hierarchical relationship actors are free to leave the network. Global governance takes three forms and is being implemented by different actors. To determine the most efficient form of global governance is impossible. Efficiency depends on the match between a form and an object of government. It should be noted that meta governance is likely to remain a monopoly of institutionally strong states in global governance.

PARETO EFFICIENCY AND WEIGHTED MAJORITY RULES

We consider the design of decision rules in an environment with two alternatives, independent private values and no monetary transfers. The utilitarian rule subject to incentive compatibility constraints is a weighted majority rule, where agents' weights correspond to expected gains given that their favorite alternative is chosen. It is shown that a rule is interim incentive efficient if and only if it is a weighted majority rule, and we characterize those weighted majority rules that are ex ante incentive efficient. We also discuss efficiency in the class of anonymous mechanisms and the stability of weighted majority rules.

A sensor anonymity enhancement scheme based on pseudonym for clustered Wireless Sensor Network

Security problem is an important issue for Wireless Sensor Network.The paper focuses on the privacy protection of WSN applications.An anonymity enhancement tactic based on pseudonym mechanism is presented for clustered Wireless Sensor Network,which provides anonymity for both the sensors within a cluster and the cluster head nodes.Simulation experiments are launched through NS2 platform to validate the anonymity performance.The theoretical analysis and empirical study imply that the proposed scheme based on pseudonym can protect the privacies of both the sensor nodes and the cluster head nodes.The work is valuable and the experimental results are convincible.

Enhancing data utility in differential privacy via microaggregation-based $$k$$ k -anonymity

It is not uncommon in the data anonymization literature to oppose the "old" $$k$$ k -anonymity model to the "new" differential privacy model, which offers more robust privacy guarantees. Yet, it is often disregarded that the utility of the anonymized results provided by differential privacy is quite limited, due to the amount of noise that needs to be added to the output, or because utility can only be guaranteed for a restricted type of queries. This is in contrast with $$k$$ k -anonymity mechanisms, which make no assumptions on the uses of anonymized data while focusing on preserving data utility from a general perspective. In this paper, we show that a synergy between differential privacy and $$k$$ k -anonymity can be found: $$k$$ k -anonymity can help improving the utility of differentially private responses to arbitrary queries. We devote special attention to the utility improvement of differentially private published data sets. Specifically, we show that the amount of noise required to fulfill $$\varepsilon $$ ? -differential privacy can be reduced if noise is added to a $$k$$ k -anonymous version of the data set, where $$k$$ k -anonymity is reached through a specially designed microaggregation of all attributes. As a result of noise reduction, the general analytical utility of the anonymized output is increased. The theoretical benefits of our proposal are illustrated in a practical setting with an empirical evaluation on three data sets.

Proportional Individual Rationality and the Provision of a Public Good in a Large Economy

This paper studies the public good provision problem in which a public good can be provided and payments can be collected from agents only if the proportion of agents who obtain nonnegative interim expected utilities from the public good provision mechanism weakly exceeds a prespecified ratio alpha. We call this requirement proportional individual rationality. We identify a key threshold such that if alpha is less than this threshold, then efficiency obtains asymptotically. If alpha is greater than the threshold, then inefficiency obtains asymptotically. In addition, we obtain the convergence rate of the probability of provision to its efficient/inefficient level. Moreover, as a methodological contribution of this paper, we propose the standard deviation of an agent's conditional expected provision as a measure of the agent's influence in a mechanism. We find that as the economy becomes large, an agent's influence in any anonymous mechanism converges to zero, and any interim incentive compatible anonymous mechanism must converge to a constant mechanism. We obtain the uniform bounds for those convergence.

Proportional individual rationality and the provision of a public good in a large economy

This paper studies the public good provision problem in which a non-excludable public good can be provided and payments can be collected from agents only if the proportion of agents who obtain nonnegative interim expected utilities from the public good provision mechanism weakly exceeds a prespecified ratio α. We call this requirement “α proportional individual rationality”. We identify a key threshold such that if α is less than this threshold, then efficiency obtains asymptotically. If α is greater than the threshold, then inefficiency obtains asymptotically. In addition, we obtain the convergence rate of the probability of provision to its efficient/inefficient level. Moreover, as a methodological contribution of this paper, we propose the standard deviation of an agent’s interim expected provision as a measure of the agent’s influence in a mechanism. We find that as the economy becomes large, an agent’s influence in any sequence of anonymous mechanisms converges to zero, and thus any sequence of anonymous feasible mechanisms must converge to a constant mechanism. We obtain uniform bounds for those rates of convergence.

Mutual anonymous communication mechanism based on stable group for mobile P2P network

To overcome the Mobile Peer-To-Peer(MP2P) disadvantages such as the instable wireless link,the inaccessible node credit and the evil nodes with a view to MP2P characteristics,a Mutual Anonymous Communication Mechanism based on Stable Group(MACM-SG) for MP2P network was put forward.The mechanism firstly built stable groups,and then established the anonymous communication channel.Due to the stable group characteristics,the nodes in the same stable group had a high possibility to establish trust relationship without the help of centre server,so the anonymous communication channel had a stable and a low communication load and high dynamic adaptability.The experiment shows that the mechanism can provide a high anonymous communication quality with a low load.

A Solomonic solution to the problem of assigning a private indivisible good

A benevolent Planner wishes to assign an indivisible private good to n claimants, each valuing the object differently. Individuals have quasi-linear preferences. Therefore, the possibility of transfers is allowed. A second-best efficient mechanism is a strategy-proof and anonymous mechanism that is not Pareto dominated by another strategy-proof and anonymous mechanism. In this context, we identify three conditions that are necessary and, together with Voluntary Participation, sufficient for a mechanism to be second-best efficient. This set includes mechanisms that destroy the good at certain profiles. For domains comprising two individuals we provide an explicit characterization of the family of second-best efficient mechanisms.

Information Technology: Gateway to Direct Democracy in China and the World

The world watches as China moves towards greater democracy. The question in everyone's minds, including Chinese themselves, is “what model will China arrive at, at the journey's end?” There are many lessons to be learnt from other countries, some positive (Tanzania) and some negative (Laos). The United States has no doubts about the “goodness” of its own model but their unthinking belief in the superiority of their model should not be accepted at face value. The Chinese government and people will understandably be considering various different models very carefully, so that they can choose the best possible model for their country, and their own context. In this paper we will consider why current Western models of constitution should be viewed with caution by China as it attempts to move towards an improved socialist democracy. The paper considers the electronic voting system used in the US presidential elections, and draws attention to the opportunities for vote rigging that this type of electronic voting facilitates. It also looks at models of democracy used in the ancient world, and compares these with modern systems. Finally, it presents a secure and anonymous mechanism for electronic voting on issues of concern to the population. We conclude by sounding a note of caution about the dangers of plebiscites being used as rubber stamps by dictators if there are inadequate controls over who puts issues to the vote.