A secure method of voting and planning based on quadratic voting

[1] The mathematical method that could offer a fairer way to vote. https://www.economist.com/christmasspecials/2021/12/18/the-mathematical-method-that-could-offer-a-fairer-way-to-vote. The Economist, 2021.
[2] V. Augoye, Electronic voting: An electronic voting scheme using the secure payment card system, tech. rep.,
Information Security Group Royal Holloway, University of London Egham, Surrey TW20 0EX, UK, 2013.
[3] V. Augoye and A. Tomlinson, Mutual authentication in electronic voting schemes, in 16th Annual Conference on Privacy, Security and Trust (PST), 2018, pp. 1–2.
[4] O. Baudron, P.-A. Fouque, D. Pointcheval, J. Stern, and G. Poupard, Practical multi-candidate
election system, in Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC ’01, New York, NY, USA, 2001, Association for Computing Machinery, pp. 274–283.
[5] J. Bone, The new voting system that could save our democracies. https://www.nesta.org.uk/feature/tenpredictions-2020/new-voting-system-could-save-our-democracies, 2019.
[6] B. Bunz, J. Bootle, D. Boneh, A. Poelstra, P. Wuille, and G. Maxwell ¨ , Bulletproofs: Short
proofs for confidential transactions and more, in 2018 IEEE Symposium on Security and Privacy (SP), 2018,
pp. 315–334.
[7] J. Camenisch and M. Stadler, Proof systems for general statements about discrete logarithms, tech. rep.,
ETH Zurich, Department of Computer Science, 1997.
[8] M. Chaieb, M. Koscina, S. Yousfi, P. Lafourcade, and R. Robbana, Dabsters: Distributed authorities using blind signature to effect robust security in e-voting, in Proceedings of the 16th International Joint
Conference on e-Business and Telecommunications - SECRYPT, INSTICC, SciTePress, 2019, pp. 228–235.
[9] L. Chancel, T. Piketty, E. Saez, and G. Zucman, World inequality report 2022, Harvard University
Press, 2022.
[10] D. Chaum, Blind signatures for untraceable payments, in Advances in Cryptology, D. Chaum, R. L. Rivest,
and A. T. Sherman, eds., Boston, MA, 1983, Springer US, pp. 199–203.

