Solving the Discrete Logarithm Problem for Packing Candidate Preferences

Abstract : Ranked elections are used in many places across the world, and a number of end-to-end verifiable voting systems have been proposed to handle these elections recently. One example is the vVote system designed for the Victorian State Election, Australia. In this system, many voters will give a full ranking of up to 38 candidates. The easiest way to do this is to ask each voter to reorder ciphertexts representing the different candidates, so that the ciphertext ordering represents the candidate ranking. But this requires sending 38 ciphertexts per voter through the mixnets, which will take a long time. In this paper, we explore how to “pack” multiple candidate preferences into a single ciphertext, so that these preferences can be represented in the least number of ciphertexts possible, while maintaining efficient decryption. Both the packing and the unpacking procedure are performed publicly: we still provide 38 ciphertexts, but they are combined appropriately before they enter the mixnets, and after decryption, a meet-in-the-middle algorithm can be used to recover the full candidate preferences despite the discrete logarithm problem.
Type de document :
Communication dans un congrès
Alfredo Cuzzocrea; Christian Kittl; Dimitris E. Simos; Edgar Weippl; Lida Xu. 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES), Sep 2013, Regensburg, Germany. Springer, Lecture Notes in Computer Science, LNCS-8128, pp.209-221, 2013, Security Engineering and Intelligence Informatics
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01506684
Contributeur : Hal Ifip <>
Soumis le : mercredi 12 avril 2017 - 11:07:05
Dernière modification le : mercredi 12 avril 2017 - 14:40:01
Document(s) archivé(s) le : jeudi 13 juillet 2017 - 12:43:23

Fichier

978-3-642-40588-4_15_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

  • HAL Id : hal-01506684, version 1

Citation

James Heather, Chris Culnane, Steve Schneider, Sriramkrishnan Srinivasan, Zhe Xia. Solving the Discrete Logarithm Problem for Packing Candidate Preferences. Alfredo Cuzzocrea; Christian Kittl; Dimitris E. Simos; Edgar Weippl; Lida Xu. 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES), Sep 2013, Regensburg, Germany. Springer, Lecture Notes in Computer Science, LNCS-8128, pp.209-221, 2013, Security Engineering and Intelligence Informatics. 〈hal-01506684〉

Partager

Métriques

Consultations de la notice

32

Téléchargements de fichiers

25