{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T12:37:57Z","timestamp":1762605477054},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551881"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46766-1_33","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T15:03:27Z","timestamp":1186844607000},"page":"405-419","source":"Crossref","is-referenced-by-count":27,"title":["A Cryptographic Scheme for Computerized General Elections"],"prefix":"10.1007","author":[{"given":"Kenneth R.","family":"Iversen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"L. Adleman and K. McCurley. Open Problems in Number Theoretic Complexity. In Discrete Algorithms and Complexity, pages 237\u2013262. Academic Press, Inc., 1987.","key":"33_CR1","DOI":"10.1016\/B978-0-12-386870-1.50020-4"},{"unstructured":"J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, USA, September 1987. YALEU\/DCS\/TR-561.","key":"33_CR2"},{"key":"33_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/3-540-45961-8_40","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 88 Proceedings","author":"C. Boyd","year":"1988","unstructured":"C. Boyd. Some Applications of Multiple Key Ciphers. In C. G. G\u00fcnther, editor, Advances in Cryptology-EUROCRYPT\u2019 88 Proceedings, volume 330 of Lecture Notes in Computer Science, pages 455\u2013467. Springer-Verlag, 1988."},{"key":"33_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/3-540-46885-4_58","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 89 Proceedings","author":"C. Boyd","year":"1990","unstructured":"C. Boyd. A New Multiple Key Cipher and an Improved Voting Scheme. In J.-J. Quisquater, editor. Advances in Cryptology-EUROCRYPT\u2019 89 Proceedings, volume 434 of Lecture Notes in Computer Science, pages 617\u2013625. Springer-Verlag, 1990."},{"doi-asserted-by":"crossref","unstructured":"J. Benaloh and M. Yung. Distributing the Power of a Government to Enhance the Privacy of Voters. In Proceedings of the 5th ACM Symposium on the Principles in Distributed Computing, pages 52\u201362, 1986.","key":"33_CR5","DOI":"10.1145\/10590.10595"},{"doi-asserted-by":"crossref","unstructured":"J. Cohen and M. Fisher. A Robust and Verifiable Cryptographically Secure Election Scheme. In Proceedings of the 26th Annual IEEE Symposium on the Foundations of Computer Science, pages 372\u2013382, 1985.","key":"33_CR6","DOI":"10.1109\/SFCS.1985.2"},{"key":"33_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/0-387-34799-2_25","volume-title":"Advances in Cryptology-CRYPTO\u2019 88 Proceedings","author":"D. Chaum","year":"1990","unstructured":"D. Chaum, A. Fiat, and M. Naor. Untraceable Electronic Cash. In S. Goldwasser, editor, Advances in Cryptology-CRYPTO\u2019 88 Proceedings, volume 403 of Lecture Notes in Computer Science, pages 319\u2013327. Springer-Verlag, 1990."},{"issue":"2","key":"33_CR8","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"D. Chaum. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, 24(2):84\u201388, 1981.","journal-title":"Communications of the ACM"},{"key":"33_CR9","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-EUROCRYPT\u2019 88 Proceedings","author":"D. Chaum","year":"1988","unstructured":"D. Chaum. Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA. In C. G. G\u00fcnther, editor, Advances in Cryptology-EUROCRYPT\u2019 88 Proceedings, volume 330 of Lecture Notes in Computer Science, pages 177\u2013182. Springer-Verlag, 1988."},{"doi-asserted-by":"crossref","unstructured":"R. DeMillo, N. Lynch, and M. Merritt. Cryptographic Protocols. In Proceedings of the 14th Annual ACM Symposium on the Theory of Computing, pages 383\u2013400, 1982.","key":"33_CR10","DOI":"10.1145\/800070.802214"},{"issue":"2","key":"33_CR11","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and Systems Sciences, 28(2):270\u2013299, April 1984.","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing, 17(2):281\u2013308, April 1988.","journal-title":"SIAM Journal on Computing"},{"unstructured":"K. Iversen. A Novel Probabilistic Additive Privacy Homomorphism. In Proceedings of the International Conference on Finite Fields, Coding Theory, and Advances in Communications and Computing, Lecture Notes in Pure and Applied Mathematics. Marcel Dekker, August 1991. To appear.","key":"33_CR13"},{"unstructured":"K. Iversen. The Application of Cryptographic Zero-Knowledge Techniques in Computerized Secret Ballot Election Schemes. Doktor ingeni\u00f8r-avhandling 1991:15, Norwegian Institute of Technology, February 1991. IDT-report 1991:3.","key":"33_CR14"},{"unstructured":"M. Merritt. Cryptographic Protocols. PhD thesis, Georgia Institute of Technology, USA, February 1983. GIT-ICS-83\/6.","key":"33_CR15"},{"doi-asserted-by":"crossref","unstructured":"A. Yao. Protocols for Secure Computations. In Proceedings of the 23rd Annual IEEE Symposium on the Foundations of Computer Science, pages 160\u2013164, 1982.","key":"33_CR16","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46766-1_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:13:33Z","timestamp":1605647613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46766-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540551881"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-46766-1_33","relation":{},"subject":[]}}