As discussed in the literature [PrMü01; Rub04; Phi02] e-voting faces a lot of threats. The purpose of this paper is to give a systematically ordered overview of attacks against e-voting and to show one solution to the issues. The challenge is to provide identification and anonymity at the same time and to exclude the possibility of fraudulent manipulations by the server administration, the vote...

A (randomized, anonymous) voting rule maps any multiset of total orders of (aka. votes over) a fixed set of alternatives to a probability distribution over these alternatives. A voting rule f is neutral if it treats all alternatives symmetrically. It satisfies participation if no voter ever benefits from not casting her vote. It is falsename-proof if no voter ever benefits from casting addition...

The regressive nature of consumption taxes poses a challenge to partisan theory. Using data for up to 20 OECD countries in the period 1970-2003 this article aims to explore the question of whether the idea that social democratic governments typically have to compromise on policy goals and core constituency interests to make themselves more appealing to the median voter necessitates the use of r...

Since 2004, different research was handling the challenges in the centralized voting systems, e-voting protocols and recently the decentralized voting. So electronic voting puts forward some difficulties regarding the voter anonymity, the secure casting of the votes and to prevent the voting process from frauding. The Decentralized property of the technology called"blockchain"could have the sol...

Abstract We study the problem of aggregating discounted utility preferences into a social preference model. use an axiom capturing responsibility individuals’ attitudes to time, called consensus Pareto. show that this can provide consistent foundations for welfare judgments. Moreover, in conjunction with standard axioms anonymity and continuity, Pareto help adjudicate some fundamental issues re...

In 1998, Mu and Varadharajan proposed an anonymous e-voting scheme to be applied in both small-scale and large-scale elections. They claimed that it protects the anonymity of voters and prevents double voting. They also mentioned that if a malicious voter votes more than once, his identity will be discovered by the election authority. In 2003, Lin et al. demonstrated that the scheme fails to re...

Let V be a society whose members express weak preferences about two alternatives. We show simple representation formulae that are valid for all, and only, the elements of various classes non-manipulable social choice functions on V. represent entire class functions, its subclasses corresponding to further properties. focus mainly anonymity. Efficiency neutrality up one voter also considered. As...

There are different methods to build an anonymity service using MIXes. A substantial decision for doing so is the method of choosing the MIX route. In this paper we compare two special configurations: a fixed MIX route used by all participants and a network of freely usable MIXes where each participant chooses his own route. The advantages and disadvantages in respect to the freedom of choice a...

Due to recent happenings in the world, such as the implementation of Internet laws, network anonymity has become a highly controversial subject. This report is a brief inventory of technologies and reasons for anonymity, and is based on literature studies and some basic testing through existing tests. It also covers whether or not anonymous networks truly are anonymous and how difficult it is t...

Employing a two-by-two factorial design that manipulates whether dictator groups are single or mixed-sex and whether procedures are single or double-blind, we examine gender effects in a standard dictator game. No gender effects were found in any of the experimental treatments for the mean or median levels of giving, or for the propensity to give nothing. However, females chose to give away hal...