{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:10:49Z","timestamp":1778256649463,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642129797","type":"print"},{"value":"9783642129803","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12980-3_11","type":"book-chapter","created":{"date-parts":[[2010,5,31]],"date-time":"2010-05-31T01:48:13Z","timestamp":1275270493000},"page":"191-199","source":"Crossref","is-referenced-by-count":25,"title":["On Some Incompatible Properties of Voting Schemes"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Chevallier-Mames","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Pointcheval","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Stern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Traor\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","first-page":"178","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Abe","year":"2000","unstructured":"Abe, M., Ohkubo, M.: A length-invariant hybrid mix. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 178\u2013191. Springer, Heidelberg (2000)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/978-3-540-30079-3_16","volume-title":"Trust and Privacy in Digital Business","author":"R. Aditya","year":"2004","unstructured":"Aditya, R., Lee, B., Boyd, C., Dawson, E.: An efficient mixnet-based voting scheme providing receipt-freeness. In: Katsikas, S.K., L\u00f3pez, J., Pernul, G. (eds.) TrustBus 2004. LNCS, vol.\u00a03184, pp. 152\u2013161. Springer, Heidelberg (2004)"},{"key":"11_CR3","first-page":"274","volume-title":"Proceedings of the 20th ACM Symposium on Principles of Distributed Computing","author":"O. Baudron","year":"2001","unstructured":"Baudron, O., Fouque, P.-A., Pointcheval, D., Poupard, G., Stern, J.: Practical multi-candidate election system. In: Proceedings of the 20th ACM Symposium on Principles of Distributed Computing, pp. 274\u2013283. ACM Press, New York (2001)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","first-page":"544","volume-title":"Proceedings of STOC 1994","author":"J. Benaloh","year":"1994","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-free secret ballot elections. In: Okamoto, T. (ed.) Proceedings of STOC 1994. LNCS, vol.\u00a01976, pp. 544\u2013553. Springer, Heidelberg (1994)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-68339-9_7","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"R. Cramer","year":"1996","unstructured":"Cramer, R., Franklin, M., Schoenmackers, B.: Multi-authority secret-ballot elections with linear work. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 72\u201383. Springer, Heidelberg (1996)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damgard","year":"2001","unstructured":"Damgard, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","first-page":"248","volume-title":"Advances in Cryptology - AUSCRYPT \u201992","author":"A. Fujioka","year":"1993","unstructured":"Fujioka, A., Ohta, K., Okamoto, T.: A practical Secret Voting Scheme for Large Scale Elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 248\u2013259. Springer, Heidelberg (1993)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-540-24632-9_23","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J. Furukawa","year":"2004","unstructured":"Furukawa, J.: Efficient, verifiable shuffle decryption and its requirement of unlinkability. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 319\u2013332. Springer, Heidelberg (2004)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"J. Furukawa","year":"2001","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 368\u2013387. Springer, Heidelberg (2001)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-36178-2_28","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"P. Golle","year":"2002","unstructured":"Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.: Optimistic mixing for exit-polls. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 451\u2013465. Springer, Heidelberg (2002)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36288-6_11","volume-title":"Public Key Cryptography - PKC 2003","author":"J. Groth","year":"2002","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 145\u2013160. Springer, Heidelberg (2002)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45539-6_38","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 539\u2013556. Springer, Heidelberg (2000)"},{"key":"11_CR14","unstructured":"Jakobsson, M., Juels, A., Rivest, R.: Making Mix-Nets Robust for Electronic Voting by Randomized Partial Checking. In: Proceedings of the 11th Usenix Security Symposium, USENIX 2002, pp. 339\u2013353 (2002)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-45664-3_10","volume-title":"Public Key Cryptography","author":"A. Kiayias","year":"2002","unstructured":"Kiayias, A., Yung, M.: Self-tallying elections and perfect ballot secrecy. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 141\u2013158. Springer, Heidelberg (2002)"},{"key":"11_CR16","unstructured":"Kim, K., Kim, J., Lee, B., Ahn, G.: Experimental Design of Worldwide Internet Voting System using PKI. In: SSGRR 2001, L\u2019Aquila, Italy, August 6-10 (2001)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-540-24691-6_19","volume-title":"Proceedings of ICICS 2003","author":"B. Lee","year":"2004","unstructured":"Lee, B., Boyd, C., Dawson, E., Kim, K., Yang, J., Yoo, S.: Providing receipt-freeness in mixnet based voting protocols. In: Lim, J.I., Lee, D.H. (eds.) Proceedings of ICICS 2003. LNCS, vol.\u00a02971, pp. 245\u2013258. Springer, Heidelberg (2004)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-36552-4_27","volume-title":"Information Security and Cryptology - ICISC 2002","author":"B. Lee","year":"2003","unstructured":"Lee, B., Kim, K.: Receipt-free electronic voting scheme with a tamper-resistant randomizer. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 389\u2013406. Springer, Heidelberg (2003)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/501983.502000","volume-title":"ACM CCCS 2001","author":"A. Neff","year":"2001","unstructured":"Neff, A.: A verifiable secret shuffle and its application to e-voting. In: ACM CCCS 2001, pp. 116\u2013125. ACM Press, New York (2001)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-47790-X_19","volume-title":"Information Security","author":"M. Ohkubo","year":"1999","unstructured":"Ohkubo, M., Miura, F., Abe, M., Fujioka, A., Okamoto, T.: An improvement on a practical secret voting scheme. In: Zheng, Y., Mambo, M. (eds.) ISW 1999. LNCS, vol.\u00a01729, pp. 225\u2013234. Springer, Heidelberg (1999)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BFb0028157","volume-title":"Security Protocols","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T.: Receipt-free electronic voting schemes for large scale elections. In: Christianson, B., Lomas, M. (eds.) Security Protocols 1997. LNCS, vol.\u00a01361, pp. 25\u201335. Springer, Heidelberg (1998)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/11535218_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"K. Peng","year":"2005","unstructured":"Peng, K., Boyd, C., Dawson, E.: Simple and efficient shuffling with provable correctness and ZK privacy. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 188\u2013204. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Towards Trustworthy Elections"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12980-3_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:49:49Z","timestamp":1619783389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12980-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129797","9783642129803"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12980-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}