Jonker, Hugo; Mauw, Sjouke; Pang, Jun A formal framework for quantifying voter-controlled privacy. (English) Zbl 1192.68240 J. Algorithms 64, No. 2-3, 89-105 (2009). Summary: Privacy is a necessary requirement for voting. Without privacy, voters can be forced to vote in specific ways, and the forcing party can check their compliance. But offering privacy does not suffice: if a voter can reduce her privacy, an attacker can force her to do so. In this paper, we distinguish various ways that a voter can communicate with the intruder to reduce her privacy and classify them according to their ability to reduce the privacy of a voter. We develop a framework combining knowledge reasoning and trace equivalences to formally model voting protocols and define voter-controlled privacy. Our framework is quantitative, in the sense that it defines a measure for the privacy of a voter. Therefore, the framework can precisely measure the level of privacy for a voter for each of the identified privacy-reduction classes. The quantification allows our framework to capture receipts that reduce, but not nullify, the privacy of the voter. Cited in 2 Documents MSC: 68P25 Data encryption (aspects in computer science) 68M10 Network design and communication in computer systems Keywords:formal methods; privacy and security; voting protocols PDFBibTeX XMLCite \textit{H. Jonker} et al., J. Algorithms 64, No. 2--3, 89--105 (2009; Zbl 1192.68240) Full Text: DOI