D–Shuffle for Prêt à Voter - Communications and Multimedia Security Access content directly
Conference Papers Year : 2014

D–Shuffle for Prêt à Voter

Dalia Khader
  • Function : Author
  • PersonId : 994643

Abstract

Prêt à Voter is an end–to–end verifiable voting scheme, that uses paper based ballot forms that are turned into encrypted receipts. The scheme was designed to be flexible, secure and to offer voters a familiar and easy voting experience. Secrecy of the vote in Prêt à Voter relies on encoding the vote using a randomized candidate list in the ballots. In a few variants of Prêt à Voter a verifiable shuffle was used in the ballot generation phase in order to randomize the candidates. Verifiable shuffles are cryptographic primitives that re–encrypt and permute a list of ciphertexts. They provide proofs of correctness of the shuffle and preserve secrecy of the permutation. This paper proposes a new verifiable shuffle “D–Shuffle” that is efficient. We provide a security proof for the D–Shuffle. Furthermore, we show that using the D–shuffle for generating ballots in Prêt à Voter scheme ensures its security against: “Authority Knowledge Attack” and “Chain of Custody Attack”.
Fichier principal
Vignette du fichier
978-3-662-44885-4_9_Chapter.pdf (390.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01404200 , version 1 (28-11-2016)

Licence

Attribution

Identifiers

Cite

Dalia Khader. D–Shuffle for Prêt à Voter. 15th IFIP International Conference on Communications and Multimedia Security (CMS), Sep 2014, Aveiro, Portugal. pp.104-117, ⟨10.1007/978-3-662-44885-4_9⟩. ⟨hal-01404200⟩
40 View
74 Download

Altmetric

Share

Gmail Facebook X LinkedIn More