Formalising receipt-freeness

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

doi:10.1007/11836810_34

Formalising receipt-freeness

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

Formal System Analysis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-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 language	English
Title of host publication	Information Security (Proceedings 9th International Conference, ISC 2006, Samos, Greece, August 30-September 2, 2006)
Editors	S.K. Katsikas, J. Lopez, M. Backes, S. Gritzalis, B. Preneel
Place of Publication	Berlin
Publisher	Springer
Pages	476-488
ISBN (Print)	3-540-38341-7
DOIs	https://doi.org/10.1007/11836810_34
Publication status	Published - 2006

Publication series

Name	Lecture Notes in Computer Science
Volume	4176
ISSN (Print)	0302-9743

Access to Document

10.1007/11836810_34

Cite this

Jonker, H. L., & Vink, de, E. P. (2006). Formalising receipt-freeness. In S. K. Katsikas, J. Lopez, M. Backes, S. Gritzalis, & B. Preneel (Eds.), Information Security (Proceedings 9th International Conference, ISC 2006, Samos, Greece, August 30-September 2, 2006) (pp. 476-488). (Lecture Notes in Computer Science; Vol. 4176). Springer. https://doi.org/10.1007/11836810_34

@inproceedings{b69c7a8f506043078f15cd2e19715904,

title = "Formalising receipt-freeness",

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.",

author = "H.L. Jonker and {Vink, de}, E.P.",

year = "2006",

doi = "10.1007/11836810_34",

language = "English",

isbn = "3-540-38341-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "476--488",

editor = "S.K. Katsikas and J. Lopez and M. Backes and S. Gritzalis and B. Preneel",

booktitle = "Information Security (Proceedings 9th International Conference, ISC 2006, Samos, Greece, August 30-September 2, 2006)",

address = "Germany",

}

Formalising receipt-freeness. / Jonker, H.L.; Vink, de, E.P.

Information Security (Proceedings 9th International Conference, ISC 2006, Samos, Greece, August 30-September 2, 2006). ed. / S.K. Katsikas; J. Lopez; M. Backes; S. Gritzalis; B. Preneel. Berlin : Springer, 2006. p. 476-488 (Lecture Notes in Computer Science; Vol. 4176).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Formalising receipt-freeness

AU - Jonker, H.L.

AU - Vink, de, E.P.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

U2 - 10.1007/11836810_34

DO - 10.1007/11836810_34

M3 - Conference contribution

SN - 3-540-38341-7

T3 - Lecture Notes in Computer Science

SP - 476

EP - 488

BT - Information Security (Proceedings 9th International Conference, ISC 2006, Samos, Greece, August 30-September 2, 2006)

A2 - Katsikas, S.K.

A2 - Lopez, J.

A2 - Backes, M.

A2 - Gritzalis, S.

A2 - Preneel, B.

PB - Springer

CY - Berlin

ER -