{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:13:42Z","timestamp":1768522422179,"version":"3.49.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2010,2]]},"abstract":"<jats:p>In this article, we propose a new voting protocol with several desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every voter with the means to verify that all the votes were counted correctly (universal verifiability) while preserving ballot secrecy. The protocol has \u201ceverlasting privacy\u201d: Even a computationally unbounded adversary gains no information about specific votes from observing the protocol's output. Unlike previous protocols with these properties, this protocol distributes trust between two authorities: a single corrupt authority will not cause voter privacy to be breached. Finally, the protocol is receipt-free: A voter cannot prove how she voted even if she wants to do so. We formally prove the security of the protocol in the universal composability framework, based on number-theoretic assumptions.<\/jats:p>","DOI":"10.1145\/1698750.1698756","type":"journal-article","created":{"date-parts":[[2010,3,9]],"date-time":"2010-03-09T16:34:59Z","timestamp":1268152499000},"page":"1-43","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Split-ballot voting"],"prefix":"10.1145","volume":"13","author":[{"given":"Tal","family":"Moran","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Israel"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Israel"}]}],"member":"320","published-online":{"date-parts":[[2010,3,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179601.1179607"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003845"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of The 12th Annual International Cryptology Conference (CRYPTO'92)","author":"Bellare M."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195407"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756212"},{"key":"e_1_2_1_6_1","unstructured":"Bryans J. W. and Ryan P. Y. A. 2004. A simplified version of the Chaum voting scheme. Tech. rep. CS-TR 843 University of Newcastle.  Bryans J. W. and Ryan P. Y. A. 2004. A simplified version of the Chaum voting scheme. Tech. rep. CS-TR 843 University of Newcastle."},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'99)","author":"Camenisch J."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 37th Annual Symposium on Foundations of Computer Science. IEEE","author":"Canetti R."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSECP.2004.1264852"},{"key":"e_1_2_1_12_1","unstructured":"Chaum D. 2006. http:\/\/punchscan.org\/.  Chaum D. 2006. http:\/\/punchscan.org\/."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.2"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROTCRYPT'96)","author":"Cramer R."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROTCRYPT'97)","author":"Cramer R."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT'02)","author":"Damgrd I. B."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques (AUSCRYPT'92)","author":"Fujioka A."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography (PKC'03)","author":"Groth J.","year":"2002"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT'00)","author":"Hirt M."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_22"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT'94)","author":"Naor M."},{"key":"e_1_2_1_22_1","unstructured":"Neff C. A. 2004. Practical high certainty intent verification for encrypted votes. http:\/\/www.votehere.net\/vhti\/documentation\/vsv-2.0.3638.pdf.  Neff C. A. 2004. Practical high certainty intent verification for encrypted votes. http:\/\/www.votehere.net\/vhti\/documentation\/vsv-2.0.3638.pdf."},{"key":"e_1_2_1_23_1","unstructured":"Popoveniuc S. and Hosp B. 2006. An introduction to punchscan. http:\/\/punchscan.org\/papers\/popoveniuc_hosp_punchscan_introduction.pdf.  Popoveniuc S. and Hosp B. 2006. An introduction to punchscan. http:\/\/punchscan.org\/papers\/popoveniuc_hosp_punchscan_introduction.pdf."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90042-9"},{"key":"e_1_2_1_25_1","unstructured":"Reynolds D. J. 2005. A method for electronic voting with coercion-free receipt. Presentation http:\/\/www.win.tue.nl\/~berry\/fee2005\/presentations\/reynolds.ppt.  Reynolds D. J. 2005. A method for electronic voting with coercion-free receipt. Presentation http:\/\/www.win.tue.nl\/~berry\/fee2005\/presentations\/reynolds.ppt."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1045405.1045414"},{"key":"e_1_2_1_27_1","volume-title":"RSA conference. Webcast: http:\/\/media.omediaweb.com\/rsa2006\/1_5\/1_5_High.asx.","author":"Shamir A.","year":"2006"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1698750.1698756","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1698750.1698756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:58Z","timestamp":1750278178000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1698750.1698756"}},"subtitle":["Everlasting privacy with distributed trust"],"short-title":[],"issued":{"date-parts":[[2010,2]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["10.1145\/1698750.1698756"],"URL":"https:\/\/doi.org\/10.1145\/1698750.1698756","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"value":"1094-9224","type":"print"},{"value":"1557-7406","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2]]},"assertion":[{"value":"2008-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-03-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}