{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T09:54:58Z","timestamp":1755597298564,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213765"},{"type":"electronic","value":"9783540246916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24691-6_19","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T13:20:22Z","timestamp":1294406422000},"page":"245-258","source":"Crossref","is-referenced-by-count":46,"title":["Providing Receipt-Freeness in Mixnet-Based Voting Protocols"],"prefix":"10.1007","author":[{"given":"Byoungcheon","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"Boyd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ed","family":"Dawson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwangjo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeongmo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seungjae","family":"Yoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BFb0054144","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Abe","year":"1998","unstructured":"Abe, M.: Universally verifiable mix-net with verification work independent of the number of mix-servers. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 437\u2013447. Springer, Heidelberg (1998)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M. Abe","year":"1999","unstructured":"Abe, M.: Mix-networks in permutation networks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 258\u2013273. Springer, Heidelberg (1999)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-45067-X_4","volume-title":"Information Security and Privacy","author":"M. Abe","year":"2003","unstructured":"Abe, M., Imai, H.: Flaws in some robust optimistic mixnets. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol.\u00a02727, pp. 39\u201350. Springer, Heidelberg (2003)"},{"key":"19_CR4","unstructured":"Benaloh, J.: Verifiable secret-ballot elections. PhD thesis, Yale University, Department of Computer Science, New Haven, CT (September 1987)"},{"key":"19_CR5","first-page":"274","volume-title":"Proc. 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: Shavit, N. (ed.) Proc. of the 20th ACM Symposium on Principles of Distributed Computing, pp. 274\u2013283. ACM Press, New York (2001)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections. In: Proc. of 26th Symp. on Theory of Computing (STOC 1994), New York, pp. 544\u2013553 (1994)","DOI":"10.1145\/195058.195407"},{"key":"19_CR7","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., Schoenmakers, B., Yung, M.: 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":"19_CR8","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 an optimally efficient multi-authority election schemes. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-45961-8_15","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: Elections with unconditionally- secret ballots and disruption equivalent to breaking RSA. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 177\u2013182. Springer, Heidelberg (1988)"},{"issue":"4","key":"19_CR10","first-page":"467","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. on IT\u00a031(4), 467\u2013472 (1985)","journal-title":"IEEE Trans. on IT"},{"key":"19_CR11","unstructured":"Electoral systems, Administration and Cost of Elections Project, available at http:\/\/www.aceproject.org\/main\/english\/es\/"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/3-540-57220-1_66","volume-title":"Advances in Cryptology - AUSCRYPT \u201992","author":"A. Fujioka","year":"1993","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale election. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 244\u2013260. Springer, Heidelberg (1993)"},{"key":"19_CR13","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":"19_CR14","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":"19_CR15","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":"19_CR16","unstructured":"Hirt, M.: Multi-party computation: Efficient protocols, general adversaries, and voting. Ph.D. Thesis, ETH Zurich, Reprint as. ETH Series in Information Security and Cryptography, vol.\u00a03, Hartung- Gorre Verlag, Konstanz (2001); ISBN 3-89649-747-2"},{"key":"19_CR17","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":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Jakobsson","year":"1998","unstructured":"Jakobsson, M.: A practical mix. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 448\u2013461. Springer, Heidelberg (1998)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Jakobsson, M.: Flash mixing. In: Proc. of the 18th ACM Symposium on PODC 1998, pp. 83\u201389 (1998)","DOI":"10.1145\/301308.301333"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Jakobsson","year":"1996","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 143\u2013154. Springer, Heidelberg (1996)"},{"key":"19_CR21","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":"19_CR22","unstructured":"Lee, B., Kim, K.: Receipt-free electronic voting through collaboration of voter and honest verifier. In: Proceeding of JW-ISC2000, Okinawa, Japan, January 25-26, pp. 101\u2013108 (2000)"},{"key":"19_CR23","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 tamperresistant randomizer. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 389\u2013406. Springer, Heidelberg (2003)"},{"key":"19_CR24","first-page":"683","volume-title":"1st IFIP Conference on ECommerce \/ E-business \/ E-Government","author":"E. Magkos","year":"2001","unstructured":"Magkos, E., Burmester, M., Chrissikopoulos, V.: Receipt-freeness in large-scale elections without untappable channels. In: 1st IFIP Conference on ECommerce \/ E-business \/ E-Government, Zurich, October 2001, pp. 683\u2013693. Kluwer Academics Publishers, Dordrecht (2001)"},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/501983.502000","volume-title":"ACM CCS 2001","author":"A. Neff","year":"2001","unstructured":"Neff, A.: A verifiable secret shuffle and its application to E-voting. In: ACM CCS 2001, pp. 116\u2013125. ACM Press, New York (2001)"},{"key":"19_CR26","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":"19_CR27","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":"19_CR28","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on discrete logarithms residues. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"T. Pedersen","year":"1991","unstructured":"Pedersen, T.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"C. Park","year":"1994","unstructured":"Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and all\/nothing election scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 248\u2013259. Springer, Heidelberg (1994)"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-48658-5_37","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"K. Sako","year":"1994","unstructured":"Sako, K., Kilian, J.: Secure voting using partial compatible homomorphisms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 411\u2013424. Springer, Heidelberg (1994)"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"K. Sako","year":"1995","unstructured":"Sako, K., Kilian, J.: Receipt-free mix-type voting scheme \u2013 a practical solution to the implementation of a voting booth. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 393\u2013403. Springer, Heidelberg (1995)"},{"key":"19_CR33","unstructured":"Wikstrom, D.: How to break, fix, and optimize optimistic mix for exit-polls. SICS Technical Report, T2002:24 (2002), available at http:\/\/www.sics.se\/libindex.html"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24691-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:14:50Z","timestamp":1740838490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24691-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213765","9783540246916"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24691-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}