{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:10:21Z","timestamp":1775913021908,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T00:00:00Z","timestamp":1131321600000},"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":[],"published-print":{"date-parts":[[2005,11,7]]},"DOI":"10.1145\/1102199.1102213","type":"proceedings-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T15:52:40Z","timestamp":1139241160000},"page":"61-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":271,"title":["Coercion-resistant electronic elections"],"prefix":"10.1145","author":[{"given":"Ari","family":"Juels","sequence":"first","affiliation":[{"name":"RSA Laboratories, Bedford, MA"}]},{"given":"Dario","family":"Catalano","sequence":"additional","affiliation":[{"name":"CNRS - Ecole Normale Sup\u00e9rieure, Paris Cedex, France"}]},{"given":"Markus","family":"Jakobsson","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN"}]}],"member":"320","published-online":{"date-parts":[[2005,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Shareholder election website","year":"2005","unstructured":"Proxyvote.com : Shareholder election website , 2005 . URL : www.proxyvote.com.]] Proxyvote.com: Shareholder election website, 2005. URL: www.proxyvote.com.]]"},{"key":"e_1_3_2_1_2_1","unstructured":"Vote-auction 2005. URL: www.vote-auction.net.]]  Vote-auction 2005. URL: www.vote-auction.net.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384044"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195407"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220068"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/648184.749735"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586121"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/517876"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/647086.715698"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646762.706305"},{"key":"e_1_3_2_1_12_1","first-page":"90","volume-title":"CRYPTO '97","author":"Canetti R.","year":"1997","unstructured":"R. Canetti , C. Dwork , M. Naor , and R. Ostrovsky . Deniable encryption. In B. Kaliski, editor , CRYPTO '97 , pages 90 -- 104 , 1997 . LNCS no. 1294.]] R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky. Deniable encryption. In B. Kaliski, editor, CRYPTO '97, pages 90--104, 1997. LNCS no. 1294.]]"},{"key":"e_1_3_2_1_13_1","first-page":"98","volume-title":"Adaptive security for threshold cryptosystems","author":"Canetti R.","year":"1999","unstructured":"R. Canetti , R. Gennaro , S. J. H. Krawczyk , and T. Rabin . Adaptive security for threshold cryptosystems . In M. Wiener, editor, CRYPTO '99, pages 98 -- 115 . Springer-Verlag , 1999 . LNCS no. 1666.]] R. Canetti, R. Gennaro, S. J. H. Krawczyk, and T. Rabin. Adaptive security for threshold cryptosystems. In M. Wiener, editor, CRYPTO '99, pages 98--115. Springer-Verlag, 1999. LNCS no. 1666.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646759.705842"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-69053-0_9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646763.706340"},{"key":"e_1_3_2_1_18_1","volume-title":"Public domain","author":"Cross M.","year":"2004","unstructured":"M. Cross . Public domain . The Guardian : Guardian Unlimited Online , 10 June 2004 .]] M. Cross. Public domain. The Guardian: Guardian Unlimited Online, 10 June 2004.]]"},{"key":"e_1_3_2_1_19_1","article-title":"Switzerland tests virtual democracy in national referendum","author":"Fowler J.","year":"2004","unstructured":"J. Fowler . Switzerland tests virtual democracy in national referendum . Technology Review , 26 September 2004 .]] J. Fowler. Switzerland tests virtual democracy in national referendum. Technology Review, 26 September 2004.]]","journal-title":"Technology Review"},{"key":"e_1_3_2_1_20_1","first-page":"244","volume-title":"A practical secret voting scheme for large scale elections","author":"Fujioka A.","year":"1992","unstructured":"A. Fujioka , T. Okamoto , and K. Ohta . A practical secret voting scheme for large scale elections . In J. Seberry and Y. Zheng, editors, ASIACRYPT '92, pages 244 -- 251 . Springer-Verlag , 1992 . LNCS no. 718.]] A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In J. Seberry and Y. Zheng, editors, ASIACRYPT '92, pages 244--251. Springer-Verlag, 1992. LNCS no. 718.]]"},{"key":"e_1_3_2_1_21_1","first-page":"319","volume-title":"B. et al.","author":"Furukawa J.","year":"2004","unstructured":"J. Furukawa . Efficient , verifiable shuffle decryption and its requirement of unlinkability . In B. et al. , editor, PKC '04, pages 319 -- 332 . Springer-Verlag , 2004 . LNCS no. 2947.]] J. Furukawa. Efficient, verifiable shuffle decryption and its requirement of unlinkability. In B. et al., editor, PKC '04, pages 319--332. Springer-Verlag, 2004. LNCS no. 2947.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"J.\n      Furukawa\n     and \n      K.\n      Sako\n  . \n  An efficient scheme for proving a shuffle\n  . In J. Kilian editor CRYPTO '01 volume \n  2139\n   of \n  Lecture Notes in Computer Science pages \n  368\n  --\n  387\n  . \n  Springer-Verlag 2001\n  .]]   J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In J. Kilian editor CRYPTO '01 volume 2139 of Lecture Notes in Computer Science pages 368--387. Springer-Verlag 2001.]]","DOI":"10.1007\/3-540-44647-8_22"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"e_1_3_2_1_24_1","first-page":"295","volume-title":"The (in)security of distributed key generation in dlog-based cryptosystems","author":"Gennaro R.","year":"1999","unstructured":"R. Gennaro , S. Jarecki , H. Krawczyk , and T. Rabin . The (in)security of distributed key generation in dlog-based cryptosystems . In J. Stern, editor, EUROCRYPT '99, pages 295 -- 310 . Springer-Verlag , 1999 . LNCS no. 1592.]] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. The (in)security of distributed key generation in dlog-based cryptosystems. In J. Stern, editor, EUROCRYPT '99, pages 295--310. Springer-Verlag, 1999. LNCS no. 1592.]]"},{"key":"e_1_3_2_1_25_1","first-page":"539","volume-title":"EUROCRYPT '00","author":"Hirt M.","year":"2000","unstructured":"M. Hirt and K. Sako . Efficient receipt-free voting based on homomorphic encryption. In B. Preneel, editor , EUROCRYPT '00 , pages 539 -- 556 , 2000 . LNCS no. 1807.]] M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In B. Preneel, editor, EUROCRYPT '00, pages 539--556, 2000. LNCS no. 1807.]]"},{"key":"e_1_3_2_1_26_1","first-page":"162","volume-title":"Advances in Cryptology - Asiacrypt '00","author":"Jakobsson M.","year":"2000","unstructured":"M. Jakobsson and A. Juels . Mix and match: Secure function evaluation via ciphertexts . In T. Okamoto, editor, Advances in Cryptology - Asiacrypt '00 , pages 162 -- 177 . Springer-Verlag , 2000 . LNCS No. 1976.]] M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In T. Okamoto, editor, Advances in Cryptology - Asiacrypt '00, pages 162--177. Springer-Verlag, 2000. LNCS No. 1976.]]"},{"key":"e_1_3_2_1_27_1","first-page":"339","volume-title":"USENIX '02","author":"Jakobsson M.","year":"2002","unstructured":"M. Jakobsson , A. Juels , and R. Rivest . Making mix nets robust for electronic voting by randomized partial checking. In D. Boneh, editor , USENIX '02 , pages 339 -- 353 , 2002 .]] M. Jakobsson, A. Juels, and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In D. Boneh, editor, USENIX '02, pages 339--353, 2002.]]"},{"key":"e_1_3_2_1_28_1","first-page":"143","volume-title":"Designated verifier proofs and their applications","author":"Jakobsson M.","year":"1996","unstructured":"M. Jakobsson , K. Sako , and R. Impagliazzo . Designated verifier proofs and their applications . In U. Maurer, editor, EUROCRYPT '96, pages 143 -- 154 . Springer-Verlag , 1996 . LNCS no. 1070.]] M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In U. Maurer, editor, EUROCRYPT '96, pages 143--154. Springer-Verlag, 1996. LNCS no. 1070.]]"},{"key":"e_1_3_2_1_29_1","first-page":"151","volume-title":"Proceedings of the 1999 ISOC Network and Distributed System Security Symposium","author":"Juels A.","year":"1999","unstructured":"A. Juels and J. Brainard . Client puzzles: A cryptographic countermeasure against connection depletion attacks . In Proceedings of the 1999 ISOC Network and Distributed System Security Symposium , pages 151 -- 165 , 1999 .]] A. Juels and J. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proceedings of the 1999 ISOC Network and Distributed System Security Symposium, pages 151--165, 1999.]]"},{"key":"e_1_3_2_1_30_1","first-page":"141","volume-title":"Self-tallying elections and perfect ballot secrecy","author":"Kiayias A.","year":"2000","unstructured":"A. Kiayias and M. Yung . Self-tallying elections and perfect ballot secrecy . In D. Naccache and P. Paillier, editors, PKC '02, pages 141 -- 158 . Springer-Verlag , 2000 . LNCS no. 2274.]] A. Kiayias and M. Yung. Self-tallying elections and perfect ballot secrecy. In D. Naccache and P. Paillier, editors, PKC '02, pages 141--158. Springer-Verlag, 2000. LNCS no. 2274.]]"},{"key":"e_1_3_2_1_31_1","first-page":"385","volume-title":"CRYPTO '02","author":"MacKenzie P.","year":"2002","unstructured":"P. MacKenzie , T. Shrimpton , and M. Jakobsson . Threshold password-authenticated key exchange. In M. Yung, editor , CRYPTO '02 , pages 385 -- 400 , 2002 . LNCS no. 2442.]] P. MacKenzie, T. Shrimpton, and M. Jakobsson. Threshold password-authenticated key exchange. In M. Yung, editor, CRYPTO '02, pages 385--400, 2002. LNCS no. 2442.]]"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/647853.737713"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/647093.716542"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502000"},{"key":"e_1_3_2_1_35_1","first-page":"164","volume-title":"How to prevent buying of votes in computer elections","author":"Niemi V.","year":"1994","unstructured":"V. Niemi and A. Renvall . How to prevent buying of votes in computer elections . In J. Pieprzyk and R. Safavi-Naini, editors, ASIACRYPT '94, pages 164 -- 170 . Springer-Verlag , 1994 . LNCS no. 917.]] V. Niemi and A. Renvall. How to prevent buying of votes in computer elections. In J. Pieprzyk and R. Safavi-Naini, editors, ASIACRYPT '94, pages 164--170. Springer-Verlag, 1994. LNCS no. 917.]]"},{"key":"e_1_3_2_1_36_1","first-page":"21","volume-title":"IFIP World Congress","author":"Okamoto T.","year":"1996","unstructured":"T. Okamoto . An electronic voting scheme. In N. T. et al., editor , IFIP World Congress , pages 21 -- 30 , 1996 .]] T. Okamoto. An electronic voting scheme. In N. T. et al., editor, IFIP World Congress, pages 21--30, 1996.]]"},{"key":"e_1_3_2_1_37_1","first-page":"25","volume-title":"Security Protocols Workshop","author":"Okamoto T.","year":"1997","unstructured":"T. Okamoto . Receipt-free electronic voting schemes for large scale elections. In B. C. et al., editor , Security Protocols Workshop , pages 25 -- 35 . Springer-Verlag , 1997 . LNCS no. 1361.]] T. Okamoto. Receipt-free electronic voting schemes for large scale elections. In B. C. et al., editor, Security Protocols Workshop, pages 25--35. Springer-Verlag, 1997. LNCS no. 1361.]]"},{"key":"e_1_3_2_1_38_1","volume-title":"The Guardian","author":"Parker S.","year":"2001","unstructured":"S. Parker . Shaking voter apathy up with IT . The Guardian , 11 Dec. 2001 .]] S. Parker. Shaking voter apathy up with IT. The Guardian, 11 Dec. 2001.]]"},{"key":"e_1_3_2_1_39_1","first-page":"393","volume-title":"L. Guillou and J.-J","author":"Sako K.","year":"1995","unstructured":"K. Sako and J. Kilian . Receipt-free mix-type voting scheme - a practical solution to the implementation of a voting booth . In L. Guillou and J.-J . Quisquater, editors, EUROCRYPT '95, pages 393 -- 403 . Springer-Verlag , 1995 . LNCS no. 921.]] K. Sako and J. Kilian. Receipt-free mix-type voting scheme - a practical solution to the implementation of a voting booth. In L. Guillou and J.-J. Quisquater, editors, EUROCRYPT '95, pages 393--403. Springer-Verlag, 1995. LNCS no. 921.]]"},{"key":"e_1_3_2_1_40_1","first-page":"148","volume-title":"CRYPTO '99","author":"Schoenmakers B.","year":"1999","unstructured":"B. Schoenmakers . A simple publicly verifiable secret sharing scheme and its application to electronic voting. In M. Wiener, editor, CRYPTO '99 , pages 148 -- 164 . Springer-Verlag , 1999 . LNCS no. 1666.]] B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. In M. Wiener, editor, CRYPTO '99, pages 148--164. Springer-Verlag, 1999. LNCS no. 1666.]]"},{"key":"e_1_3_2_1_41_1","unstructured":"B. Schoenmakers 2000. Personal communication.]]  B. Schoenmakers 2000. Personal communication.]]"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/648115.746431"}],"event":{"name":"CCS05: 12th ACM Conference on Computer and Communications Security 2005","location":"Alexandria VA USA","acronym":"CCS05","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2005 ACM workshop on Privacy in the electronic society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1102199.1102213","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1102199.1102213","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:08Z","timestamp":1750262888000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1102199.1102213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,7]]},"references-count":42,"alternative-id":["10.1145\/1102199.1102213","10.1145\/1102199"],"URL":"https:\/\/doi.org\/10.1145\/1102199.1102213","relation":{},"subject":[],"published":{"date-parts":[[2005,11,7]]},"assertion":[{"value":"2005-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}