{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:21:48Z","timestamp":1725556908447},"publisher-location":"Berlin, Heidelberg","reference-count":42,"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_9","type":"book-chapter","created":{"date-parts":[[2010,5,30]],"date-time":"2010-05-30T21:48:13Z","timestamp":1275256093000},"page":"155-174","source":"Crossref","is-referenced-by-count":2,"title":["The Vector-Ballot Approach for Online Voting Procedures"],"prefix":"10.1007","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Abe, M., Hoshino, F.: Remarks on Mix-Networks Based on Permutation Networks. In: PKC 2001 (2001)","DOI":"10.1007\/3-540-44586-2_23"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Baudron, O., Fouque, P.-A., Pointcheval, D., Poupard, G., Stern, J.: Practical Multi-Candidate Election system. In: The Proceedings of the ACM Symposium on Principles of Distributed Computing PODC (2001)","DOI":"10.1145\/383962.384044"},{"key":"9_CR3","unstructured":"Benaloh, J.: Verifiable Secret-Ballot Elections, PhD Thesis, Yale University (1987)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Yung, M.: Distributing the Power of a Government to Enhance the Privacy of Voters. In: The proceedings of the ACM Symposium on Principles of Distributed Computing PODC (1986)","DOI":"10.1145\/10590.10595"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-Free Secret-Ballot Elections. In: STOC 1994 (1994)","DOI":"10.1145\/195058.195407"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Golle, P.: Almost Entirely Correct Mixing With Applications to Voting. In: 9th ACM-CCS Conference (2002)","DOI":"10.1145\/586110.586121"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM\u00a024(2), 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind Signatures for Untraceable Payments. In: CRYPTO 1982, pp. 199\u2013203 (1982)","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"9_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)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Cohen (Benaloh), J.D., Fischer, M.J.: A Robust and Verifiable Cryptographically Secure Election Scheme. In: FOCS 1985 (1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"9_CR11","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":"9_CR12","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.B., Schoenmakers, B.: Proof 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":"9_CR13","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":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On Monotone Formula Closure of SZK. In: FOCS 1994 (1994)","DOI":"10.1109\/SFCS.1994.365745"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/SFCS.1985.14","volume-title":"26th Annual Symposium on Foundations of Computer Science (FOCS \u201985)","author":"P. Feldman","year":"1985","unstructured":"Feldman, P., Micali, S.: Byzantine agreement in constant expected time (and trusting no one). In: 26th Annual Symposium on Foundations of Computer Science (FOCS \u201985), Los Angeles, Ca., USA, October 1985, pp. 267\u2013276. IEEE Computer Society Press, Los Alamitos (1985)"},{"key":"9_CR17","first-page":"148","volume-title":"Proceedings of the 20th Annual ACM Symposium on the Theory of Computing","author":"P. Feldman","year":"1988","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Cole, R. (ed.) Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, Chicago, IL, May 1988, pp. 148\u2013161. ACM, New York (1988)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P.-A. Fouque","year":"2001","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, p. 90. Springer, Heidelberg (2001)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A Practical Secret Voting Scheme for Large Scale Elections. In: ASIACRYPT 1992 (1992)","DOI":"10.1007\/3-540-57220-1_66"},{"key":"9_CR21","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":"9_CR22","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1109\/SFCS.1995.492674","volume-title":"Proceedings of the 36th Annual IEEE Symposium on Foundations of Com- puter Science, FOCS 1995","author":"Z. Galil","year":"1995","unstructured":"Galil, Z., Mayer, A., Yung, M.: Resolving message complexity of byzantine agreement and beyond. In: Proceedings of the 36th Annual IEEE Symposium on Foundations of Com- puter Science, FOCS 1995, October 23-25, pp. 724\u2013733. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"9_CR23","first-page":"31","volume-title":"Proceedings of the 25th Annual ACM Symposium on the Theory of Computing","author":"J. Garay","year":"1993","unstructured":"Garay, J., Moses, Y.: Fully polynomial byzantine agreement in t + 1 rounds. In: Aggarwal, A. (ed.) Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, CA, USA, May 1993, pp. 31\u201341. ACM Press, New York (1993)"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Gennaro","year":"1999","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 295. Springer, Heidelberg (1999)"},{"key":"9_CR25","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)"},{"volume-title":"Secure Electronic Voting, Advances in Information Security","year":"2002","key":"9_CR26","unstructured":"Gritzalis, D. (ed.): Secure Electronic Voting, Advances in Information Security, vol.\u00a07. Kluwer, Dordrecht (2002)"},{"key":"9_CR27","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, p. 539. Springer, Heidelberg (2000)"},{"key":"9_CR28","unstructured":"Hirt, M.: Multi-Party Computation: Efficient Protocols, General Adversaries, and Voting, Ph.D. Thesis, ETH Zurich (2001)"},{"key":"9_CR29","unstructured":"Jakobsson, M., Juels, A., Rivest, R.L.: Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking. In: USENIX Security Symposium 2002, pp. 339\u2013353 (2002)"},{"key":"9_CR30","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 tamper-resistant randomizer. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 389\u2013406. Springer, Heidelberg (2003)"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-27809-2_9","volume-title":"Financial Cryptography","author":"A. Kiayias","year":"2004","unstructured":"Kiayias, A., Yung, M.: The vector-ballot e-voting approach. In: Juels, A. (ed.) FC 2004. LNCS, vol.\u00a03110, pp. 72\u201389. Springer, Heidelberg (2004)"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Korman, M., Walluck, D.: An Internet Voting System Supporting User Privacy. In: ACSAC 2006, pp. 165\u2013174 (2006)","DOI":"10.1109\/ACSAC.2006.12"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Andrew Neff, C.: A verifiable secret shuffle and its application to e-voting. In: ACM Conference on Computer and Communications Security 2001, pp. 116\u2013125 (2001)","DOI":"10.1145\/501983.502000"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Okamoto, T.: Receipt-Free Electronic Voting Schemes for Large Scale Elections. In: Workshop on Security Protocols (1997)","DOI":"10.1007\/BFb0028157"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Eurocrypt 1999 (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"9_CR36","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.-s. Park","year":"1994","unstructured":"Park, C.-s., 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":"9_CR37","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.P. Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 522\u2013526. Springer, Heidelberg (1991)"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Pedersen, T.P.: Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem, PhD Thesis, Aarhus University (1992)","DOI":"10.7146\/dpb.v21i388.6621"},{"key":"9_CR39","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"M. Rabin","year":"1983","unstructured":"Rabin, M.: Transactions protected by beacons. Journal of Computer and System Sciences\u00a027, 256\u2013267 (1983)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR40","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":"9_CR41","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 - 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":"9_CR42","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, p. 148. Springer, Heidelberg (1999)"}],"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_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T12:16:44Z","timestamp":1635423404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12980-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129797","9783642129803"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12980-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}