Receipt-freeness as a special case of anonymity in epistemic logic

Share/Save/Bookmark

Jonker, H.L. and Pieters, W. (2006) Receipt-freeness as a special case of anonymity in epistemic logic. In: Proceedings of the IAVoSS Workshop On Trustworthy Elections (WOTE 2006), 29-30 Jun 2006, Cambridge, UK.

open access
[img]
Preview
PDF
111kB
Abstract:Formal methods have provided us with tools to check both
anonymity of protocols and - more specifically - receipt-freeness of voting
protocols. One of the frameworks used for proving anonymity is epistemic
logic. However, to the best of our knowledge, epistemic logic has never
been used to prove receipt-freeness of voting protocols. Still, the concept
of indistinguishability used in formalizing anonymity seems to apply to
receipt-freeness as well: a vote for one party should be indistinguishable
from a vote for another party, even if the voter supplies additional in-
formation outside the scope of the protocol. In this paper, we formalize
this aspect of anonymity relations, in order to provide an alternative
formalization of receipt-freeness in voting protocols, based on epistemic
logic.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65116
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page