{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:57Z","timestamp":1725558837277},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201762"},{"type":"electronic","value":"9783540399810"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/10958513_11","type":"book-chapter","created":{"date-parts":[[2006,7,6]],"date-time":"2006-07-06T07:00:21Z","timestamp":1152169221000},"page":"137-150","source":"Crossref","is-referenced-by-count":2,"title":["Divisible Voting Scheme"],"prefix":"10.1007","author":[{"given":"Natsuki","family":"Ishida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin\u2019ichiro","family":"Matsuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wakaha","family":"Ogata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_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":"11_CR2","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-Free Secret-Ballot Elections. In: Proc. of STOC 1994, pp. 544\u2013553 (1994)","DOI":"10.1145\/195058.195407"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Yung, M.: Distributing the Power of a Government to Enhance the Privacy of Voters. In: Proc. of PODC 1986, pp. 52\u201362 (1986)","DOI":"10.1145\/10590.10595"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, J., Fischer, M.: A Robust and Verifiable Cryptographically Secure Election Scheme. In: Proc of FOCS 1985, pp.372\u2013382 (1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"11_CR6","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\u201382. Springer, Heidelberg (1996)"},{"key":"11_CR7","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_CR8","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography. In: Proc. of STOC 1991, pp. 542\u2013552 (1991)","DOI":"10.1145\/103418.103474"},{"key":"11_CR9","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 Elections. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 244\u2013251. Springer, Heidelberg (1993)"},{"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.\u00a02045, pp. 368\u2013387. Springer, Heidelberg (2001)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","first-page":"405","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"K.R. Iversen","year":"1991","unstructured":"Iversen, K.R.: A Cryptographic Scheme for Computerized General Elections. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 405\u2013419. Springer, Heidelberg (1991)"},{"key":"11_CR12","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 Ciphertext. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 162\u2013177. Springer, Heidelberg (2000)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BFb0034841","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"M. Michels","year":"1996","unstructured":"Michels, M., Horster, O.: Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 125\u2013132. Springer, Heidelberg (1996)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"McKenzie, P., Sorensen, J.: Anonymous Investing. In: Franklin, M.K. (ed.) FC 1999. LNCS, vol.\u00a01648, pp. 212\u2013229. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-48390-X_16"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Okamoto, T.: An Electronic Voting Scheme. In: Proc. of IFIP 1996, Advanced IT Tools (1996)","DOI":"10.1007\/978-0-387-34979-4_3"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","first-page":"234","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. 234\u2013255. Springer, Heidelberg (1999)"},{"key":"11_CR17","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 Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","first-page":"248","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"C. Park","year":"1993","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 (1993)"},{"issue":"1","key":"11_CR19","first-page":"24","volume":"E77-A","author":"K. Sako","year":"1994","unstructured":"Sako, K.: Electronic Voting Scheme Allowing Open Objection to the Tally. IEICE Trans. on Fundamentals\u00a0E77-A(1), 24\u201330 (1994)","journal-title":"IEICE Trans. on Fundamentals"},{"key":"11_CR20","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 Partially Compatible Homomorphisms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 411\u2013424. Springer, Heidelberg (1994)"},{"key":"11_CR21","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. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 393\u2013403. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10958513_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T17:14:23Z","timestamp":1555694063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10958513_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201762","9783540399810"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/10958513_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}