{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:21:59Z","timestamp":1725556919727},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642129797"},{"type":"electronic","value":"9783642129803"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12980-3_6","type":"book-chapter","created":{"date-parts":[[2010,5,30]],"date-time":"2010-05-30T21:48:13Z","timestamp":1275256093000},"page":"107-123","source":"Crossref","is-referenced-by-count":4,"title":["Unconditionally Secure Electronic Voting"],"prefix":"10.1007","author":[{"given":"Akira","family":"Otsuka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: Public-key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, December 1984, pp. 175\u2013179 (1984)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Benaloh, J.C., Yung, M.: Distributing the Power of a Government to Enhance the Privacy of Voters (Extended Abstract). In: PODC 1986, pp. 52\u201362 (1986)","DOI":"10.1145\/10590.10595"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-540-76900-2_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"A. Broadbent","year":"2007","unstructured":"Broadbent, A., Tapp, A.: Information-theoretic security without an honest majority. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 410\u2013426. Springer, Heidelberg (2007)"},{"key":"6_CR4","unstructured":"Chaum, D.: Secret-ballot Receipts True Voter-Verifiable Elections. In: WOTE 2006 (2006) (invited talk)"},{"key":"6_CR5","unstructured":"Chaum, D., van de Graaf, J., Ryan, P.Y.A., Vora, P.L.: Secret Ballot Elections with Unconditional Integrity., Cryptology ePrint Archive, Report 2007\/270 (2007)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45682-1_22","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"Y.-C. Chang","year":"2001","unstructured":"Chang, Y.-C., Lu, C.-J.: Oblivious polynomial evaluation and oblivious neural learning. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 369\u2013384. Springer, Heidelberg (2001)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). In: FOCS 1985, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, J.D., Fischer, M.J.: A Robust and Verifiable Cryptographically Secure Election Scheme (Extended Abstract). In: FOCS 1985, pp. 372\u2013382 (1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-69053-0_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"C. Cr\u00e9peau","year":"1997","unstructured":"Cr\u00e9peau, C.: Efficient cryptographic protocols based on noisy channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 306\u2013317. Springer, Heidelberg (1997)"},{"key":"6_CR10","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.K., 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":"6_CR11","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A Practical Scheme for Non-interactive Verifiable Secret Sharing. In: FOCS 1987, pp. 427\u2013437 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"E. Fujisaki","year":"1998","unstructured":"Fujisaki, E., Okamoto, T.: A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 32\u201346. Springer, Heidelberg (1998)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-540-27800-9_6","volume-title":"Information Security and Privacy","author":"G. Hanaoka","year":"2004","unstructured":"Hanaoka, G., Imai, H., M\u00fcller-Quade, J., Nascimento, A.C.A., Otsuka, A., Winter, A.J.: Information theoretically secure oblivious polynomial evaluation: Model, bounds, and constructions. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol.\u00a03108, pp. 62\u201373. Springer, Heidelberg (2004)"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U.M. Maurer","year":"1992","unstructured":"Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"Journal of Cryptology"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11818175_22","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"T. Moran","year":"2006","unstructured":"Moran, T., Naor, M.: Receipt-free universally-verifiable voting with everlasting privacy. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 373\u2013392. Springer, Heidelberg (2006)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious Transfer and Polynomial Evaluation. In: STOC 1999, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-540-24852-1_26","volume-title":"Applied Cryptography and Network Security","author":"A.C.A. Nascimento","year":"2004","unstructured":"Nascimento, A.C.A., M\u00fcller-Quade, J., Otsuka, A., Hanaoka, G., Imai, H.: Unconditionally non-interactive verifiable secret sharing secure against faulty majorities in the commodity based model. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 355\u2013368. Springer, Heidelberg (2004)"},{"key":"6_CR18","unstructured":"Rivest, R.: Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer (manuscript)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"B. Schoenmakers","year":"1999","unstructured":"Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 148\u2013164. Springer, Heidelberg (1999)"},{"issue":"5","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput.\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"A. Shamir","year":"2003","unstructured":"Shamir, A., Tromer, E.: Factoring large numbers with the TWIRL device. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 1\u201326. Springer, Heidelberg (2003)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M.A. Stadler","year":"1996","unstructured":"Stadler, M.A.: Publicly verifiable secret sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 190\u2013199. Springer, Heidelberg (1996)"}],"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_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:59:26Z","timestamp":1606168766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12980-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129797","9783642129803"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12980-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}