{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T00:34:15Z","timestamp":1791333255174,"version":"4.3.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319457406","type":"print"},{"value":"9783319457413","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45741-3_13","type":"book-chapter","created":{"date-parts":[[2016,9,14]],"date-time":"2016-09-14T04:50:25Z","timestamp":1473828625000},"page":"241-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["When Are Three Voters Enough for Privacy Properties?"],"prefix":"10.1007","author":[{"given":"Myrto","family":"Arapinis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V\u00e9ronique","family":"Cortier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steve","family":"Kremer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on Prolog rules. In: 14th Computer Security Foundations Workshop (CSFW 2001), pp. 82\u201396. IEEE Computer Society (2001)","DOI":"10.1109\/CSFW.2001.930138"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: Proceedings of the 14th Computer Security Foundations Workshop (CSFW 2001), pp. 174\u2013190. IEEE Computer Society (2001)","DOI":"10.1109\/CSFW.2001.930145"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In: Proceedings of the 18th Annual Symposium on Logic in Computer Science (LICS 2003), pp. 271\u2013280. IEEE Computer Society (2003)","DOI":"10.1109\/LICS.2003.1210067"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bhargavan, K., Corin, R., Fournet, C., Zalinescu, E.: Cryptographically verified implementations for TLS. In: Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS 2008), pp. 459\u2013468, October 2008","DOI":"10.1145\/1455770.1455828"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-31987-0_14","volume-title":"Programming Languages and Systems","author":"S Kremer","year":"2005","unstructured":"Kremer, S., Ryan, M.D.: Analysis of an electronic voting protocol in the applied pi calculus. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 186\u2013200. Springer, Heidelberg (2005)"},{"key":"13_CR6","unstructured":"Gj\u00f8steen, K.: Analysis of an internet voting protocol, Cryptology ePrint Archive, Report 2010\/380 (2010)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. In: 20th Symposium on Logic in Computer Science (LICS 2005), pp. 331\u2013340, June 2005","DOI":"10.1109\/LICS.2005.8"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Tiu, A., Dawson, J.E.: Automating open bisimulation checking for the spi calculus. In: Proceedings of the 23rd Computer Security Foundations Symposium (CSF 2010), pp. 307\u2013321. IEEE Computer Society (2010)","DOI":"10.1109\/CSF.2010.28"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Cheval, V., Comon-Lundh, H., Delaune, S.: Trace equivalence decision: negative tests and non-determinism. In: Proceedings of the 18th ACM Conference on Computer and Communications Security (CCS 2011), ACM, October 2011","DOI":"10.1145\/2046707.2046744"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-28869-2_6","volume-title":"Programming Languages and Systems","author":"R Chadha","year":"2012","unstructured":"Chadha, R., Ciob\u00e2c\u0103, \u015e., Kremer, S.: Automated verification of equivalence properties of cryptographic protocols. In: Seidl, H. (ed.) Programming Languages and Systems. LNCS, vol. 7211, pp. 108\u2013127. Springer, Heidelberg (2012)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Backes, M., Hritcu, C., Maffei, M.: Automated verification of remote electronic voting protocols in the applied pi-calculus. In: 21st IEEE Computer Security Foundations Symposium (CSF 2008), pp. 195\u2013209. IEEE Computer Society (2008)","DOI":"10.1109\/CSF.2008.26"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-28641-4_10","volume-title":"Principles of Security and Trust","author":"M Arapinis","year":"2012","unstructured":"Arapinis, M., Bursuc, S., Ryan, M.D.: Reduction of equational theories for verification of trace equivalence: re-encryption, associativity and commutativity. In: Degano, P., Guttman, J.D. (eds.) Principles of Security and Trust. LNCS, vol. 7215, pp. 169\u2013188. Springer, Heidelberg (2012)"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.3233\/JCS-2012-0458","volume":"21","author":"V Cortier","year":"2013","unstructured":"Cortier, V., Smyth, B.: Attacking and fixing helios: an analysis of ballot secrecy. J. Comput. Secur. 21(1), 89\u2013148 (2013)","journal-title":"J. Comput. Secur."},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-36830-1_2","volume-title":"Principles of Security and Trust","author":"M Arapinis","year":"2013","unstructured":"Arapinis, M., Cortier, V., Kremer, S., Ryan, M.: Practical everlasting privacy. In: Basin, D., Mitchell, J.C. (eds.) POST 2013 (ETAPS 2013). LNCS, vol. 7796, pp. 21\u201340. Springer, Heidelberg (2013)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-28641-4_7","volume-title":"Principles of Security and Trust","author":"V Cortier","year":"2012","unstructured":"Cortier, V., Wiedling, C.: A formal analysis of the Norwegian E-voting protocol. In: Degano, P., Guttman, J.D. (eds.) Principles of Security and Trust. LNCS, vol. 7215, pp. 109\u2013128. Springer, Heidelberg (2012)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of the 28th ACM Symposium on Principles of Programming Languages (POPL 2001), pp. 104\u2013115. ACM (2001)","DOI":"10.1145\/373243.360213"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BFb0028157","volume-title":"Security Protocols","author":"T Okamoto","year":"1998","unstructured":"Okamoto, T.: Receipt-free electronic voting schemes for large scale elections. In: Christianson, B., Crispo, B., Lomas, M., Roe, M. (eds.) Security Protocols 1997. LNCS, vol. 1361, pp. 25\u201335. Springer, Heidelberg (1998)"},{"key":"13_CR18","unstructured":"Adida, B.: Helios: web-based open-audit voting. In: 17th Conference on Security Symposium (SS 2008), pp. 335\u2013348. USENIX Association (2008). http:\/\/dl.acm.org\/citation.cfm?id=1496711.1496734"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-319-11212-1_19","volume-title":"Computer Security - ESORICS 2014","author":"V Cortier","year":"2014","unstructured":"Cortier, V., Galindo, D., Glondu, S., Izabach\u00e8ne, M.: Election verifiability for helios under weaker trust assumptions. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ICAIS 2014, Part II. LNCS, vol. 8713, pp. 327\u2013344. Springer, Heidelberg (2014)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/11863908_20","volume-title":"Computer Security \u2013 ESORICS 2006","author":"PYA Ryan","year":"2006","unstructured":"Ryan, P.Y.A., Schneider, S.A.: Pr\u00eat-\u00e0-voter with re-encryption mixes. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol. 4189, pp. 313\u2013326. Springer, Heidelberg (2006)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-33167-1_26","volume-title":"Computer Security \u2013 ESORICS 2012","author":"J Dreier","year":"2012","unstructured":"Dreier, J., Lafourcade, P., Lakhnech, Y.: Defining privacy for weighted votes, single and multi-voter coercion. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 451\u2013468. Springer, Heidelberg (2012)"},{"key":"13_CR22","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 \u2013 AUSCRYPT 1992","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. 718, pp. 244\u2013251. Springer, Heidelberg (1993)"},{"issue":"1\u20133","key":"13_CR23","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.scico.2003.12.002","volume":"50","author":"H Comon-Lundh","year":"2004","unstructured":"Comon-Lundh, H., Cortier, V.: Security properties: two agents are sufficient. Sci. Comput. Program. 50(1\u20133), 51\u201371 (2004)","journal-title":"Sci. Comput. Program."},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-662-49635-0_11","volume-title":"Principles of Security and Trust","author":"V Cortier","year":"2016","unstructured":"Cortier, V., Dallon, A., Delaune, S.: Bounding the number of agents, for equivalence too. In: Piessens, F., Vigan\u00f2, L. (eds.) POST 2016. LNCS, vol. 9635, pp. 211\u2013232. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49635-0_11"},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jlap.2007.06.002","volume":"75","author":"B Blanchet","year":"2008","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. J. Logic Algebraic Program. 75(1), 3\u201351 (2008)","journal-title":"J. Logic Algebraic Program."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Cortier, V., Kremer, S.: When are three voters enough for privacy properties? Cryptology ePrint Archive, Report 2016\/690, (2016). http:\/\/eprint.iacr.org\/2016\/690","DOI":"10.1007\/978-3-319-45741-3_13"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Bernhard, D., Cortier, V., Galindo, D., Pereira, O., Warinschi, B.: A comprehensive analysis of game-based ballot privacy definitions. In: Proceedings of the 36th IEEE Symposium on Security and Privacy (S&P 2015), pp. 499\u2013516. IEEE Computer Society, May 2015","DOI":"10.1109\/SP.2015.37"},{"key":"13_CR28","unstructured":"Bulens, P., Giry, D., Pereira, O.: Running mixnet-based elections with helios. In: 2011 Electronic Voting Technology Workshop\/Workshop on Trustworthy Elections, EVT\/WOTE 2011, USENIX Association (2011)"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: ACM Workshop on Privacy in the Eectronic Society (WPES 2005), pp. 61\u201370. ACM (2005)","DOI":"10.1145\/1102199.1102213"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Clarkson, M., Chong, S., Myers, A.: Civitas: toward a secure voting system. In: 29th IEEE Symposium on Security and Privacy (S&P 2008), pp. 354\u2013368. IEEE Computer Society (2008)","DOI":"10.1109\/SP.2008.32"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-36830-1_12","volume-title":"Principles of Security and Trust","author":"V Cheval","year":"2013","unstructured":"Cheval, V., Blanchet, B.: Proving more observational equivalences with ProVerif. In: Basin, D., Mitchell, J.C. (eds.) POST 2013 (ETAPS 2013). LNCS, vol. 7796, pp. 226\u2013246. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2016"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45741-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T18:37:00Z","timestamp":1749580620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-45741-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319457406","9783319457413"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45741-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"15 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Heraklion","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}