{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:57:17Z","timestamp":1755838637120,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["CRETP2-166734"],"award-info":[{"award-number":["CRETP2-166734"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134101","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"1565-1581","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Practical Quantum-Safe Voting from Lattices"],"prefix":"10.1145","author":[{"given":"Rafa\u00ebl","family":"del Pino","sequence":"first","affiliation":[{"name":"IBM Research - Zurich, Ruschlikon, Switzerland"}]},{"given":"Vadim","family":"Lyubashevsky","sequence":"additional","affiliation":[{"name":"IBM Research - Zurich, Ruschlikon, Switzerland"}]},{"given":"Gregory","family":"Neven","sequence":"additional","affiliation":[{"name":"IBM Research - Zurich, Ruschlikon, Switzerland"}]},{"given":"Gregor","family":"Seiler","sequence":"additional","affiliation":[{"name":"IBM Research - Zurich, Ruschlikon, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Michel Abdalla Pierre-Alain Fouque Vadim Lyubashevsky and Mehdi Tibouchi 2012. Tightly-Secure Signatures from Lossy Identification Schemes EUROCRYPT. 572--590.","DOI":"10.1007\/978-3-642-29011-4_34"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the 17th USENIX Security Symposium","author":"Adida Ben","year":"2008","unstructured":"Ben Adida. 2008. Helios: Web-based Open-Audit Voting. In Proceedings of the 17th USENIX Security Symposium, July 28-August 1, 2008, San Jose, CA, USA. 335--348."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_4_1","volume-title":"Post-quantum Key Exchange - A New Hope. In 25th USENIX Security Symposium, USENIX Security 16","author":"Alkim Erdem","year":"2016","unstructured":"Erdem Alkim, L\u00e9o Ducas, Thomas P\u00f6ppelmann, and Peter Schwabe 2016. Post-quantum Key Exchange - A New Hope. In 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10--12, 2016. 327--343. https:\/\/www.usenix.org\/conference\/usenixsecurity16\/technical-sessions\/presentation\/alkim"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01445125"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53015-3_17"},{"key":"e_1_3_2_1_7_1","first-page":"997","article-title":"Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems","volume":"2016","author":"Baum Carsten","year":"2016","unstructured":"Carsten Baum, Ivan Damg\u00e5rd, Sabine Oechsner, and Chris Peikert 2016. Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems. IACR Cryptology ePrint Archive Vol. 2016 (2016), 997. http:\/\/eprint.iacr.org\/2016\/997","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_8_1","first-page":"759","article-title":"Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings","volume":"2017","author":"Baum Carsten","year":"2017","unstructured":"Carsten Baum and Vadim Lyubashevsky 2017. Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. IACR Cryptology ePrint Archive Vol. 2017 (2017), 759. http:\/\/eprint.iacr.org\/2017\/759","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Fabrice Benhamouda Jan Camenisch Stephan Krenn Vadim Lyubashevsky and Gregory Neven. 2014. Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures ASIACRYPT. 551--572.","DOI":"10.1007\/978-3-662-45611-8_29"},{"key":"e_1_3_2_1_10_1","volume-title":"SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions IEEE Symposium on Security and Privacy. 499--516","author":"Bernhard David","year":"2015","unstructured":"David Bernhard, V\u00e9ronique Cortier, David Galindo, Olivier Pereira, and Bogdan Warinschi. 2015. SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions IEEE Symposium on Security and Privacy. 499--516."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29360-8_16"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.52"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/869328"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Ronald Cramer Ivan Damg\u00e5rd Chaoping Xing and Chen Yuan 2017. Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack EUROCRYPT. shownoteAlso available at http:\/\/eprint.iacr.org\/2016\/681.","DOI":"10.1007\/978-3-319-56620-7_17"},{"key":"e_1_3_2_1_15_1","volume-title":"Multi-Autority Secret-Ballot Elections with Linear Work EUROCRYPT '96","author":"Cramer Ronald","year":"1996","unstructured":"Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers, and Moti Yung 1996. Multi-Autority Secret-Ballot Elections with Linear Work EUROCRYPT '96. 72--83."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd Serge Fehr and Louis Salvail. 2004. Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks CRYPTO. 254--272.","DOI":"10.1007\/978-3-540-28628-8_16"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd Torben P. Pedersen and Birgit Pfitzmann 1993. On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures CRYPTO. 250--265.","DOI":"10.1007\/3-540-48329-2_22"},{"key":"e_1_3_2_1_18_1","first-page":"280","article-title":". Amortization with Fewer Equations for Proving Knowledge of Small Secrets","volume":"2017","author":"Pino Rafa\u00ebl Del","year":"2017","unstructured":"Rafa\u00ebl Del Pino and Vadim Lyubashevsky 2017. Amortization with Fewer Equations for Proving Knowledge of Small Secrets. IACR Cryptology ePrint Archive Vol. 2017 (2017), 280. shownoteTo appear in CRYPTO 2017.","journal-title":"IACR Cryptology ePrint Archive"},{"volume-title":"Security Analysis of the Diebold AccuVote-TS Voting Machine 2007 USENIX\/ACCURATE Electronic Voting Technology Workshop, EVT'07.","author":"Feldman Ariel J.","key":"e_1_3_2_1_19_1","unstructured":"Ariel J. Feldman, J. Alex Halderman, and Edward W. Felten. 2007. Security Analysis of the Diebold AccuVote-TS Voting Machine 2007 USENIX\/ACCURATE Electronic Voting Technology Workshop, EVT'07."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Amos Fiat and Adi Shamir 1986. How to Prove Yourself: Practical Solutions to Identification and Signature Problems CRYPTO. 186--194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry. 2009. Fully homomorphic encryption using ideal lattices. STOC. 169--178.","DOI":"10.1145\/1536414.1536440"},{"volume-title":"EVT'07","author":"Gonggrijp Rop","key":"e_1_3_2_1_22_1","unstructured":"Rop Gonggrijp and Willem-Jan Hengeveld. Studying the Nedap\/Groenendaal ES3B Voting Computer: A Computer Security Perspective 2007 USENIX\/ACCURATE Electronic Voting Technology Workshop, EVT'07."},{"key":"e_1_3_2_1_23_1","volume-title":"Pancratz","author":"Hart W.","year":"2013","unstructured":"W. Hart, F. Johansson, and S. Pancratz 2013. FLINT: Fast Library for Number Theory. (2013). shownoteVersion 2.4.0, http:\/\/flintlib.org."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9938-4"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","unstructured":"Vadim Lyubashevsky. 2012. Lattice Signatures Without Trapdoors. In EUROCRYPT. 738--755. 10.1007\/978-3-642-29011-4_43","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky and Daniele Micciancio 2006. Generalized Compact Knapsacks Are Collision Resistant ICALP (2). 144--155.","DOI":"10.1007\/11787006_13"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky Chris Peikert and Oded Regev. 2010. On Ideal Lattices and Learning with Errors over Rings EUROCRYPT. 1--23.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_28_1","unstructured":"Vadim Lyubashevsky and Gregor Seiler 2017. Partially Splitting Rings for Faster Lattice-Based Zero-Knowledge Proofs. (2017)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Carlos Aguilar Melchor Slim Bettaieb Xavier Boyen Laurent Fousse and Philippe Gaborit. 2013. Adapting Lyubashevsky's Signature Schemes to the Ring Signature Setting AFRICACRYPT. 1--25.","DOI":"10.1007\/978-3-642-38553-7_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Chris Peikert and Alon Rosen 2006. Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices TCC. 145--166.","DOI":"10.1007\/11681878_8"},{"key":"e_1_3_2_1_31_1","unstructured":"Scytl R&D. 2017. Swiss Online Voting Protocol. https:\/\/www.post.ch\/-\/media\/post\/evoting\/dokumente\/swiss-post-online-voting-protocol.pdf. (2017)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Jacques Stern. 1993. A New Identification Scheme Based on Syndrome Decoding CRYPTO. 13--21.","DOI":"10.1007\/3-540-48329-2_2"},{"key":"e_1_3_2_1_33_1","first-page":"398","article-title":"Post-Quantum Security of Fiat-Shamir","volume":"2017","author":"Unruh Dominique","year":"2017","unstructured":"Dominique Unruh. 2017. Post-Quantum Security of Fiat-Shamir. IACR Cryptology ePrint Archive Vol. 2017 (2017), 398. http:\/\/eprint.iacr.org\/2017\/398endthebibliography","journal-title":"IACR Cryptology ePrint Archive"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Dallas Texas USA","acronym":"CCS '17"},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134101","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:03Z","timestamp":1750212663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":33,"alternative-id":["10.1145\/3133956.3134101","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134101","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}