{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:53:51Z","timestamp":1767707631369},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540007166"},{"type":"electronic","value":"9783540365525"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36552-4_27","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T19:22:37Z","timestamp":1181157757000},"page":"389-406","source":"Crossref","is-referenced-by-count":56,"title":["Receipt-Free Electronic Voting Scheme with a Tamper-Resistant Randomizer"],"prefix":"10.1007","author":[{"given":"Byoungcheon","family":"Lee","sequence":"first","affiliation":[]},{"given":"Kwangjo","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"27_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BFb0054144","volume-title":"Advances in Cryptology-Eurocrypt\u201998","author":"M. Abe","year":"1998","unstructured":"M. Abe, \u201cUniversally verifiable mix-net with verification work independent of the number of mix-servers\u201d, Advances in Cryptology-Eurocrypt\u2019 98, LNCS Vol.1403, pages 437\u2013447, Springer-Verlag, 1998. 390"},{"key":"27_CR2","unstructured":"J. Benaloh, \u201cVerifiable secret-ballot elections\u201d, PhD Thesis, Yale University, Department of Computer Science, New Haven, September 1987. 390"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"O. Baudron, P.-A. Fouque, D. Pointcheval, G. Poupard and J. Stern, \u201cPractical Multi-Candidate Election System\u201d, Proc. of the 20th ACM Symposium on Principles of Distributed Computing, N. Shavit, Pages 274-283, ACM Press, 2001. 390, 392","DOI":"10.1145\/383962.384044"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"J. Benaloh and D. Tuinstra, \u201cReceipt-free secret-ballot elections\u201d, Proc. of 26th Symp. on Theory of Computing (STOC\u201994), pages 544\u2013553, New York, 1994. 389, 391, 392","DOI":"10.1145\/195058.195407"},{"key":"27_CR5","series-title":"Lect Notes Comput Sci","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":"R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung, \u201cMultiauthority secret ballot elections with linear work\u201d, Advances in Cryptology-Eurocrypt\u201996, LNCS Vol.1070, pages 72\u201383, Springer-Verlag, 1996. 390"},{"key":"27_CR6","series-title":"Lect Notes Comput Sci","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":"R. Cramer, R. Gennaro, and B. Schoenmakers, \u201cA secure an optimally efficient multi-authority election schemes\u201d, Advances in Cryptology-Eurocrypt\u201997, LNCS Vol.1233, pages 103\u2013118, Springer-Verlag, 1997. 390, 391, 401"},{"key":"27_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45961-8_15","volume-title":"Advances in Cryptology-Eurocrypt\u2019 88","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, \u201cElections with unconditionally-secret ballots and disruption equivalent to breaking RSA\u201d, Advances in Cryptology-Eurocrypt\u2019 88, LNCSVol.330, pages 177\u2013182, Springer-Verlag, 1988. 390"},{"key":"27_CR8","unstructured":"D. Chaum, \u201cPrivacy Technology: A survey of security without identification\u201d, IACR Distinguished Lecture in Crypto2002, 2002. 390"},{"issue":"4","key":"27_CR9","first-page":"467","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal, \u201cA public key cryptosystem and a signature scheme based on discrete logarithms\u201d, IEEE Trans. on IT, Vol.31, No.4, pages 467\u2013472, 1985. 396","journal-title":"IEEE Trans. on IT"},{"key":"27_CR10","series-title":"Lect Notes Comput Sci","first-page":"244","volume-title":"Advances in Cryptology-Auscrypt\u201992","author":"A. Fujioka","year":"1992","unstructured":"A. Fujioka, T. Okamoto, and K. Ohta, \u201cA practical secret voting scheme for large scale election\u201d, Advances in Cryptology-Auscrypt\u201992, LNCS Vol.718, pages 244\u2013260, Springer-Verlag, 1992. 389, 390"},{"key":"27_CR11","volume-title":"ETH Series in Information Security and Cryptography","author":"M. Hirt","year":"2001","unstructured":"M. Hirt, \u201cMulti-party computation: efficient protocols, general adversaries, and voting\u201d, Ph.D. Thesis, ETH Zurich, Reprint as vol. 3 of ETH Series in Information Security and Cryptography, ISBN 3-89649-747-2, Hartung-Gorre Verlag, Konstanz, 2001. 389, 390, 391, 392, 394, 403, 404"},{"key":"27_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45539-6_38","volume-title":"Advances in Cryptology-Eurocrypt2000","author":"M. Hirt","year":"2000","unstructured":"M. Hirt and K. Sako, \u201cEfficient receipt-free voting based on homomorphic encryption\u201d, Advances in Cryptology-Eurocrypt2000, LNCS vol.1807, pages 539\u2013556, Springer-Verlag, 2000. 390, 391, 392"},{"key":"27_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BFb0054145","volume-title":"Advances in Cryptology-Eurocrypt\u2019 98","author":"M. Jakobsson","year":"1998","unstructured":"M. Jakobsson, \u201cA practical mix\u201d, Advances in Cryptology-Eurocrypt\u2019 98, LNCSVol.1403, pages 449\u2013461, Springer-Verlag, 1998. 390"},{"key":"27_CR14","series-title":"Lect Notes Comput Sci","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":"M. Jakobsson, K. Sako, and R. Impagliazzo, \u201cDesignated verifier proofs and their applications\u201d, Advances in Cryptology-Eurocrypt\u201996, LNCS Vol.1070, pages 143\u2013154, Springer-Verlag, 1996. 396"},{"key":"27_CR15","unstructured":"B. Lee, and K. Kim, \u201cReceipt-free electronic voting through collaboration of voter and honest verifier\u201d, Proceeding of JW-ISC2000, pages 101\u2013108, Jan. 25\u201326, 2000, Okinawa, Japan. 389, 390, 391, 392"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"E. Magkos, M. Burmester, V. Chrissikopoulos, \u201cReceipt-freeness in large-scale elections without untappable channels\u201d, 1st IFIP Conference on E-Commerce \/ E-business \/ E-Government, Zurich, Octomber 2001, Kluwer Academics Publishers, pages 683\u2013693, 2001. 390, 391, 392","DOI":"10.1007\/0-306-47009-8_50"},{"key":"27_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BFb0034841","volume-title":"Advances in Cryptology-Asiacrypt\u2019 96","author":"M. Michels","year":"1996","unstructured":"M. Michels and P. Horster, \u201cSome remarks on a receipt-free and universally verifiable mix-type voting scheme\u201d, Advances in Cryptology-Asiacrypt\u2019 96, LNCS Vol.1163, pages 125\u2013132, Springer-Verlag, 1996. 389, 390"},{"key":"27_CR18","series-title":"Lect Notes Comput Sci","first-page":"141","volume-title":"Advances in Cryptology-Asiacrypt\u201994","author":"V. Niemi","year":"1994","unstructured":"V. Niemi and A. Rendall, \u201cHow to prevent buying of votes in computer elections\u201d, Advances in Cryptology-Asiacrypt\u201994, LNCS Vol.917, pages 141\u2013148, Springer-Verlag, 1994. 389"},{"key":"27_CR19","series-title":"Lect Notes Comput Sci","first-page":"25","volume-title":"Receipt-free electronic voting schemes for large scale elections","author":"T. Okamoto","year":"1997","unstructured":"T. Okamoto, \u201cReceipt-free electronic voting schemes for large scale elections\u201d, Proc. of Workshop on Security Protocols\u201997, LNCS Vol.1361, pages 25\u201335, Springer-Verlag, 1997. 391"},{"key":"27_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-47790-X_19","volume-title":"Information Security\u201999","author":"M. Ohkubo","year":"1999","unstructured":"M. Ohkubo, F. Miura, M. Abe, A. Fujioka and T. Okamoto, \u201cAn Improvement on a practical secret voting scheme\u201d, Information Security\u201999, LNCS Vol.1729, pages 225\u2013234, Springer-Verlag, 1999. 390"},{"key":"27_CR21","series-title":"Lect Notes Comput Sci","first-page":"223","volume-title":"Advances in Cryptology-Eurocrypt\u2019 99","author":"P. Paillier","year":"1999","unstructured":"P. Paillier, \u201cPublic-key cryptosystems based on discrete logarithms residues\u201d, Advances in Cryptology-Eurocrypt\u2019 99, LNCS Vol. 1592, pages 223\u2013238, Springer-Verlag, 1999. 392"},{"key":"27_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/BFb0053448","volume-title":"Advances in Cryptology-Eurocrypt\u201994","author":"B. Pfitzmann","year":"1994","unstructured":"B. Pfitzmann, \u201cBreaking an efficient anonymous channel\u201d, Advances in Cryptology-Eurocrypt\u201994, LNCS Vol.950, pages 332\u2013340, Springer-Verlag, 1994. 390"},{"key":"27_CR23","series-title":"Lect Notes Comput Sci","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":"C. Park, K. Itoh, and K. Kurosawa, \u201cEfficient anonymous channel and all\/nothing election scheme\u201d, Advances in Cryptology-Eurocrypt\u201993, LNCS Vol.765, pages 248\u2013259, Springer-Verlag, 1994. 390"},{"key":"27_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-45472-1_18","volume-title":"Self-scrambling anonymizers","author":"D. Pointcheval","year":"2001","unstructured":"D. Pointcheval, \u201cSelf-scrambling anonymizers\u201d, Proceedings of Financial Cryptography 2000, Y. Frankel, Pages 259\u2013275, LNCS 1962, Springer-Verlag, 2001. 390"},{"key":"27_CR25","series-title":"Lect Notes Comput Sci","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":"K. Sako and J. Killian, \u201cSecure voting using partial compatible homomorphisms\u201d, Advances in Cryptology-Crypto\u201994, LNCS Vol.839, pages 411\u2013424, Springer-Verlag, 1994. 390"},{"key":"27_CR26","series-title":"Lect Notes Comput Sci","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":"K. Sako and J. Kilian, \u201cReceipt-free mix-type voting scheme-a practical solution to the implementation of a voting booth\u201d, Advances in Cryptology-Eurocrypt\u201995, LNCS Vol.921, pages 393\u2013403, Springer-Verlag, 1995. 390, 391"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2014 ICISC 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36552-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:37:24Z","timestamp":1556465844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36552-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540007166","9783540365525"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-36552-4_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}