{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:56:20Z","timestamp":1742939780427,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666950"},{"type":"electronic","value":"9783540477907"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-47790-x_19","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T23:07:18Z","timestamp":1186614438000},"page":"225-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["An Improvement on a Practical Secret Voting Scheme"],"prefix":"10.1007","author":[{"given":"Miyako","family":"Ohkubo","sequence":"first","affiliation":[]},{"given":"Fumiaki","family":"Miura","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Abe","sequence":"additional","affiliation":[]},{"given":"Atsushi","family":"Fujioka","sequence":"additional","affiliation":[]},{"given":"Tatsuaki","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,10,22]]},"reference":[{"key":"19_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BFb0054144","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 98","author":"M. Abe","year":"1998","unstructured":"M. Abe, \u201cUniversally Verifiable Mix-Net with Verification Work Independent of The Number Of Mix-Servers\u201d, in Advances in Cryptology \u2014 EUROCRYPT\u2019 98, Lecture Notes in Computer Science 1403, Springer-Verlag, Berlin, pp.437\u2013447 (1998)."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"M. Abe, \u201cA Mix-network on Permutation Networks\u201d, IEICE Technical Report (May, 1999).","DOI":"10.1007\/978-3-540-48000-6_21"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson, \u201cCompleteness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation\u201d, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.1\u201310 (May, 1988).","DOI":"10.1145\/62212.62213"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"J. Benaloh and M. Yung, \u201cDistributing the Power of a Government to Enhance the Privacy of Votes\u201d, Proceedings of the 5th ACM Symposium on Principles of Distributed Computing, pp.52\u201362 (Aug., 1986).","DOI":"10.1145\/10590.10595"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. L. Chaum","year":"1981","unstructured":"D. L. Chaum, \u201cUntraceable Electronic Mail, Return Addresses, and Digital Pseudonyms\u201d, Communications of the ACM, Vol.24, No.2, pp.84\u201388 (Feb., 1981).","journal-title":"Communications of the ACM"},{"issue":"10","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"D. Chaum, \u201cSecurity without Identification: Transaction systems to Make Big Brother Obsolete\u201d, Communications of the ACM, Vol.28, No.10, pp.1030\u20131044 (Oct., 1985).","journal-title":"Communications of the ACM"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, \u201cThe Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability\u201d, Journal of Cryptology, Vol.1, No.1, pp.65\u201375 (1988).","journal-title":"Journal of Cryptology"},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-45961-8_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 88","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, \u201cElections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA\u201d, in Advances in Cryptology \u2014 EUROCRYPT\u2019 88, Lecture Notes in Computer Science 330, Springer-Verlag, Berlin, pp.177\u2013182 (1988)."},{"key":"19_CR9","volume-title":"Design and Implementation of a Practical Security-Conscious Electronic Polling System","author":"L. F. Cranor","year":"1996","unstructured":"L. F. Cranor and R. K. Cytron, \u201cDesign and Implementation of a Practical Security-Conscious Electronic Polling System\u201d,WUCS-96-02, Deportment of Computer Science, Washington University, St. Louis (Jan., 1996)."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd, \u201cMultiparty Unconditionally Secure Protocols\u201d, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.11\u201319 (May, 1988).","DOI":"10.1145\/62212.62214"},{"key":"19_CR11","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 \u2014 EURO-CRYPT\u2019 96","author":"R. Cramer","year":"1996","unstructured":"R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung, \u201cMulti-Authority Secret-Ballot Elections with Linear Work\u201d, in Advances in Cryptology \u2014 EURO-CRYPT\u2019 96, Lecture Notes in Computer Science 1070, Springer-Verlag, Berlin, pp.72\u201383 (1996)."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"J. Cohen and M. Fisher, \u201cA Robust and Verifiable Cryptographically Secure Election Scheme\u201d, 26th Annual Symposium on Foundations of Computer Science, IEEE, pp.372\u2013382 (Oct., 1985).","DOI":"10.1109\/SFCS.1985.2"},{"key":"19_CR13","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 \u2014 EURO-CRYPT\u2019 97","author":"R. Cramer","year":"1997","unstructured":"R. Cramer, R. Gennaro, and B. Schoenmakers, \u201cA Secure and Optimally Efficient Multi-Authority Election Scheme\u201d, in Advances in Cryptology \u2014 EURO-CRYPT\u2019 97, Lecture Notes in Computer Science 1233, Springer-Verlag, Berlin, pp.103\u2013118 (1997)."},{"key":"19_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/BFb0053458","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 94","author":"J. Camenisch","year":"1994","unstructured":"J. Camenisch, J. Pireteau, and M. Stadler, \u201cBlind Signatures based on the Discrete Logarithm Problem\u201d, in Advances in Cryptology \u2014 EUROCRYPT\u2019 94, Lecture Notes in Computer Science 950, Springer-Verlag, Berlin, pp.428\u2013432 (?1994?)."},{"key":"19_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89","author":"Y. G. Desmedt","year":"1990","unstructured":"Y. G. Desmedt and Y. Frankel, \u201cThreshold Cryptosystems\u201d, in Advances in Cryptology \u2014 CRYPTO\u2019 89, Lecture Notes in Computer Science 435, Springer-Verlag, Berlin, pp.307\u2013315 (1990)."},{"issue":"6","key":"19_CR16","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman, \u201cNew Directions in Cryptography\u201d, IEEE Transactions on Information Theory, Vol.IT-22, No.6, pp.644\u2013654 (Nov., 1976).","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-57220-1_66","volume-title":"Advances in Cryptology \u2014 AUSCRYPT\u2019 92","author":"A. Fujioka","year":"1993","unstructured":"A. Fujioka, T. Okamoto, and K. Ohta. \u201cA Practical Secret Voting Scheme for Large Scale Elections\u201d, in Advances in Cryptology \u2014 AUSCRYPT\u2019 92, Lecture Notes in Computer Science 718, Springer-Verlag, Berlin, pp.244\u2013251 (1993)."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, \u201cHow to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority\u201d, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp.218\u2013229 (May, 1987).","DOI":"10.1145\/28395.28420"},{"key":"19_CR19","unstructured":"M. A. Herschberg, \u201cSecure Electronic Voting Over the World Wide Web\u201d, Master Thesis in Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1997)."},{"key":"19_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 98","author":"M. Jakobsson","year":"1998","unstructured":"M. Jakobsson, \u201cA Practical Mix\u201d, in Advances in Cryptology \u2014 EUROCRYPT\u2019 98, Lecture Notes in Computer Science 1403, Springer-Verlag, Berlin, pp.448\u2013461 (1998)."},{"key":"19_CR21","unstructured":"A. Pfitzmann, \u201cA Switched\/Broadcast ISDN to Decrease User Observability\u201d, 1984 International Zurich Seminar on Digital Communications, IEEE, pp.183\u2013190 (Mar., 1984)."},{"key":"19_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 93","author":"C. Park","year":"1994","unstructured":"C. Park, K. Itoh, and K. Kurosawa, \u201cEfficient Anonymous Channel and All\/Nothing Election Scheme\u201d, in Advances in Cryptology \u2014 EUROCRYPT\u2019 93, Lecture Notes in Computer Science 765, Springer-Verlag, Berlin, pp.248\u2013259 (1994)."},{"key":"19_CR23","series-title":"Lect Notes Comput Sci","first-page":"440","volume-title":"ICICS98","author":"W. Ogata","year":"1998","unstructured":"W. Ogata, K. Kurosawa, K. Sako, and K. Takatani, \u201cFault Tolerant Anonymous Channel\u201d, in ICICS98, Lecture Notes in Computer Science 1334, Springer-Verlag, Berlin, pp.440\u2013444 (1998)."},{"issue":"2","key":"19_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, and L. Adleman, \u201cA Method for Obtaining Digital Signatures and Public-Key Cryptosystems,\u201d Communications of the ACM, Vol. 21, No. 2, pp. 120\u2013126 (Feb., 1978).","journal-title":"Communications of the ACM"},{"issue":"4","key":"19_CR25","first-page":"239","volume":"3","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr, \u201cEfficient Signature Generation for Smart Cards\u201d, Journal of Cryptology, Vol.3, No.4, pp.239\u2013252 (1991).","journal-title":"Journal of Cryptology"},{"key":"19_CR26","unstructured":"B. Schoenmakers, \u201cA Simple Publicly Verifiable Secret Sharing Scheme and its Application to Electronic Voting\u201d, Crypto\u2019 99 (To appear)."},{"key":"19_CR27","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 \u2014 CRYPTO\u2019 94","author":"K. Sako","year":"1994","unstructured":"K. Sako and J. Kilian, \u201cSecure Voting using Partially Compatible Homomorphisms\u201d, in Advances in Cryptology \u2014 CRYPTO\u2019 94, Lecture Notes in Computer Science 839, Springer-Verlag, Berlin, pp.411\u2013424 (1994)."},{"key":"19_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 95","author":"K. Sako","year":"1995","unstructured":"K. Sako and J. Kilian, \u201cReceipt-Free Mix-Type Voting Scheme \u2014 A Practical Solution to the Implementation of a Voting Booth \u2014\u201d, in Advances in Cryptology \u2014 EUROCRYPT\u2019 95, Lecture Notes in Computer Science 921, Springer-Verlag, Berlin, pp.393\u2013403 (1995)."}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47790-X_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:11:59Z","timestamp":1585933919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47790-X_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666950","9783540477907"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-47790-x_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"22 October 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}