Intuitively, an election protocol is receipt-free if a voter A cannot prove to a potential coercer C that she voted in a particular way. We assume that A wishes to cooperate with C; receipt-freeness guarantees that such cooperation will not be worthwhile, because it will be impossible for C to obtain proof about how A voted. Receipt-freeness is a similar property to privacy, which asserts that ...

Prêt à Voter is a supervised, end-to-end verifiable voting scheme. Informal analyses indicate that, subject to certain assumptions, Prêt à Voter is receipt free, i.e. a voter has no way to construct a proof to a coercer of how she voted. In this paper we propose a variant of Prêt à Voter and prove receipt freeness of this scheme using computational methods. Our proof shows that if there exists ...

Prêt à Voter is a supervised, end-to-end verifiable voting scheme. Informal analyses indicate that, subject to certain assumptions, Prêt à Voter is receipt free, i.e. a voter has no way to construct a proof to a coercer of how she voted. In this paper we propose a variant of Prêt à Voter and prove receipt freeness of this scheme using computational methods. Our proof shows that if there exists ...

We present a one-sided error property testing algorithm for H-minor freeness in boundeddegree graphs for any minor H that is a minor of the (k× 2)-grid (for any k ∈ N). This includes, for example, testing whether a graph is a cactus graph and testing minor-freeness for minors which are cycles with parallel chords. The query complexity of our algorithm in terms of the number of vertices in the g...

This paper proposes practical receipt-free voting schemes which are suitable for (nation wide) large scale elections. One of the proposed scheme requires the help of the voting commission, and needs a physical assumption, the existence of an untappable channel. The other scheme does not require the help of the commission, but needs a stronger physical assumption, the existence of a voting booth...

The main idea of this paper is to show some important differences between graph grammars and hypergraph grammars in context of freeness. On the other hand, we give a possibility to transform the planar structure of a hypergraph into a linear one with concern of determinism. This can create a path to transform a pushdown automaton into a generative grammar equivalent. Key-Words: Hyperedge Replac...

It is well known that the controllability of a linear multidimensional control system depends on an algebraic property (namely, the torsion-freeness) of a certain module M associated with the system (Oberst, 1990; Pillai and Shankar, 1999; Pommaret and Quadrat, 1999a; 1999b). The recent survey (Wood, 2000) gives different equivalent formulations of controllability and, in particular, the equiva...

A general eventual freeness result is given for nef and big line bundles in positive characteristic. One application is to the geometry of the universal stable curve over Mg , specifically, the eventual freeness of the relative dualizing sheaf, in positive characteristic. An example is given which shows this fails in characteristic zero. A second application is to Mori’s program for minimal mod...

We investigate the following classes of equational theories which are important in unification theory: permutative, finite, Noetherian, simple, almost collapse free, collapse free, regular, and O-free theories. We show some relationships between the particular classes and their connections to the unification hierarchy. Especially, we study conditions, under which minimal and complete sets of un...

A graph property P is strongly testable if for every fixed > 0 there is a one-sided -tester for P whose query complexity is bounded by a function of . In classifying the strongly testable graph properties, the first author and Shapira showed that any hereditary graph property (such as P the family of perfect graphs) is strongly testable. A property is easily testable if it is strongly testable ...