{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:20:50Z","timestamp":1756635650074,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,10,12]],"date-time":"2015-10-12T00:00:00Z","timestamp":1444608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,10,12]]},"DOI":"10.1145\/2810103.2813727","type":"proceedings-article","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T15:22:12Z","timestamp":1444144932000},"page":"352-363","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["DEMOS-2"],"prefix":"10.1145","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[{"name":"National and Kapodistrian University of Athens, Athens, Greece"}]},{"given":"Thomas","family":"Zacharias","sequence":"additional","affiliation":[{"name":"National and Kapodistrian University of Athens, Athens, Greece"}]},{"given":"Bingsheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Lancaster University, Lancaster, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2015,10,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"USENIX","author":"Adida Ben","year":"2008","unstructured":"Ben Adida . Helios : Web-based open-audit voting . In USENIX , 2008 . Ben Adida. Helios: Web-based open-audit voting. In USENIX, 2008."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2041225.2041250"},{"key":"e_1_3_2_1_3_1","volume-title":"USENIX","author":"Benaloh Josh","year":"2006","unstructured":"Josh Benaloh . Simple verifiable elections . USENIX , 2006 . Josh Benaloh. Simple verifiable elections. USENIX, 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62222"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_22"},{"key":"e_1_3_2_1_6_1","volume-title":"http:\/\/getbootstrap.com\/","author":"Bootstrap Twitter","year":"2015","unstructured":"Bootstrap. Twitter Bootstrap . http:\/\/getbootstrap.com\/ , 2015 . Bootstrap. Twitter Bootstrap. http:\/\/getbootstrap.com\/, 2015."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34961-4_38"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646759.705842"},{"key":"e_1_3_2_1_12_1","first-page":"458","volume-title":"EUROCRYPT","author":"Chaum David","year":"1990","unstructured":"David Chaum . Zero-knowledge undeniable signatures (extended abstract) . In EUROCRYPT , pages 458 -- 464 . Springer , 1990 . David Chaum. Zero-knowledge undeniable signatures (extended abstract). In EUROCRYPT, pages 458--464. Springer, 1990."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2011.5983948"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_6"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788414.1788438"},{"key":"e_1_3_2_1_16_1","volume-title":"Coercion-resistant electronic elections. ePrint","author":"Juels Ari","year":"2002","unstructured":"Ari Juels , Dario Catalano , and Markus Jakobsson . Coercion-resistant electronic elections. ePrint , 2002 :165, 2002. Ari Juels, Dario Catalano, and Markus Jakobsson. Coercion-resistant electronic elections. ePrint, 2002:165, 2002."},{"key":"e_1_3_2_1_17_1","volume-title":"Accountability: Definition and relationship to verifiability. ePrint","author":"K\u00fcsters Ralf","year":"2010","unstructured":"Ralf K\u00fcsters , Tomasz Truderung , and Andreas Vogt . Accountability: Definition and relationship to verifiability. ePrint , 2010 :236, 2010. Ralf K\u00fcsters, Tomasz Truderung, and Andreas Vogt. Accountability: Definition and relationship to verifiability. ePrint, 2010:236, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.21"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_16"},{"key":"e_1_3_2_1_20_1","volume-title":"Publicly verifiable non-interactive zero-knowledge proofs","author":"Lapidot Dror","year":"1990","unstructured":"Dror Lapidot and Adi Shamir . Publicly verifiable non-interactive zero-knowledge proofs . In CRYPTO. Springer , 1990 . Dror Lapidot and Adi Shamir. Publicly verifiable non-interactive zero-knowledge proofs. In CRYPTO. Springer, 1990."},{"key":"e_1_3_2_1_21_1","volume-title":"http:\/\/code.google.com\/p\/crypto-js\/","author":"Mott Jeff","year":"2015","unstructured":"Jeff Mott . Crypto- JS. http:\/\/code.google.com\/p\/crypto-js\/ , 2015 . Jeff Mott. Crypto-JS. http:\/\/code.google.com\/p\/crypto-js\/, 2015."},{"key":"e_1_3_2_1_22_1","volume-title":"TCC","author":"R\u00e0fols Carla","year":"2015","unstructured":"Carla R\u00e0fols . Stretching groth-sahai : NIZK proofs of partial satisfiability . In TCC , 2015 . Carla R\u00e0fols. Stretching groth-sahai: NIZK proofs of partial satisfiability. In TCC, 2015."},{"key":"e_1_3_2_1_23_1","volume-title":"May","author":"Ryan Mark","year":"2015","unstructured":"Mark Ryan and Gurchetan S. Grewal . Online voting is convenient, but if the results aren't verifiable it's not worth the risk. The Conversation, https:\/\/theconversation.com\/online-voting-is-convenient-but-if-the-results-arent-verifiable-its-not-worth-the-risk-41277 , May 2015 . Mark Ryan and Gurchetan S. Grewal. Online voting is convenient, but if the results aren't verifiable it's not worth the risk. The Conversation, https:\/\/theconversation.com\/online-voting-is-convenient-but-if-the-results-arent-verifiable-its-not-worth-the-risk-41277, May 2015."},{"key":"e_1_3_2_1_24_1","first-page":"688","volume-title":"EUROCRYPT","volume":"434","author":"Schnorr Claus-Peter","year":"1989","unstructured":"Claus-Peter Schnorr . Efficient identification and signatures for smart cards . In EUROCRYPT , volume 434 , pages 688 -- 689 . Springer , 1989 . Claus-Peter Schnorr. Efficient identification and signatures for smart cards. In EUROCRYPT, volume 434, pages 688--689. Springer, 1989."},{"key":"e_1_3_2_1_25_1","volume-title":"http:\/\/crypto.stanford.edu\/sjcl\/","author":"Stanford Javascript Crypto Library SJCL.","year":"2015","unstructured":"SJCL. Stanford Javascript Crypto Library . http:\/\/crypto.stanford.edu\/sjcl\/ , 2015 . SJCL. Stanford Javascript Crypto Library. http:\/\/crypto.stanford.edu\/sjcl\/, 2015."}],"event":{"name":"CCS'15: The 22nd ACM Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Denver Colorado USA","acronym":"CCS'15"},"container-title":["Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2810103.2813727","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2810103.2813727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:25Z","timestamp":1750225705000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2810103.2813727"}},"subtitle":["Scalable E2E Verifiable Elections without Random Oracles"],"short-title":[],"issued":{"date-parts":[[2015,10,12]]},"references-count":25,"alternative-id":["10.1145\/2810103.2813727","10.1145\/2810103"],"URL":"https:\/\/doi.org\/10.1145\/2810103.2813727","relation":{},"subject":[],"published":{"date-parts":[[2015,10,12]]},"assertion":[{"value":"2015-10-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}