For most elections, receipt-freeness is important – voters are unable to prove to others on how they voted, in order to prevent vote-buying. Many existing receipt-free electronic voting systems are not practical enough as they require voters to participate in the tallying phase (i.e. do not satisfy the vote-and-go requirement), or have no mechanism for the voters to verify whether their votes h...

Although Wikipedia uniquely challenges the boundaries of encyclopedic genre in terms collaboration, technology, authority, and knowledge production, it remains an encyclopedia, epistemological method forum that carries with ideological traces functions Enlightenment print culture. Such culture manifests itself most visibly policy verifiability. verifiability ensures editors support their claims...

We propose a new voting scheme, BeleniosRF, that offers both strong receipt-freeness and end-to-end verifiability. It is strongly receipt-free in the sense that even dishonest voters cannot prove how they voted. We give a game-based definition capturing this property, inspired by and improving the original receipt-freeness definition by Benaloh and Tuinstra. Built upon the Helios protocol, Bele...

The need for delegating statistical data arises when the data owner (e.g. statistical office) wants to have its data handled by an external party. If the external party is untrusted and data are confidential, delegation should be performed in a way that preserves security. A cryptographic solution to the secure delegation problem is outlined which provides data secrecy and computation verifiabi...

This paper describes an exploratory study of a prototype implementation of a pollsterless remote voting scheme, mCESG. The aim of the study was to investigate voter attitudes towards the system in general, with particular interest in the pollsterless vote verifiability provided. Although the focus of the study was one particular prototype system, the results provide some guidance to the design ...

By combining the two notations of ring signature and authenticated encryption together, we introduce a new type of authenticated encryption signature, called ring authenticated encryption, which has the following properties: signer-ambiguity, signer-verifiability, recipient-designation, semantic-security, verification-convertibility, verification-dependence and recipient-ambiguity. We also give...

The .NET Common Language Runtime (CLR) offers a new opportunity to experiment with multi-language interoperation, and provides a relatively rare chance to explore deep interoperation of a wide range of programming language paradigms. This article describes how the logic/functional programming language Mercury is compiled to the CLR. We describe the problems we have encountered with generating c...

If pollution is observable, but some emissions cannot be verified by court, voluntary agreements between a regulator and an industry can be welfareimproving compared to second-best emission taxes. Such agreements differ from direct regulation in a non-trivial way. The first-best optimum may be included in the set of possible agreements, even if it is not attainable using tax instruments. The no...

Transparent and verifiable elections can be achieved by end-to-end verifiable electronic voting systems. The purpose of such systems is to enable voters to verify the inclusion of their vote in the final tally while keeping the votes secret. Achieving verifiability and secrecy at the same time is hard and this thesis explores the properties of verifiable electronic voting systems and describes ...