Formalising receipt-freeness

H.L. Jonker, E.P. Vink, de

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

30 Citations (Scopus)
3 Downloads (Pure)

Abstract

Receipt-freeness is the property of voting protocols that a voter cannot create a receipt which proves how she voted. Since Benaloh and Tuinstra introduced this property, there has been a large amount of work devoted to the construction of receipt-free voting protocols. This paper provides a generic and uniform formalism that captures the notion of a receipt. The formalism is then applied to analyse the receipt-freeness of a number of voting protocols.
Original languageEnglish
Title of host publicationInformation Security (Proceedings 9th International Conference, ISC 2006, Samos, Greece, August 30-September 2, 2006)
EditorsS.K. Katsikas, J. Lopez, M. Backes, S. Gritzalis, B. Preneel
Place of PublicationBerlin
PublisherSpringer
Pages476-488
ISBN (Print)3-540-38341-7
DOIs
Publication statusPublished - 2006

Publication series

NameLecture Notes in Computer Science
Volume4176
ISSN (Print)0302-9743

Cite this