{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T05:53:53Z","timestamp":1787032433811,"version":"build-2736575974"},"reference-count":71,"publisher":"International Association for Cryptologic Research","issue":"4","license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2024,12,3]]},"abstract":"<jats:p>\n                    In recent years, there has been much focus on developing core cryptographic primitives based on lattice assumptions, driven by the NIST call for post-quantum key encapsulation and digital signature algorithms. However, more work must be conducted on efficient privacy-preserving protocols based on quantum-safe assumptions.                  Electronic voting is one such privacy-preserving protocol whose adoption is increasing across the democratic world. E-voting offers both a fast and convenient alternative to postal voting whilst further ensuring cryptographic privacy of votes and offering full verifiability of the process. Owing to the sensitivity of voting and its infrastructure challenges, it is crucial to ensure security against quantum computers is baked into e-voting solutions.                  We present an e-voting scheme from quantum-safe assumptions based on the hardness of the RLWE and NTRU lattice problems, providing concrete parameters and an efficient implementation. Our design achieves a factor\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mn>5.3<\/mml:mn>\n                        <mml:mi>\u00d7<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    reduction in ciphertext size,\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mn>2.5<\/mml:mn>\n                        <mml:mi>\u00d7<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    reduction in total communication cost, and\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mn>2<\/mml:mn>\n                        <mml:mi>\u00d7<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    reduction in total computation time compared to the state-of-the-art lattice-based voting scheme by Aranha et al. (ACM CCS 2023). We argue that the efficiency of this scheme makes it suitable for real-world elections.                  Our scheme makes use of non-ternary NTRU secrets to achieve optimal parameters. In order to compute the security of our design, we extend the ternary-NTRU work of Ducas and van Woerden (ASIACRYPT 2021) by determining the concrete fatigue point (for general secrets) of NTRU to be\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mi>q<\/mml:mi>\n                        <mml:mo>=<\/mml:mo>\n                        <mml:mn>0.0058<\/mml:mn>\n                        <mml:mi>\u00b7<\/mml:mi>\n                        <mml:msup>\n                          <mml:mi>\u03c3<\/mml:mi>\n                          <mml:mn>2<\/mml:mn>\n                        <\/mml:msup>\n                        <mml:mi>\u00b7<\/mml:mi>\n                        <mml:msup>\n                          <mml:mi>d<\/mml:mi>\n                          <mml:mrow>\n                            <mml:mn>2.484<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:msup>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    (above which parameters become overstretched) for modulus\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mi>q<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    , ring dimension\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mi>d<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    , and secrets drawn from a Gaussian of parameter\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mi>\u03c3<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    . We consider this relation to be of independent interest and demonstrate its significance by improving the efficiency of the (partially) blind signature scheme by del Pino and Katsumata (CRYPTO 2022).\n                  <\/jats:p>","DOI":"10.62056\/a69qudhdj","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T12:00:52Z","timestamp":1736769652000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":5,"title":["More Efficient Lattice-Based Electronic Voting from NTRU"],"prefix":"10.62056","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4037-5512","authenticated-orcid":false,"given":"Patrick","family":"Hough","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/052gg0110","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Oxford","place":["Oxford, United Kingdom"],"department":["Mathematical Institute"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1296-2093","authenticated-orcid":false,"given":"Caroline","family":"Sandsbr\u00e5ten","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/05xg72x27","id-type":"ROR","asserted-by":"publisher"}],"name":"Norwegian University of Science and Technology","place":["Trondheim, Norway"],"department":["Department of Information Security and Communication Technology"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5455-0409","authenticated-orcid":false,"given":"Tjerand","family":"Silde","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/05xg72x27","id-type":"ROR","asserted-by":"publisher"}],"name":"Norwegian University of Science and Technology","place":["Trondheim, Norway"],"department":["Department of Information Security and Communication Technology"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"48349","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"ref1:NISTPQC:CRYSTALS-KYBER22","volume-title":"CRYSTALS-KYBER","author":"Peter Schwabe","year":"2022"},{"key":"ref2:NISTPQC:CRYSTALS-DILITHIUM22","volume-title":"CRYSTALS-DILITHIUM","author":"Vadim Lyubashevsky","year":"2022"},{"key":"ref3:NISTPQC:FALCON22","volume-title":"FALCON","author":"Thomas Prest","year":"2022"},{"key":"ref4:STOC:Ajtai96","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1145\/237814.237838","article-title":"Generating Hard Instances of Lattice Problems (Extended\n  Abstract)","author":"Mikl\u00f3s Ajtai","year":"1996"},{"key":"ref5:TCC:PeiRos06","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11681878_8","article-title":"Efficient Collision-Resistant Hashing from Worst-Case\n  Assumptions on Cyclic Lattices","volume":"3876","author":"Chris Peikert","year":"2006"},{"key":"ref6:ICALP:LyuMic06","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11787006_13","article-title":"Generalized Compact Knapsacks Are Collision Resistant","volume":"4052","author":"Vadim Lyubashevsky","year":"2006"},{"key":"ref7:STOC:Regev05","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/1060590.1060603","article-title":"On lattices, learning with errors, random linear codes, and\n  cryptography","author":"Oded Regev","year":"2005"},{"key":"ref8:EC:LyuPeiReg10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","article-title":"On Ideal Lattices and Learning with Errors over Rings","volume":"6110","author":"Vadim Lyubashevsky","year":"2010"},{"key":"ref9:HofPipSil98","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BFb0054868","article-title":"NTRU: A Ring-Based Public Key Cryptosystem","volume":"1423","author":"Jeffrey Hoffstein","year":"1998"},{"key":"ref10:DCC:LanSte15","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","article-title":"Worst-case to average-case reductions for module lattices","volume":"75","author":"Adeline Langlois","year":"2015","journal-title":"Designs, Codes and Cryptography"},{"key":"ref11:cbsnews-arizona","volume-title":"Online First in Arizona","author":"CBS News","year":"2000"},{"key":"ref12:vinkel2015remote","article-title":"Remote Electronic Voting in Estonia: Legality, Impact, and\n  Confidence","author":"Priit Vinkel","year":"2015","journal-title":"ResearchGate"},{"key":"ref13:post-medien-evoting","volume-title":"Swiss Post article on e-voting introduction","author":"Swiss Post","year":"2023"},{"key":"ref14:ontario2018","volume-title":"Online Voting in Ontario Municipal Elections: A Conflict of\n  Legal Principles and Technology?","author":"Anthony Cardillo","year":"2019"},{"key":"ref15:nsw-elections-ivote","volume-title":"iVote and 2021 NSW Local Government Elections","author":"New South Wales Electoral Commission","year":"2021"},{"key":"ref16:USENIX:Adida08","first-page":"335","article-title":"Helios: Web-based Open-Audit Voting","author":"Ben Adida","year":"2008"},{"key":"ref17:estoniacost","volume-title":"How Much Does an e-Vote Cost? Cost Comparison per Vote in\n  Multichannel Elections in Estonia","author":"Robert Krimmer","year":"2018"},{"key":"ref18:solop2001digital","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1057\/9780230523531_14","article-title":"Digital Democracy Comes of Age: Internet Voting and the 2000\n  Arizona Democratic Primary Election","volume":"34","author":"Frederic I. Solop","year":"2001","journal-title":"PS: Political Science & Politics"},{"key":"ref19:spada2016effects","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1080\/19331681.2016.1162250","article-title":"Effects of the Internet on Participation: Study of a Public\n  Policy Referendum in Brazil","volume":"13","author":"Paolo Spada","year":"2016","journal-title":"Journal of Information Technology & Politics"},{"key":"ref20:PoPETS:HMMP23","doi-asserted-by":"publisher","first-page":"279","DOI":"10.56553\/popets-2023-0017","article-title":"SoK: Secure E-Voting with Everlasting Privacy","volume":"2023","author":"Thomas Haines","year":"2023","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"ref21:Chaum81","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","article-title":"Untraceable electronic mail, return addresses, and digital\n  pseudonyms","volume":"24","author":"David L. Chaum","year":"1981","journal-title":"Commun. ACM","ISSN":"https:\/\/id.crossref.org\/issn\/0001-0782","issn-type":"electronic"},{"key":"ref22:EC:BayGro12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-29011-4_17","article-title":"Efficient Zero-Knowledge Argument for Correctness of a\n  Shuffle","volume":"7237","author":"Stephanie Bayer","year":"2012"},{"key":"ref23:CCS:PLNS17","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1145\/3133956.3134101","article-title":"Practical Quantum-Safe Voting from Lattices","author":"Rafa\u00ebl del Pino","year":"2017"},{"key":"ref24:RSA:ABGST21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-75539-3_10","article-title":"Lattice-Based Proof of Shuffle and Applications to\n  Electronic Voting","volume":"12704","author":"Diego F. Aranha","year":"2021"},{"key":"ref25:ICISC:FarWilKaa21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-031-08896-4_6","article-title":"Improved Lattice-Based Mix-Nets for Electronic Voting","volume":"13218","author":"Valeh Farzaliyev","year":"2021"},{"key":"ref26:CCS:ABGS23","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1145\/3576915.3616683","article-title":"Verifiable Mix-Nets and Distributed Decryption for Voting\n  from Lattice-Based Assumptions","author":"Diego F. Aranha","year":"2023"},{"key":"ref27:TCC:BenDam10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-11799-2_13","article-title":"Threshold Decryption and Zero-Knowledge Proofs for\n  Lattice-Based Cryptosystems","volume":"5978","author":"Rikke Bendlin","year":"2010"},{"key":"ref28:C:BBCPGL18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-319-96881-0_23","article-title":"Sub-linear Lattice-Based Zero-Knowledge Arguments for\n  Arithmetic Circuits","volume":"10992","author":"Carsten Baum","year":"2018"},{"key":"ref29:NISTPQC-R3:FALCON20","volume-title":"FALCON","author":"Thomas Prest","year":"2020"},{"key":"ref30:ITCS:BraGenVai12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/2090236.2090262","article-title":"(Leveled) fully homomorphic encryption without\n  bootstrapping","author":"Zvika Brakerski","year":"2012"},{"key":"ref31:C:AlbBaiDuc16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-662-53018-4_6","article-title":"A Subfield Lattice Attack on Overstretched NTRU\n  Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes","volume":"9814","author":"Martin R. Albrecht","year":"2016"},{"key":"ref32:CheonJeongLee2016","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1112\/S1461157016000371","article-title":"An algorithm for NTRU problems and cryptanalysis of the GGH\n  multilinear map without a low-level encoding of zero","volume":"19","author":"Jung Hee Cheon","year":"2016","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"ref33:EC:KirFou17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-56620-7_1","article-title":"Revisiting Lattice Attacks on Overstretched NTRU\n  Parameters","volume":"10210","author":"Paul Kirchner","year":"2017"},{"key":"ref34:AC:DucvWo21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-92068-5_1","article-title":"NTRU Fatigue: How Stretched is Overstretched?","volume":"13093","author":"L\u00e9o Ducas","year":"2021"},{"key":"ref35:EC:SteSte11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","article-title":"Making NTRU as Secure as Worst-Case Problems over Ideal\n  Lattices","volume":"6632","author":"Damien Stehl\u00e9","year":"2011"},{"key":"ref36:ESORICS:BLNS21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-88428-4_30","article-title":"More Efficient Amortization of Exact Zero-Knowledge Proofs\n  for LWE","volume":"12973","author":"Jonathan Bootle","year":"2021"},{"key":"ref37:C:dPiKat22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-031-15979-4_11","article-title":"A New Framework for More Efficient Round-Optimal\n  Lattice-Based (Partially) Blind Signature via Trapdoor Sampling","volume":"13508","author":"Rafa\u00ebl del Pino","year":"2022"},{"key":"ref38:FCW:CosMarMor19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-030-43725-1_23","article-title":"Lattice-Based Proof of a Shuffle","volume":"11599","author":"N\u00faria Costa","year":"2019"},{"key":"ref39:FCW:HerMarSan21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-662-63958-0_27","article-title":"Shorter Lattice-Based Zero-Knowledge Proofs for the\n  Correctness of a Shuffle","volume":"12676","author":"Javier Herranz","year":"2021"},{"key":"ref40:FCW:Strand18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-662-58820-8_12","article-title":"A Verifiable Shuffle for the GSW Cryptosystem","volume":"10958","author":"Martin Strand","year":"2019"},{"key":"ref41:PQCRYPTO:CGGI16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-29360-8_16","article-title":"A Homomorphic LWE Based E-voting Scheme","author":"Ilaria Chillotti","year":"2016"},{"key":"ref42:ESORICS:BoyHaiMul20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-59013-0_17","article-title":"A Verifiable and Practical Lattice-Based Decryption Mix Net\n  with External Auditing","volume":"12309","author":"Xavier Boyen","year":"2020"},{"key":"ref43:JC:RSTVW22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00145-021-09416-w","article-title":"Actively Secure Setup for SPDZ","volume":"35","author":"Dragos Rotaru","year":"2022","journal-title":"Journal of Cryptology"},{"key":"ref44:FOCS:MicReg04","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/FOCS.2004.72","article-title":"Worst-Case to Average-Case Reductions Based on Gaussian\n  Measures","author":"Daniele Micciancio","year":"2004"},{"key":"ref45:EC:Lyubashevsky12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","article-title":"Lattice Signatures without Trapdoors","volume":"7237","author":"Vadim Lyubashevsky","year":"2012"},{"key":"ref46:C:BooLyuSei19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-030-26948-7_7","article-title":"Algebraic Techniques for Short(er) Exact Lattice-Based\n  Zero-Knowledge Proofs","volume":"11692","author":"Jonathan Bootle","year":"2019"},{"key":"ref47:PKC:LyuNguSei21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-75245-3_9","article-title":"Shorter Lattice-Based Zero-Knowledge Proofs via One-Time\n  Commitments","volume":"12710","author":"Vadim Lyubashevsky","year":"2021"},{"key":"ref48:STOC:LopTroVai12","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1145\/2213977.2214086","article-title":"On-the-fly multiparty computation on the cloud via multikey\n  fully homomorphic encryption","author":"Adriana L\u00f3pez-Alt","year":"2012"},{"key":"ref49:EC:SaiXagYam18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-319-78372-7_17","article-title":"Tightly-Secure Key-Encapsulation Mechanism in the Quantum\n  Random Oracle Model","volume":"10822","author":"Tsunekazu Saito","year":"2018"},{"key":"ref50:EPRINT:CKKS19","volume-title":"A New Trapdoor over Module-NTRU Lattice and its\n  Application to ID-based Encryption","author":"Jung Hee Cheon","year":"2019"},{"key":"ref51:ASIACCS:CPSWX20","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1145\/3320269.3384758","article-title":"ModFalcon: Compact Signatures Based On Module-NTRU\n  Lattices","author":"Chitchanok Chuengsatiansup","year":"2020"},{"key":"ref52:SCN:BDLOP18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-98113-0_20","article-title":"More Efficient Commitments from Structured Lattice\n  Assumptions","volume":"11035","author":"Carsten Baum","year":"2018"},{"key":"ref53:gjosteen22","doi-asserted-by":"crossref","DOI":"10.1201\/9781003149422","volume-title":"Practical Mathematical Cryptography","author":"Kristian Gjosteen","year":"2022"},{"key":"ref54:EPRINT:ABGS22","volume-title":"Verifiable Mix-Nets and Distributed Decryption for Voting\n  from Lattice-Based Assumptions","author":"Diego F. Aranha","year":"2022"},{"key":"ref55:C:LyuNguPla22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-15979-4_3","article-title":"Lattice-Based Zero-Knowledge Proofs and Applications:\n  Shorter, Simpler, and More General","volume":"13508","author":"Vadim Lyubashevsky","year":"2022"},{"key":"ref56:EPRINT:LeeWal20","volume-title":"Lattice analysis on MiNTRU problem","author":"Changmin Lee","year":"2020"},{"key":"ref57:pataki2008sublatticedeterminantsreducedbases","volume-title":"On sublattice determinants in reduced bases","author":"Gabor Pataki","year":"2008"},{"key":"ref58:USENIX:ADPS16","first-page":"327","article-title":"Post-quantum Key Exchange - A New Hope","author":"Erdem Alkim","year":"2016"},{"key":"ref59:albrecht2015concrete","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","article-title":"On the concrete hardness of learning with errors","volume":"9","author":"Martin R Albrecht","year":"2015","journal-title":"Journal of Mathematical Cryptology"},{"key":"ref60:C:Katsumata21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/978-3-030-84245-1_20","article-title":"A New Simple Technique to Bootstrap Various Lattice\n  Zero-Knowledge Proofs to QROM Secure NIZKs","volume":"12826","author":"Shuichi Katsumata","year":"2021"},{"key":"ref61:NISTPQC-R1:DingKeyExchange17","volume-title":"Ding Key Exchange","author":"Jintai Ding","year":"2017"},{"key":"ref62:NISTPQC-R1:EMBLEMandR.EMBLEM17","volume-title":"EMBLEM and R.EMBLEM","author":"Minhye Seo","year":"2017"},{"key":"ref63:AC:BIPPS22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-031-22966-4_7","article-title":"FINAL: Faster FHE Instantiated with NTRU and LWE","volume":"13792","author":"Charlotte Bonte","year":"2022"},{"key":"ref64:Micciancio2009","isbn-type":"print","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"Daniele Micciancio","year":"2009","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540887027"},{"key":"ref65:returncodes","doi-asserted-by":"publisher","DOI":"10.15157\/diss\/025","article-title":"Return Codes from Lattice Assumptions","author":"Audhild H\u00f8g\u00e5sen","year":"2022","journal-title":"E-VOTE-ID"},{"key":"ref66:CCS:AKSY22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/3548606.3560650","article-title":"Practical, Round-Optimal Lattice-Based Blind Signatures","author":"Shweta Agrawal","year":"2022"},{"key":"ref67:AC:BouSch23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-981-99-8721-4_12","article-title":"Simple Threshold (Fully Homomorphic) Encryption from LWE\n  with Polynomial Modulus","volume":"14438","author":"Katharina Boudgoust","year":"2023"},{"key":"ref68:EPRINT:CSSMCP22","volume-title":"Efficient Threshold FHE with Application to Real-Time\n  Systems","author":"Siddhartha Chowdhury","year":"2022"},{"key":"ref69:C:KLSS23b","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-031-38554-4_18","article-title":"Toward Practical Lattice-Based Proof of Knowledge from\n  Hint-MLWE","volume":"14085","author":"Duhyeong Kim","year":"2023"},{"key":"ref70:C:BeuSei23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-031-38554-4_17","article-title":"LaBRADOR: Compact Proofs for R1CS from Module-SIS","volume":"14085","author":"Ward Beullens","year":"2023"},{"key":"ref71:CCS:Kluczniak22","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1145\/3548606.3560700","article-title":"NTRU-v-um: Secure Fully Homomorphic Encryption from NTRU\n  with Small Modulus","author":"Kamil Kluczniak","year":"2022"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T12:11:12Z","timestamp":1736770272000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/1\/4\/10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,13]]},"references-count":71,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,1,13]]}},"URL":"https:\/\/doi.org\/10.62056\/a69qudhdj","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,13]]},"assertion":[{"value":"2024-10-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-03","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc1-4-10"}}