{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:34:59Z","timestamp":1759336499821,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030603465"},{"type":"electronic","value":"9783030603472"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60347-2_4","type":"book-chapter","created":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T06:02:54Z","timestamp":1600927374000},"page":"50-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Revisiting Practical and Usable Coercion-Resistant Remote E-Voting"],"prefix":"10.1007","author":[{"given":"Ehsan","family":"Estaji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Haines","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristian","family":"Gj\u00f8steen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter B.","family":"R\u00f8nne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Y. A.","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Najmeh","family":"Soroush","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,25]]},"reference":[{"key":"4_CR1","series-title":"Discrete Mathematics and Its Applications","volume-title":"How to Count: An Introduction to Combinatorics","author":"RBJT Allenby","year":"2011","unstructured":"Allenby, R.B.J.T., Slomson, A.: How to Count: An Introduction to Combinatorics. Discrete Mathematics and Its Applications, 2nd edn. Taylor & Francis, New York (2011)","edition":"2"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-662-53357-4_15","volume-title":"Financial Cryptography and Data Security","author":"R Ara\u00fajo","year":"2016","unstructured":"Ara\u00fajo, R., Barki, A., Brunet, S., Traor\u00e9, J.: Remote electronic voting can be efficient, verifiable and coercion-resistant. In: Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D., Brenner, M., Rohloff, K. (eds.) FC 2016. LNCS, vol. 9604, pp. 224\u2013232. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53357-4_15"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: TCC, pp. 325\u2013341 (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Clarkson, M.R., Chong, S., Myers, A.C.: Civitas: toward a secure voting system. In: 2008 IEEE Symposium on Security and Privacy, 18\u201321 May 2008, Oakland, California, USA, pp. 354\u2013368. IEEE Computer Society (2008)","DOI":"10.1109\/SP.2008.32"},{"key":"4_CR5","unstructured":"Feier, C., Neumann, S., Volkamer, M.: Coercion-resistant internet voting in practice. In: Pl\u00f6dereder, E., Grunske, L., Schneider, E., Ull, D., (eds.) 44. Jahrestagung der Gesellschaft f\u00fcr Informatik, Informatik 2014, Big Data - Komplexit\u00e4t meistern, 2014, vol. P-232 of LNI, pp. 1401\u20131414. GI (2014)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-662-58820-8_15","volume-title":"Financial Cryptography and Data Security","author":"P Grontas","year":"2019","unstructured":"Grontas, P., Pagourtzis, A., Zacharakis, A., Zhang, B.: Towards everlasting privacy and efficient coercion resistance in remote electronic voting. In: Zohar, A., et al. (eds.) FC 2018. LNCS, vol. 10958, pp. 210\u2013231. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-58820-8_15"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 415\u2013432. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_24"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-70278-0_24","volume-title":"International Conference on Financial Cryptography and Data Security","author":"V Iovino","year":"2017","unstructured":"Iovino, V., Rial, A., R\u00f8nne, P.B., Ryan, P.Y.A.: Using selene to verify your vote in JCJ. In: Brenner, M., et al. (eds.) FC 2017. LNCS, vol. 10323, pp. 385\u2013403. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70278-0_24"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-30625-0_12","volume-title":"Electronic Voting","author":"W Jamroga","year":"2019","unstructured":"Jamroga, W., Roenne, P.B., Ryan, P.Y.A., Stark, P.B.: Risk-limiting tallies. In: Krimmer, R., et al. (eds.) E-Vote-ID 2019. LNCS, vol. 11759, pp. 183\u2013199. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30625-0_12"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-12980-3_2","volume-title":"Towards Trustworthy Elections","author":"A Juels","year":"2010","unstructured":"Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: Chaum, D., et al. (eds.) Towards Trustworthy Elections. LNCS, vol. 6000, pp. 37\u201363. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12980-3_2"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-22270-7_4","volume-title":"E-Voting and Identity","author":"O Kulyk","year":"2015","unstructured":"Kulyk, O., Teague, V., Volkamer, M.: Extending helios towards private eligibility verifiability. In: Haenni, R., Koenig, R.E., Wikstr\u00f6m, D. (eds.) E-Voting and Identity, pp. 57\u201373. Springer International Publishing, Cham (2015)"},{"key":"4_CR12","first-page":"405","volume":"2020","author":"R K\u00fcsters","year":"2020","unstructured":"K\u00fcsters, R., Liedtke, J., Mueller, J., Rausch, D., Vogt, A.: Ordinos: a verifiable tally-hiding e-voting system. IACR Cryptol. ePrint Arch. 2020, 405 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-642-39212-2_56","volume-title":"Automata, Languages, and Programming","author":"H Lipmaa","year":"2013","unstructured":"Lipmaa, H., Toft, T.: Secure equality and greater-than tests with sublinear online complexity. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 645\u2013656. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_56"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Silva Neto, A., Leite, M., Ara\u00fajo, R., Pereira Mota, M., Sampaio Neto, N., Traor\u00e9, J.: Usability considerations for coercion-resistant election systems. In: Mota, M., Serique Meiguins, B., Prates, R., Candello, H., (eds.) Proceedings of the 17th Brazilian Symposium on Human Factors in Computing Systems, IHC 2018, Brazil, 2018, pp. 40:1\u201340:10. ACM (2018)","DOI":"10.1145\/3274192.3274232"},{"key":"4_CR15","unstructured":"Neumann, S., Feier, C., Volkamer, M., Koenig, R.: Towards a practical JCJ\/Civitas implementation. In: INFORMATIK 2013-Informatik angepasst an Mensch, Organisation und Umwelt (2013)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Neumann, S., Volkamer, M.: Civitas and the real world: problems and solutions from a practical point of view. In: Seventh International Conference on Availability, Reliability and Security, Prague, ARES 2012, Czech Republic, 20\u201324 August 2012, pp. 180\u2013185. IEEE Computer Society (2012)","DOI":"10.1109\/ARES.2012.75"},{"key":"4_CR17","unstructured":"Roenne, P.B.: JCJ with improved verifiability guarantees. In: The International Conference on Electronic Voting E-Vote-ID 2016 (2016)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"R\u00f8nne, P.B., Atashpendar, A., Gj\u00f8steen, K., Ryan, P.Y.A.: Coercion-resistant voting in linear time via fully homomorphic encryption: towards a quantum-safe scheme. arXiv preprint arXiv:1901.02560 (2019)","DOI":"10.1007\/978-3-030-43725-1_20"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-48390-X_9","volume-title":"Financial Cryptography","author":"A Shamir","year":"1999","unstructured":"Shamir, A., van Someren, N.: Playing \u2018Hide and Seek\u2019 with Stored Keys. In: Franklin, M. (ed.) FC 1999. LNCS, vol. 1648, pp. 118\u2013124. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48390-X_9"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-27576-0_15","volume-title":"Financial Cryptography and Data Security","author":"O Spycher","year":"2012","unstructured":"Spycher, O., Koenig, R., Haenni, R., Schl\u00e4pfer, M.: A new approach towards coercion-resistant remote e-voting in linear time. In: Danezis, G. (ed.) FC 2011. LNCS, vol. 7035, pp. 182\u2013189. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27576-0_15"},{"issue":"3","key":"4_CR21","first-page":"258","volume":"6","author":"P-Y Ting","year":"2008","unstructured":"Ting, P.-Y., Huang, X.-W.: Distributed paillier plaintext equivalence test. Int. J. Netw. Secur. 6(3), 258\u2013264 (2008)","journal-title":"Int. J. Netw. Secur."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Wiseman, S., Cairns, P., Cox, A.: A taxonomy of number entry error. In: Proceedings of the 25th BCS Conference on Human-Computer Interaction, pp. 187\u2013196. British Computer Society (2011)","DOI":"10.14236\/ewic\/HCI2011.46"}],"container-title":["Lecture Notes in Computer Science","Electronic Voting"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60347-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T19:26:47Z","timestamp":1645212407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60347-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030603465","9783030603472"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60347-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"E-Vote-ID","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Electronic Voting","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bregenz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoteid2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.e-vote-id.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}