[11] I. Chillotti, N. Gama, M. Georgieva, and M. Izabachene ` , A homomorphic lwe based e-voting scheme,
in Proceedings of the 7th International Workshop on Post-Quantum Cryptography - Volume 9606, PQCrypto
2016, Berlin, Heidelberg, 2016, Springer-Verlag, p. 245–265.
[12] J. D. Cohen and M. J. Fischer, A robust and verifiable cryptographically secure election scheme, in 26th
Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985, pp. 372–382.
[13] P. Coy, A new way of voting that makes zealotry expensive, Bloomberg L.P., (2019).
[14] J. P. Cruz and Y. Kaji, E-voting system based on the Bitcoin protocol and blind signatures, IPSJ Transactions
on Mathematical Modeling and Its Applications, 10 (2017), pp. 14–22.
[15] C. Culnane and S. Schneider, A peered bulletin board for robust use in verifiable voting systems, in IEEE
27th Computer Security Foundations Symposium, 2014, pp. 169–183.
[16] L. Dery, T. Tassa, and A. Yanai, Fear not, vote truthfully: Secure multiparty computation of score based
rules, Expert Systems with Applications, 168 (2021), p. 114434.
[17] Y. G. Desmedt, ed., Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, Springer,
Berlin, Heidelberg, 1994.
[18] W. Y.-m. GAO Hu-ming, WANG Ji-lin, An electronic voting scheme based on a new mix net, Acta Electronica Sinica, 32 (2004), pp. 1047–1049.
[19] P. Grontas, A. Pagourtzis, and A. Zacharakis, Coercion resistance in a practical secret voting scheme
for large scale elections, in 2017 14th International Symposium on Pervasive Systems, Algorithms and Networks & 2017 11th International Conference on Frontier of Computer Science and Technology & 2017 Third
International Symposium of Creative Computing (ISPAN-FCST-ISCC), 2017, pp. 514–519.
[20] S. James, N. Gayathri, and P. V. Reddy, Pairing free identity-based blind signature scheme with message
recovery, Cryptography, 2 (2018).
[21] R. Joaquim, P. Ferreira, and C. Ribeiro, Eviv: An end-to-end verifiable internet voting system, Computers & Security, 32 (2013), pp. 170–191.
[22] M. Kumar, S. Chand, and C. P. Katti, A secure end-to-end verifiable internet-voting system using identitybased blind signature, IEEE Systems Journal, 14 (2020), pp. 2032–2041.
[23] R. Kusters, J. Liedtke, J. M ¨ uller, D. Rausch, and A. Vogt ¨ , Ordinos: A verifiable tally-hiding e-voting
system, in 2020 IEEE European Symposium on Security and Privacy (EuroS&P), 2020, pp. 216–235.
[24] S. P. Lalley and E. G. Weyl, Quadratic voting: How mechanism design can radicalize democracy, AEA
Papers and Proceedings, 108 (2018), pp. 33–37.
[25] M. Ohkubo, F. Miura, M. Abe, A. Fujioka, and T. Okamoto, An improvement on a practical secret
voting scheme, in Information Security. ISW 1999, M. Mambo and Y. Zheng, eds., 1999, pp. 225–234.
[26] S. Park and R. L. Rivest, Towards secure quadratic voting, Public Choice, 172 (2017), pp. 151–175.
[27] K. Peng, R. Aditya, C. Boyd, E. Dawson, and B. Lee, Multiplicative homomorphic e-voting, in Proceedings of the 5th International Conference on Cryptology in India, INDOCRYPT’04, Berlin, Heidelberg,
2004, Springer-Verlag, pp. 61–72.
[28] A. J. Perez and E. N. Ceesay, Improving end-to-end verifiable voting systems with blockchain technologies,
in IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data
(SmartData), 2018, pp. 1108–1115.
[29] E. A. Posner and E. G. Weyl, Voting squared: Quadratic voting in democratic politics, Vanderbilt Law
Review, 68 (2015), pp. 441–500.
[30] H. Pu, Z. Cui, and T. Liu, An electronic voting scheme using secure multi-party computation based on secret
sharing, International Journal of Network Security, 23 (2021), pp. 997–1004.
[31] D. Quarfoot, D. von Kohorn, K. Slavin, R. Sutherland, D. Goldstein, and E. Konar, Quadratic
voting in the wild: real people, real votes, Public Choice, 172 (2017), pp. 283–303.

[32] K. Sako and J. Kilian, Receipt-free mix-type voting scheme: a practical solution to the implementation of
a voting booth, in Proceedings of the 14th Annual International Conference on Theory and Application of
Cryptographic Techniques, EUROCRYPT’95, Berlin, Heidelberg, 1995, Springer-Verlag, pp. 393–403.
[33] B. Smyth, Mind the gap: Individual- and universal-verifiability plus cast-as-intended don’t yield verifiable
voting systems. Cryptology ePrint Archive, 2020.
[34] G. K. Verma, B. Singh, and H. Singh, Provably secure certificate-based proxy blind signature scheme from
pairings, Information Sciences, 468 (2018), pp. 1–13.
[35] E. G. Weyl, The robustness of quadratic voting, Public Choice, 172 (2017), pp. 75–107.
[36] X. Yang, X. Yi, C. Ryan, R. van Schyndel, F. Han, S. Nepal, and A. Song, A verifiable ranked
choice internet voting system, in Web Information Systems Engineering – WISE 2017, A. Bouguettaya, Y. Gao,
A. Klimenko, L. Chen, X. Zhang, F. Dzerzhinskiy, W. Jia, S. V. Klimenko, and Q. Li, eds., vol. 6, Springer
International Publishing, 2017, pp. 490–501.
[37] H. Zhu, Y.-a. Tan, L. Zhu, Q. Zhang, and Y. Li, An efficient identity-based proxy blind signature for
semioffline services, Wireless Communications and Mobile Computing, 2018 (2018), p. 5401890.