{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:12:58Z","timestamp":1725739978130},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642391842"},{"type":"electronic","value":"9783642391859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39185-9_1","type":"book-chapter","created":{"date-parts":[[2013,7,7]],"date-time":"2013-07-07T20:39:03Z","timestamp":1373229543000},"page":"1-24","source":"Crossref","is-referenced-by-count":0,"title":["Scaling Privacy Guarantees in Code-Verification Elections"],"prefix":"10.1007","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[]},{"given":"Anthi","family":"Orfanou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-29011-4_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"S. Bayer","year":"2012","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 263\u2013280. Springer, Heidelberg (2012)"},{"key":"1_CR2","first-page":"68","volume-title":"Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002","author":"D. Boneh","year":"2002","unstructured":"Boneh, D., Golle, P.: Almost entirely correct mixing with applications to voting. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, CCS 2002, pp. 68\u201377. ACM, New York (2002)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-14081-5_21","volume-title":"Information Security and Privacy","author":"R. Chaabouni","year":"2010","unstructured":"Chaabouni, R., Lipmaa, H., Shelat, A.: Additive combinatorics and discrete logarithm based range protocols. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol.\u00a06168, pp. 336\u2013351. Springer, Heidelberg (2010)"},{"key":"1_CR4","unstructured":"Chaum, D.: Surevote. International patent WO 01\/55940 A1 (2001)"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MSECP.2004.1264852","volume":"2","author":"D. Chaum","year":"2004","unstructured":"Chaum, D.: Secret-ballot receipts: True voter-verifiable elections. IEEE Security & Privacy\u00a02(1), 38\u201347 (2004)","journal-title":"IEEE Security & Privacy"},{"key":"1_CR6","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":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"1_CR8","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO 1986","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":"1_CR9","unstructured":"Gj\u00f8steen, K.: Analysis internet voting protocol. Technical Report (2010), \n                  \n                    http:\/\/www.regjeringen.no"},{"key":"1_CR10","unstructured":"Gj\u00f8steen, K.: Analysis of an internet voting protocol. IACR Cryptology ePrint Archive 2010:380 (2010)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32747-6_1","volume-title":"E-Voting and Identity","author":"K. Gj\u00f8steen","year":"2012","unstructured":"Gj\u00f8steen, K.: The norwegian internet voting protocol. In: Kiayias, A., Lipmaa, H. (eds.) VoteID 2011. LNCS, vol.\u00a07187, pp. 1\u201318. Springer, Heidelberg (2012)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36288-6_11","volume-title":"Public Key Cryptography - PKC 2003","author":"J. Groth","year":"2003","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 145\u2013160. Springer, Heidelberg (2003)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-15497-3_25","volume-title":"Computer Security \u2013 ESORICS 2010","author":"J. Heather","year":"2010","unstructured":"Heather, J., Ryan, P.Y.A., Teague, V.: Pretty good democracy for more expressive voting schemes. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 405\u2013423. Springer, Heidelberg (2010)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-15497-3_23","volume-title":"Computer Security \u2013 ESORICS 2010","author":"S. Heiberg","year":"2010","unstructured":"Heiberg, S., Lipmaa, H., van Laenen, F.: On E-vote integrity in the case of malicious voter computers. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 373\u2013388. Springer, Heidelberg (2010)"},{"key":"1_CR15","first-page":"339","volume-title":"Proceedings of the 11th USENIX Security Symposium","author":"M. Jakobsson","year":"2002","unstructured":"Jakobsson, M., Juels, A., Rivest, R.L.: Making mix nets robust for electronic voting by randomized partial checking. In: Proceedings of the 11th USENIX Security Symposium, pp. 339\u2013353. USENIX Association, Berkeley (2002)"},{"key":"1_CR16","unstructured":"Lipmaa, H.: Two simple code-verification voting protocols. IACR Cryptology ePrint Archive, 2011:317 (2011)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-36504-4_7","volume-title":"Financial Cryptography","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H., Asokan, N., Niemi, V.: Secure vickrey auctions without threshold trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 87\u2013101. Springer, Heidelberg (2003)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BFb0054015","volume-title":"Public Key Cryptography","author":"W. Mao","year":"1998","unstructured":"Mao, W.: Guaranteed correct sharing of integer factorization with off-line shareholders. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol.\u00a01431, pp. 60\u201371. Springer, Heidelberg (1998)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0053419","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Naor","year":"1995","unstructured":"Naor, M., Shamir, A.: Visual cryptography. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 1\u201312. Springer, Heidelberg (1995)"},{"key":"1_CR20","first-page":"116","volume-title":"Proceedings of the 8th ACM Conference on Computer and Communications Security, CCS 2001","author":"C. Andrew Neff","year":"2001","unstructured":"Andrew Neff, C.: A verifiable secret shuffle and its application to e-voting. In: Proceedings of the 8th ACM Conference on Computer and Communications Security, CCS 2001, pp. 116\u2013125. ACM, New York (2001)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO 1991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Ryan, P.Y.A.: A variant of the chaum voter-verifiable scheme. In: WITS, pp. 81\u201388 (2005)","DOI":"10.1145\/1045405.1045414"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-36213-2_15","volume-title":"Security Protocols XVII","author":"P.Y.A. Ryan","year":"2013","unstructured":"Ryan, P.Y.A., Teague, V.: Pretty good democracy. In: Christianson, B., Malcolm, J.A., Maty\u00e1\u0161, V., Roe, M. (eds.) Security Protocols 2009. LNCS, vol.\u00a07028, pp. 111\u2013130. Springer, Heidelberg (2013)"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.-P. Schnorr","year":"1990","unstructured":"Schnorr, C.-P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990)"},{"issue":"2","key":"1_CR25","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1008280705142","volume":"11","author":"E.R. Verheul","year":"1997","unstructured":"Verheul, E.R., Van Tilborg, H.C.A.: Constructions and properties of k out of nvisual secret sharing schemes. Des. Codes Cryptography\u00a011(2), 179\u2013196 (1997)","journal-title":"Des. Codes Cryptography"}],"container-title":["Lecture Notes in Computer Science","E-Voting and Identify"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39185-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T08:56:01Z","timestamp":1557910561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39185-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642391842","9783642391859"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39185-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}