Election Verifiability or Ballot Privacy: Do We Need to Choose?-Reference-Cited by-同舟云学术

Election Verifiability or Ballot Privacy: Do We Need to Choose?

Published:2013 Issue: Volume: Page:481-498
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cuvelier Édouard,Pereira Olivier,Peters Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-40203-6_27

Reference38 articles.

1. Abe, M., Haralambiev, K., Ohkubo, M.: Signing on elements in bilinear groups for modular protocol design. IACR Cryptology ePrint Archive 2010, 133 (2010)

2. Lecture Notes in Computer Science;M. Abe,2012

3. Adida, B., de Marneffe, O., Pereira, O., Quisquater, J.-J.: Electing a university president using open-audit voting: Analysis of real-world use of Helios. In: Moran, T., Jefferson, D., Hall, J.L. (eds.) Electronic Voting Technology Workshop/Workshop on Trustworthy Elections. Usenix (August 2009)

4. Lecture Notes in Computer Science;M. Arapinis,2013

5. Lecture Notes in Computer Science;P.S.L.M. Barreto,2003

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Encryption Mechanisms for Receipt-Free and Perfectly Private Verifiable Elections;Lecture Notes in Computer Science;2024

2. Efficient Universally-Verifiable Electronic Voting with Everlasting Privacy;Lecture Notes in Computer Science;2024

3. Decentralized universally verifiable stake voting system with perfect privacy;Cryptologia;2023-12-18

4. AUC: Accountable Universal Composability;2023 IEEE Symposium on Security and Privacy (SP);2023-05

5. Anonymity and everlasting privacy in electronic voting;International Journal of Information Security;2023-02-15