This paper studies families of social choice functions (SCF’s), i.e. a collection of social choice functions {ΦA}, where the family is indexed by the option set of choices. These (sets of) functions arise in sequential choice problems where at each stage a set of options is given to a population of voters and a choice rule must aggregate stated preferences to generate an aggregate choice. In su...

Many e-voting techniques have been proposed but not widely used in reality. One of the problems associated with most existing e-voting techniques is the lack of transparency, leading to a failure to deliver voter assurance. In this work, we propose a transparent, auditable, stepwise verifiable, viewable, and mutual restraining e-voting protocol that exploits the existing multi-party political d...

A common approach behind measuring anonymity is that the larger the anonymity set is the higher the degree of anonymity it supports. Our approach builds upon this intuition proposing a very general and yet precise measure for security properties. Introduced in a paper accepted for ARES 2013 conference, plausibilistic entropy promises to offer an expressive and cost effective solution for quanti...

Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be described probabilistically. In this paper we propose a notion of weak probabilistic anonymity, where weak refers to the fact that some amount of probabilistic information may be revealed by the protocol. This information c...

While there is a great number of electronic voting protocols proposed in the literature, only a handful of them are actually deployed. Still, these few available schemes require voters to completely trust the poll provider with the anonymity of their votes and/or the integrity of the results. More robust schemes with better privacy and integrity guarantees do exist, however, they are complex to...

A ring signature scheme can be viewed as a group signature scheme with no anonymity revocation and with simple group setup. A linkable ring signature (LRS) scheme additionally allows anyone to determine if two ring signatures have been signed by the same group member. Recently, Dodis et al. [19] gave a short (constant-sized) ring signature scheme. We extend it to the first short LRS scheme, and...

Voter privacy and verifiability are fundamental security concepts for electronic voting. Existing literature on electronic voting provides many definitions and interpretations of these concepts, both informal and formal. While the informal definitions are often vague and imprecise, the formal definitions tend to be very complex and restricted in their scope as they are usually tailored for spec...

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...