{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:44:00Z","timestamp":1768520640694,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642176180","type":"print"},{"value":"9783642176197","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17619-7_20","type":"book-chapter","created":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T11:45:07Z","timestamp":1291117507000},"page":"278-297","source":"Crossref","is-referenced-by-count":32,"title":["Towards Practical and Secure Coercion-Resistant Electronic Elections"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Ara\u00fajo","sequence":"first","affiliation":[]},{"given":"Narjes","family":"Ben Rajeb","sequence":"additional","affiliation":[]},{"given":"Riadh","family":"Robbana","sequence":"additional","affiliation":[]},{"given":"Jacques","family":"Traor\u00e9","sequence":"additional","affiliation":[]},{"given":"Souheib","family":"Youssfi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Ara\u00fajo, R.: On Remote and Voter-Verifiable Voting. PhD thesis, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany (September 2008)"},{"key":"20_CR2","unstructured":"Ara\u00fajo, R., Foulle, S., Traor\u00e9, J.: A practical and secure coercion-resistant scheme for remote elections. In: Chaum, D., Kutylowski, M., Rivest, R.L., Ryan, P.Y.A. (eds.) Frontiers of Electronic Voting, Dagstuhl Seminar Proceedings, Dagstuhl, Germany, vol.\u00a007311, Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany (2008)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D. Boneh","year":"1998","unstructured":"Boneh, D.: The decision diffie-hellman problem. In: Buhler, J. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 48\u201363. Springer, Heidelberg (1998)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"CRYPTO 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"CRYPTO 1992","year":"1993","unstructured":"Brickell, E.F. (ed.): CRYPTO 1992. LNCS, vol.\u00a0740. Springer, Heidelberg (1993)"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/343477.343531","volume-title":"PODC","author":"C. Cachin","year":"2000","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography (extended abstract). In: Neiger, G. (ed.) PODC, pp. 123\u2013132. ACM, New York (2000)"},{"key":"20_CR8","first-page":"201","volume-title":"ACM Conference on Computer and Communications Security","author":"J. Camenisch","year":"2006","unstructured":"Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., Meyerovich, M.: How to win the clone wars: efficient periodic n-times anonymous authentication. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM Conference on Computer and Communications Security, pp. 201\u2013210. ACM, New York (2006)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-3-642-01001-9_25","volume-title":"EUROCRYPT","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Kiayias, A., Yung, M.: On the portability of generalized schnorr proofs. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 425\u2013442. Springer, Heidelberg (2009)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., Gennaro, R.: Incoercible multiparty computation (extended abstract). In: FOCS, pp. 504\u2013513 (1996)","DOI":"10.1109\/SFCS.1996.548509"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses and digital pseudonyms. Communications of the ACM\u00a024(2), 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell [6], pp. 89\u2013105","DOI":"10.1007\/3-540-48071-4_7"},{"key":"20_CR14","first-page":"354","volume-title":"IEEE Symposium on Security and Privacy","author":"M.R. Clarkson","year":"2008","unstructured":"Clarkson, M.R., Chong, S., Myers, A.C.: Civitas: Toward a secure voting system. In: IEEE Symposium on Security and Privacy, pp. 354\u2013368. IEEE Computer Society, Los Alamitos (2008)"},{"key":"20_CR15","unstructured":"Clarkson, M.R., Myers, A.C.: Coercion-resistant remote voting using decryption mixes. In: Workshop on Frontiers in Electronic Elections (2005)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1986","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1986)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Pointcheval, D., Vergnaud, D.: Transferable constant-size fair e-cash. Cryptology ePrint Archive, Report 2009\/146 (2009), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-10433-6_15"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/11889663_8","volume-title":"Financial Cryptography","author":"J. Furukawa","year":"2006","unstructured":"Furukawa, J., Sako, K.: An efficient publicly verifiable mix-net for long inputs. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, pp. 111\u2013125. Springer, Heidelberg (2006)"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1984","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1984)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Jakobsson","year":"2000","unstructured":"Jakobsson, M., Juels, A.: Mix and match: Secure function evaluation via ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 162\u2013177. Springer, Heidelberg (2000)"},{"key":"20_CR21","unstructured":"Jefferson, D., Rubin, A., Simons, B., Wagner, D.: A security analysis of the secure electronic registration and voting experiment (2004)"},{"key":"20_CR22","unstructured":"Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. Cryptology ePrint Archive, Report 2002\/165 (2002), http:\/\/eprint.iacr.org\/"},{"key":"20_CR23","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/1102199.1102213","volume-title":"WPES","author":"A. Juels","year":"2005","unstructured":"Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: Atluri, V., De Capitani di Vimercati, S., Dingledine, R. (eds.) WPES, pp. 61\u201370. ACM, New York (2005)"},{"key":"20_CR24","unstructured":"Kuesters, R., Truderung, T., Vogt, A.: A game-based definition of coercion-resistance and its applications. Cryptology ePrint Archive, Report 2009\/582 (2009), http:\/\/eprint.iacr.org\/"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11818175_22","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"T. Moran","year":"2006","unstructured":"Moran, T., Naor, M.: Receipt-free universally-verifiable voting with everlasting privacy. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 373\u2013392. Springer, Heidelberg (2006)"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Neff, C.A.: A verifiable secret shuffle and its application to e-voting. In: ACM Conference on Computer and Communications Security, pp. 116\u2013125 (2001)","DOI":"10.1145\/501983.502000"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Okamoto, T.: Provably secure and practical identification schemes and corresponding signature schemes. In: Brickell (ed.) [6], pp. 31\u201353 (1992)","DOI":"10.1007\/3-540-48071-4_3"},{"issue":"3","key":"20_CR28","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.-P. Schnorr","year":"1991","unstructured":"Schnorr, C.-P.: Efficient signature generation by smart cards. J. Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"J. Cryptology"},{"key":"20_CR29","unstructured":"Schweisgut, J.: Coercion-resistant electronic elections with observer. In: Krimmer, R. (ed.) Electronic Voting. LNI, vol.\u00a086, pp. 171\u2013177. GI (2006)"},{"key":"20_CR30","unstructured":"Smith, W.: New cryptographic election protocol with best-known theoretical properties. In: Workshop on Frontiers in Electronic Elections (2005)"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Unruh, D., M\u00fcller-Quade, J.: Universally composable incoercibility. Cryptology ePrint Archive, Report 2009\/520 (2009), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-14623-7_22"},{"key":"20_CR32","first-page":"908","volume-title":"2nd Workshop on Dependability and Security in e-Government (DeSeGov 2007) at 2nd Int. Conference on Availability, Reliability and Security (ARES 2007)","author":"S.G. Weber","year":"2007","unstructured":"Weber, S.G., Ara\u00fajo, R., Buchmann, J.: On coercion-resistant electronic elections with linear work. In: 2nd Workshop on Dependability and Security in e-Government (DeSeGov 2007) at 2nd Int. Conference on Availability, Reliability and Security (ARES 2007), pp. 908\u2013916. IEEE Computer Society, Los Alamitos (2007)"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17619-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T09:14:31Z","timestamp":1740734071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17619-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176180","9783642176197"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17619-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}