{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T12:37:26Z","timestamp":1764333446787,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T00:00:00Z","timestamp":1722297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,30]]},"DOI":"10.1145\/3664476.3664503","type":"proceedings-article","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T12:35:50Z","timestamp":1721910950000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9681-8824","authenticated-orcid":false,"given":"Tamir","family":"Tassa","sequence":"first","affiliation":[{"name":"The Open University of Israel, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8710-3349","authenticated-orcid":false,"given":"Lihi","family":"Dery","sequence":"additional","affiliation":[{"name":"Ariel University, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Helios: Web-based Open-Audit Voting.. In USENIX security symposium, Vol.\u00a017. 335\u2013348.","author":"Adida Ben","year":"2008","unstructured":"Ben Adida. 2008. Helios: Web-based Open-Audit Voting.. In USENIX security symposium, Vol.\u00a017. 335\u2013348."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0702634104"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Josh Benaloh. 1986. Secret sharing homomorphisms: Keeping shares of a secret secret. In CRYPTO. 251\u2013260.","DOI":"10.1007\/3-540-47721-7_19"},{"key":"e_1_3_2_1_4_1","volume-title":"Safeguarding Cryptographic Keys. In International Workshop on Managing Requirements Knowledge. 48: 313\u2013317","author":"Blakley R.","year":"1979","unstructured":"George\u00a0R. Blakley. 1979. Safeguarding Cryptographic Keys. In International Workshop on Managing Requirements Knowledge. 48: 313\u2013317."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Philippe Golle. 2002. Almost entirely correct mixing with applications to voting. In CCS. 68\u201377.","DOI":"10.1145\/586110.586121"},{"volume-title":"Handbook of computational social choice","author":"Brandt Felix","key":"e_1_3_2_1_6_1","unstructured":"Felix Brandt, Vincent Conitzer, Ulle Endriss, J\u00e9r\u00f4me Lang, and Ariel\u00a0D Procaccia. 2016. Handbook of computational social choice. Cambridge University Press."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Felix Brandt and Tuomas Sandholm. 2005. Decentralized voting with unconditional privacy. In AAMAS. 357\u2013364.","DOI":"10.1145\/1082473.1082528"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Ernest\u00a0F. Brickell. 1989. Some Ideal Secret Sharing Schemes. In EUROCRYPT. 468\u2013475.","DOI":"10.1007\/3-540-46885-4_45"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98989-1_17"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Ioannis Caragiannis Ariel\u00a0D Procaccia and Nisarg Shah. 2014. Modal ranking: A uniquely robust voting rule. In AAAI. 728\u2013734.","DOI":"10.1609\/aaai.v28i1.8811"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"David Chaum. 1988. Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA. In EUROCRYPT. 177\u2013182.","DOI":"10.1007\/3-540-45961-8_15"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Koji Chida Daniel Genkin Koki Hamada Dai Ikarashi Ryo Kikuchi Yehuda Lindell and Ariel Nof. 2018. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In CRYPTO. 34\u201364.","DOI":"10.1007\/978-3-319-96878-0_2"},{"volume-title":"Mimeographed notes from a Seminar on Applications of Mathematics to the Social Sciences","author":"Copeland H","key":"e_1_3_2_1_15_1","unstructured":"Arthur\u00a0H Copeland. 1951. A reasonable social welfare function. In Mimeographed notes from a Seminar on Applications of Mathematics to the Social Sciences, University of Michigan."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-17146-8_31"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Ronald Cramer Rosario Gennaro and Berry Schoenmakers. 1997. A secure and optimally efficient multi-authority election scheme. In EUROCRYPT. 103\u2013118.","DOI":"10.1007\/3-540-69053-0_9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-010-0119-9"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Jesper\u00a0Buus Nielsen. 2007. Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO. 572\u2013590.","DOI":"10.1007\/978-3-540-74143-5_32"},{"volume-title":"The method of paired comparisons. Vol.\u00a012","author":"David Herbert\u00a0Aron","key":"e_1_3_2_1_20_1","unstructured":"Herbert\u00a0Aron David. 1963. The method of paired comparisons. Vol.\u00a012. London."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114434"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1641503.1641510"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.10.016"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-011-9101-6"},{"key":"e_1_3_2_1_25_1","volume-title":"Working Conference on Verified Software: Theories, Tools, and Experiments. 36\u201353","author":"Haines Thomas","year":"2019","unstructured":"Thomas Haines, Dirk Pattinson, and Mukesh Tiwari. 2019. Verifiable homomorphic tallying for the Schulze vote counting scheme. In Working Conference on Verified Software: Theories, Tools, and Experiments. 36\u201353."},{"key":"e_1_3_2_1_26_1","volume-title":"Hare-Niemeyer, Condorcet, and Instant-Runoff Voting. In E-Vote-ID","author":"Hertel Fabian","year":"2021","unstructured":"Fabian Hertel, Nicolas Huber, Jonas Kittelberger, Ralf K\u00fcsters, Julian Liedtke, and Daniel Rausch. 2021. Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting. In E-Vote-ID 2021. University of Tartu Press, 269\u2013284."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.06.003"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560701"},{"key":"e_1_3_2_1_29_1","unstructured":"Markus Jakobsson Ari Juels and Ronald\u00a0L Rivest. 2002. Making mix nets robust for electronic voting by randomized partial checking.. In USENIX security symposium. 339\u2013353."},{"key":"e_1_3_2_1_30_1","first-page":"577","article-title":"Mathematics without numbers","volume":"88","author":"Kemeny G","year":"1959","unstructured":"John\u00a0G Kemeny. 1959. Mathematics without numbers. Daedalus 88, 4 (1959), 577\u2013591.","journal-title":"Daedalus"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP48549.2020.00022"},{"key":"e_1_3_2_1_32_1","volume-title":"International conference on information security and cryptology. 245\u2013258","author":"Lee Byoungcheon","year":"2003","unstructured":"Byoungcheon Lee, Colin Boyd, Ed Dawson, Kwangjo Kim, Jeongmo Yang, and Seungjae Yoo. 2003. Providing receipt-freeness in mixnet-based voting protocols. In International conference on information security and cryptology. 245\u2013258."},{"key":"e_1_3_2_1_33_1","volume-title":"An Improved E-voting scheme using Secret Sharing based Secure Multi-party Computation. CoRR abs\/1502.07469","author":"Nair G.","year":"2015","unstructured":"Divya\u00a0G. Nair, V.\u00a0P. Binu, and G.\u00a0Santhosh Kumar. 2015. An Improved E-voting scheme using Secret Sharing based Secure Multi-party Computation. CoRR abs\/1502.07469 (2015)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"C\u00a0Andrew Neff. 2001. A verifiable secret shuffle and its application to e-voting. In CCS. 116\u2013125.","DOI":"10.1145\/501983.502000"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Takashi Nishide and Kazuo Ohta. 2007. Multiparty Computation for Interval Equality and Comparison Without Bit-Decomposition Protocol. In PKC. 343\u2013360.","DOI":"10.1007\/978-3-540-71677-8_23"},{"key":"e_1_3_2_1_36_1","volume-title":"International conference on Computer Networks, Big data and IoT. 811\u2013819","author":"Priya J\u00a0Chandra","year":"2018","unstructured":"J\u00a0Chandra Priya, Ponsy RK\u00a0Sathia Bhama, S Swarnalaxmi, A\u00a0Aisathul Safa, and I Elakkiya. 2018. Blockchain centered homomorphic encryption: A secure solution for E-balloting. In International conference on Computer Networks, Big data and IoT. 811\u2013819."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054119400100"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Kazue Sako and Joe Kilian. 1995. Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth. In EUROCRYPT. 393\u2013403.","DOI":"10.1007\/3-540-49264-X_32"},{"key":"e_1_3_2_1_39_1","volume-title":"A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method. Social choice and Welfare 36, 2","author":"Schulze Markus","year":"2011","unstructured":"Markus Schulze. 2011. A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method. Social choice and Welfare 36, 2 (2011), 267\u2013303."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_41_1","volume-title":"On defining areas of voter choice: Professor Tullock on stable voting. The Quarterly Journal of Economics","author":"Simpson B","year":"1969","unstructured":"Paul\u00a0B Simpson. 1969. On defining areas of voter choice: Professor Tullock on stable voting. The Quarterly Journal of Economics (1969), 478\u2013490."},{"key":"e_1_3_2_1_42_1","unstructured":"Alan Szepieniec and Bart Preneel. 2015. New techniques for electronic voting. In USENIX Journal of Election Technology and Systems (JETS) Vol.\u00a03. 43\u201369."},{"key":"e_1_3_2_1_43_1","volume-title":"Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules. CoRR abs\/2205.10580","author":"Tassa Tamir","year":"2022","unstructured":"Tamir Tassa and Lihi Dery. 2022. Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules. CoRR abs\/2205.10580 (2022)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Tamir Tassa and Nira Dyn. 2006. Multipartite Secret Sharing by Bivariate Interpolation. In ICALP. 288\u2013299.","DOI":"10.1007\/11787006_25"},{"key":"e_1_3_2_1_45_1","volume-title":"The Multiple Millionaires\u2019 Problem: New Algorithmic Approaches and Protocols. In The 24th Privacy Enhancing Technologies Symposium (PETS).","author":"Tassa Tamir","year":"2024","unstructured":"Tamir Tassa and Avishay Yanai. 2024. The Multiple Millionaires\u2019 Problem: New Algorithmic Approaches and Protocols. In The 24th Privacy Enhancing Technologies Symposium (PETS)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2817518"},{"key":"e_1_3_2_1_47_1","unstructured":"Andrew Chi-Chih Yao. 1982. Protocols for secure computation. In FOCS. 160\u2013164."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1257\/jep.9.1.51"}],"event":{"name":"ARES 2024: The 19th International Conference on Availability, Reliability and Security","acronym":"ARES 2024","location":"Vienna Austria"},"container-title":["Proceedings of the 19th International Conference on Availability, Reliability and Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664476.3664503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3664476.3664503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:54:08Z","timestamp":1755881648000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3664476.3664503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,30]]},"references-count":48,"alternative-id":["10.1145\/3664476.3664503","10.1145\/3664476"],"URL":"https:\/\/doi.org\/10.1145\/3664476.3664503","relation":{},"subject":[],"published":{"date-parts":[[2024,7,30]]},"assertion":[{"value":"2024-07-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}