research-article

VOTOR: conceptually simple remote voting against tiny tyrants

Authors:

Xavier BoyenAuthors Info & Claims

ACSW '16: Proceedings of the Australasian Computer Science Week Multiconference

Article No.: 32, Pages 1 - 13

https://doi.org/10.1145/2843043.2843362

Published: 01 February 2016 Publication History

Abstract

This paper seeks to address the need for fair elections in an adversarial online setting in ad hoc elections. A major issue with existing online solutions is reliance on authorities, which in practice are often instantiated by only one organisation. We propose a conceptually simple but highly robust approach for casting ballots over commodity anonymisers under minimal assumptions. While other schemes have followed a similar approach none have utilised the primitives to achieve so many desirable properties.

We then exploit this to construct a practical instantiation, called VOTOR---Voting over Tor---(one need not use Tor specifically), whose properties we show to compare favourably with prominent modern remote voting schemes such as Remotegrity and Helios. In particular, it shares the same coercion-resistance property, which we call weak receiptfreeness, as the latter two, but also provides privacy against election tellers. It is also conceptually simpler in its design than most modern schemes, and can be instantiated to allow voting credentials to persist from one election to the next without privacy attacks on past elections.

References

[1]

M. Abe. Mix-networks on permutation networks. In Advances in cryptology-ASIACRYPTŠ99, pages 258--273. Springer, 1999.

Digital Library

[2]

B. Adida. Helios: Web-based open-audit voting. In P. C. van Oorschot, editor, USENIX Security Symposium, pages 335--348. USENIX Association, 2008.

Digital Library

[3]

J. Benaloh. Verifiable secret-ballot elections. PhD thesis, PhD thesis, Yale University, 1987.

Digital Library

[4]

J. C. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections (extended abstract). In F. T. Leighton and M. T. Goodrich, editors, STOC, pages 544--553. ACM, 1994.

Digital Library

[5]

D. Bernhard, V. Cortier, O. Pereira, B. Smyth, and B. Warinschi. Adapting helios for provable ballot privacy. In V. Atluri and C. Díaz, editors, Computer Security - ESORICS 2011 - 16th European Symposium on Research in Computer Security, Leuven, Belgium, September 12--14, 2011. Proceedings, volume 6879 of Lecture Notes in Computer Science, pages 335--354. Springer, 2011.

Digital Library

[6]

D. Bernhard, V. Cortier, O. Pereira, and B. Warinschi. Measuring vote privacy, revisited. In T. Yu, G. Danezis, and V. D. Gligor, editors, the ACM Conference on Computer and Communications Security, CCS'12, Raleigh, NC, USA, October 16--18, 2012, pages 941--952. ACM, 2012.

Digital Library

[7]

S. Canard, B. Schoenmakers, M. Stam, and J. Traoré. List signature schemes. Discrete Applied Mathematics, 154(2):189--201, 2006.

Digital Library

[8]

R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky. Deniable encryption. In Advances in Cryptology - CRYPTO'97, pages 90--104. Springer, 1997.

Digital Library

[9]

D. Chaum. Untraceable mail, return addresses and digital pseudonyms. Communications of the ACM, 24(2):84--88, 1981.

Digital Library

[10]

D. Chaum. Blind signatures for untraceable payments. In D. Chaum, R. L. Rivest, and A. T. Sherman, editors, CRYPTO, pages 199--203. Plenum Press, New York, 1982.

[11]

D. Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of cryptology, 1(1):65--75, 1988.

[12]

D. Chaum. Elections with unconditionally-secret ballots and disruption equivalent to breaking rsa. In Advances in Cryptology - EUROCRYPTŠ88, pages 177--182. Springer, 1988.

Digital Library

[13]

D. Chaum, R. Carback, J. Clark, A. Essex, S. Popoveniuc, R. L. Rivest, P. Y. A. Ryan, E. Shen, and A. T. Sherman. Scantegrity ii: End-to-end verifiability for optical scan election systems using invisible ink confirmation codes. In D. L. Dill and T. Kohno, editors, EVT. USENIX Association, 2008.

Digital Library

[14]

D. Chaum, P. Y. A. Ryan, and S. A. Schneider. A practical voter-verifiable election scheme. In S. D. C. di Vimercati, P. F. Syverson, and D. Gollmann, editors, ESORICS, volume 3679 of Lecture Notes in Computer Science, pages 118--139. Springer, 2005.

Digital Library

[15]

D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, EUROCRYPT, volume 547 of Lecture Notes in Computer Science, pages 257--265. Springer, 1991.

Digital Library

[16]

M. R. Clarkson, S. Chong, and A. C. Myers. Civitas: Toward a secure voting system. In Proceedings of the 2008 IEEE Symposium on Security and Privacy, pages 354--368. IEEE Computer Society, 2008.

Digital Library

[17]

J. D. Cohen and M. J. Fischer. A robust and verifiable cryptographically secure election scheme. In FOCS, volume 85, pages 372--382, 1985.

Digital Library

[18]

R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung. Multi-authority secret-ballot elections with linear work. In Advances in Cryptology - EUROCRYPTŠ96, pages 72--83. Springer, 1996.

Digital Library

[19]

S. Delaune, S. Kremer, and M. Ryan. Coercion-resistance and receiptfreeness in electronic voting. In Computer Security Foundations Workshop, 2006. 19th IEEE, pages 12--pp. IEEE, 2006.

Digital Library

[20]

D. Demirel, J. Van De Graaf, and R. Araújo. Improving helios with everlasting privacy towards the public. In Proceedings of the 2012 international conference on Electronic Voting Technology/Workshop on Trustworthy Elections, pages 8--8. USENIX Association, 2012.

Digital Library

[21]

A. Essex, J. Clark, U. Hengartner, and C. Adams. How to print a secret. In Proceedings of the 4th USENIX conference on Hot topics in security, pages 3--3. USENIX Association, 2009.

Digital Library

[22]

A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In Advances in Cryptology - AUSCRYPT'92, pages 244--251. Springer, 1993.

Digital Library

[23]

M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In Advances in Cryptology - EUROCRYPT 2000, pages 539--556. Springer, 2000.

[24]

J. Liu and D. Wong. Linkable ring signatures: Security models and new schemes. In O. Gervasi, M. Gavrilova, V. Kumar, A. LaganÃă, H. Lee, Y. Mun, D. Taniar, and C. Tan, editors, Computational Science and Its Applications âĂŞ ICCSA 2005, volume 3481 of Lecture Notes in Computer Science, pages 614--623. Springer Berlin Heidelberg, 2005.

Digital Library

[25]

J. K. Liu, M. H. Au, W. Susilo, and J. Zhou. Linkable ring signature with unconditional anonymity. IEEE Transactions on Knowledge and Data Engineering, 26(1):157--165, 2014.

Digital Library

[26]

T. Okamoto. An electronic voting scheme. In Advanced IT Tools, pages 21--30. Springer, 1996.

[27]

T. Okamoto. Receipt-free electronic voting schemes for large scale elections. In Security Protocols, pages 25--35. Springer, 1998.

Digital Library

[28]

C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In T. Helleseth, editor, EUROCRYPT, volume 765 of Lecture Notes in Computer Science, pages 248--259. Springer, 1993.

Digital Library

[29]

R. L. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In Advances in Cryptology - ASIACRYPT 2001, pages 552--565. Springer, 2001.

[30]

K. Sako and J. Kilian. Receipt-free mix-type voting scheme. In Advances in Cryptology - EUROCRYPTŠ95, pages 393--403. Springer, 1995.

Digital Library

[31]

B. Smyth and D. Bernhard. Ballot secrecy and ballot independence coincide. In J. Crampton, S. Jajodia, and K. Mayes, editors, Computer Security - ESORICS 2013 - 18th European Symposium on Research in Computer Security, Egham, UK, September 9--13, 2013. Proceedings, volume 8134 of Lecture Notes in Computer Science, pages 463--480. Springer, 2013.

[32]

G. Tsoukalas, K. Papadimitriou, P. Louridas, and P. Tsanakas. From helios to zeus. Presented as part of the USENIX Journal of Election and Technology and Systems (JETS), pages 1--17, 2013.

[33]

F. Zagórski, R. Carback, D. Chaum, J. Clark, A. Essex, and P. L. Vora. Remotegrity: Design and use of an end-to-end verifiable remote voting system. IACR Cryptology ePrint Archive, 2013:214, 2013.

Cited By

Wang LPeng CTan W(2023)Secure Ring Signature Scheme for Privacy-Preserving BlockchainEntropy10.3390/e2509133425:9(1334)Online publication date: 14-Sep-2023
https://doi.org/10.3390/e25091334
Li NLi YMiyaji ATian YYuen T(2023)A Practical Forward-Secure DualRingCryptology and Network Security10.1007/978-981-99-7563-1_23(516-537)Online publication date: 31-Oct-2023
https://doi.org/10.1007/978-981-99-7563-1_23
Li XMei YGong JXiang FSun Z(2020)A Blockchain Privacy Protection Scheme Based on Ring SignatureIEEE Access10.1109/ACCESS.2020.29878318(76765-76772)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2987831

VOTOR: conceptually simple remote voting against tiny tyrants
1. Security and privacy
2. Social and professional topics
  1. Computing / technology policy

Recommendations

Frugal bribery in voting

Bribery in elections is an important problem in computational social choice theory. We introduce and study two important special cases of the classical $Bribery problem, namely, Frugal-bribery and Frugal-$bribery where the briber is frugal in nature. By ...
An Experiment in Approval Voting

The first major experimental comparison of approval voting with regular plurality voting occurred in the 1985 annual election of The Institute of Management Sciences TIMS. In approval voting a person votes for approves of as many candidates as desired, ...
A New Coercion-Resistant and Receipt-Free Electronic Voting System with Verifiability and Secrecy
ICEE '12: Proceedings of the 2012 3rd International Conference on E-Business and E-Government - Volume 02

The coexistence of verifiability and voting receipts in an electronic voting system is a contradictory issue. Because the electronic vote is in a virtual form, voters rely on voting receipts to verify the integrity of the votes. However, the voting ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ACSW '16: Proceedings of the Australasian Computer Science Week Multiconference

February 2016

654 pages

ISBN:9781450340427

DOI:10.1145/2843043

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

ARC Future Fellowship
ARC Discovery Project

Conference

ACSW '16

ACSW '16: Australasian Computer Science Week

February 1 - 5, 2016

Canberra, Australia

Acceptance Rates

ACSW '16 Paper Acceptance Rate 77 of 172 submissions, 45%;

Overall Acceptance Rate 204 of 424 submissions, 48%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
103
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wang LPeng CTan W(2023)Secure Ring Signature Scheme for Privacy-Preserving BlockchainEntropy10.3390/e2509133425:9(1334)Online publication date: 14-Sep-2023
https://doi.org/10.3390/e25091334
Li NLi YMiyaji ATian YYuen T(2023)A Practical Forward-Secure DualRingCryptology and Network Security10.1007/978-981-99-7563-1_23(516-537)Online publication date: 31-Oct-2023
https://doi.org/10.1007/978-981-99-7563-1_23
Li XMei YGong JXiang FSun Z(2020)A Blockchain Privacy Protection Scheme Based on Ring SignatureIEEE Access10.1109/ACCESS.2020.29878318(76765-76772)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2987831

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents