| 2026 | EuroCrypt | Cyclo: Lightweight Lattice-Based Folding via Partial Range Checks. | Albert Garreta, Helger Lipmaa, Urmas Luhar, Michal Osadnik |
| 2026 | EuroCrypt | Special Soundness and Binding Properties: A Framework for Tightly Secure zk-SNARKs. | Erki Klaots, Helger Lipmaa, Roberto Parisella, Janno Siim |
| 2025 | CRYPTO | On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions. | Helger Lipmaa, Roberto Parisella, Janno Siim |
| 2025 | TCC | Plonk is Simulation Extractable in ROM Under Falsifiable Assumptions. | Helger Lipmaa |
| 2024 | CRYPTO | Polymath: Groth16 Is Not the Limit. | Helger Lipmaa |
| 2024 | EuroCrypt | Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions. | Helger Lipmaa, Roberto Parisella, Janno Siim |
| 2024 | PKC | Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees. | Matteo Campanelli, Antonio Faonio, Dario Fiore, Tianyu Li, Helger Lipmaa |
| 2023 | ASIACRYPT | On Black-Box Knowledge-Sound Commit-And-Prove SNARKs. | Helger Lipmaa |
| 2023 | TCC | Algebraic Group Model with Oblivious Sampling. | Helger Lipmaa, Roberto Parisella, Janno Siim |
| 2022 | ASIACRYPT | Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK. | Helger Lipmaa, Janno Siim, Michal Zajac |
| 2022 | PKC | A Unified Framework for Non-universal SNARKs. | Helger Lipmaa |
| 2021 | ASIACRYPT | Efficient NIZKs for Algebraic Sets. | Geoffroy Couteau, Helger Lipmaa, Roberto Parisella, Arne Tobias degaard |
| 2021 | ASIACRYPT | Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge. | Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac, Arne Tobias degaard |
| 2021 | ASIACRYPT | Gentry-Wichs is Tight: a Falsifiable Non-adaptively Sound SNARG. | Helger Lipmaa, Kateryna Pavlyk |
| 2021 | FC | Somewhere Statistically Binding Commitment Schemes with Applications. | Prastudy Fauzi, Helger Lipmaa, Zaira Pindado, Janno Siim |
| 2021 | INDOCRYPT | Smooth Zero-Knowledge Hash Functions. | Behzad Abdolmaleki, Hamidreza Khoshakhlagh, Helger Lipmaa |
| 2020 | ASIACRYPT | Succinct Functional Commitment for a Large Class of Arithmetic Circuits. | Helger Lipmaa, Kateryna Pavlyk |
| 2020 | PKC | On QA-NIZK in the BPK Model. | Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac |
| 2020 | SCN | Key-and-Argument-Updatable QA-NIZKs. | Helger Lipmaa |
| 2019 | ACNS | DL-Extractable UC-Commitment Schemes. | Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac |
| 2018 | SCN | On the Security Properties of e-Voting Bulletin Boards. | Aggelos Kiayias, Annabell Kuldmaa, Helger Lipmaa, Janno Siim, Thomas Zacharias |
| 2017 | ASIACRYPT | A Subversion-Resistant SNARK. | Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Michal Zajac |
| 2017 | ASIACRYPT | An Efficient Pairing-Based Shuffle Argument. | Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac |
| 2017 | FC | Optimally Sound Sigma Protocols Under DCRA. | Helger Lipmaa |
| 2017 | FC | A Simpler Rate-Optimal CPIR Protocol. | Helger Lipmaa, Kateryna Pavlyk |
| 2017 | PKC | CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions. | Fabrice Benhamouda, Florian Bourse, Helger Lipmaa |
| 2016 | ASIACRYPT | A Shuffle Argument Secure in the Generic Model. | Prastudy Fauzi, Helger Lipmaa, Michal Zajac |
| 2015 | CANS | Analysis and Implementation of an Efficient Ring-LPN Based Commitment Scheme. | Helger Lipmaa, Kateryna Pavlyk |
| 2014 | FC | Efficient Non-Interactive Zero Knowledge Arguments for Set Operations. | Prastudy Fauzi, Helger Lipmaa, Bingsheng Zhang |
| 2014 | SCN | Efficient NIZK Arguments via Parallel Verification of Benes Networks. | Helger Lipmaa |
| 2013 | ASIACRYPT | Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes. | Helger Lipmaa |
| 2013 | CANS | Efficient Modular NIZK Arguments from Shift and Product. | Prastudy Fauzi, Helger Lipmaa, Bingsheng Zhang |
| 2013 | FC | Practical Fully Simulatable Oblivious Transfer with Sublinear Communication. | Bingsheng Zhang, Helger Lipmaa, Cong Wang, Kui Ren |
| 2013 | ICALP | Secure Equality and Greater-Than Tests with Sublinear Online Complexity. | Helger Lipmaa, Tomas Toft |
| 2012 | ACNS | Secure Accumulators from Euclidean Rings without Trusted Setup. | Helger Lipmaa |
| 2012 | FC | A Non-interactive Range Proof with Constant Communication. | Rafik Chaabouni, Helger Lipmaa, Bingsheng Zhang |
| 2012 | SCN | A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument. | Helger Lipmaa, Bingsheng Zhang |
| 2012 | TCC | Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments. | Helger Lipmaa |
| 2010 | ACISP | Additive Combinatorics and Discrete Logarithm Based Range Protocols. | Rafik Chaabouni, Helger Lipmaa, Abhi Shelat |
| 2010 | ACNS | Two New Efficient PIR-Writing Protocols. | Helger Lipmaa, Bingsheng Zhang |
| 2010 | ESORICS | On E-Vote Integrity in the Case of Malicious Voter Computers. | Sven Heiberg, Helger Lipmaa, Filip van Laenen |
| 2010 | PKC | Multi-query Computationally-Private Information Retrieval with Constant Communication Rate. | Jens Groth, Aggelos Kiayias, Helger Lipmaa |
| 2010 | PKC | On the Feasibility of Consistent Computations. | Sven Laur, Helger Lipmaa |
| 2009 | ICISC | First CPIR Protocol with Data-Dependent Computation. | Helger Lipmaa |
| 2008 | CANS | Hybrid Damgrd Is CCA1-Secure under the DDH Assumption. | Yvo Desmedt, Helger Lipmaa, Duong Hieu Phan |
| 2008 | CiE | Succinct NP Proofs from an Extractability Assumption. | Giovanni Di Crescenzo, Helger Lipmaa |
| 2008 | ISAAC | 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge. | Giovanni Di Crescenzo, Helger Lipmaa |
| 2007 | ACNS | A New Protocol for Conditional Disclosure of Secrets and Its Applications. | Sven Laur, Helger Lipmaa |
| 2006 | KDD | Cryptographically private support vector machines. | Sven Laur, Helger Lipmaa, Taneli Mielikinen |
| 2005 | FC | Small Coalitions Cannot Manipulate Voting. | Edith Elkind, Helger Lipmaa |
| 2005 | ICALP | Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction. | Helger Lipmaa, Guilin Wang, Feng Bao |
| 2005 | ICICS | Private Itemset Support Counting. | Sven Laur, Helger Lipmaa, Taneli Mielikinen |
| 2005 | ICICS | On Delegatability of Four Designated Verifier Signatures. | Yong Li, Helger Lipmaa, Dingyi Pei |
| 2005 | ISAAC | Hybrid Voting Protocols and Hardness of Manipulation. | Edith Elkind, Helger Lipmaa |
| 2004 | FC | Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. | Edith Elkind, Helger Lipmaa |
| 2004 | FSE | On the Additive Differential Probability of Exclusive-Or. | Helger Lipmaa, Johan Walln, Philippe Dumas |
| 2004 | ICISC | On Private Scalar Product Computation for Privacy-Preserving Data Mining. | Bart Goethals, Sven Laur, Helger Lipmaa, Taneli Mielikinen |
| 2004 | PKC | Cryptographic Randomized Response Techniques. | Andris Ambainis, Markus Jakobsson, Helger Lipmaa |
| 2003 | ASIACRYPT | On Diophantine Complexity and Statistical Zero-Knowledge Arguments. | Helger Lipmaa |
| 2003 | ASIACRYPT | Verifiable Homomorphic Oblivious Transfer and Private Equality Test. | Helger Lipmaa |
| 2002 | FC | Secure Vickrey Auctions without Threshold Trust. | Helger Lipmaa, N. Asokan, Valtteri Niemi |
| 2002 | INDOCRYPT | On Differential Properties of Pseudo-Hadamard Transform and Related Mappings. | Helger Lipmaa |
| 2001 | FSE | Efficient Algorithms for Computing Differential Properties of Addition. | Helger Lipmaa, Shiho Moriai |
| 2000 | CCS | Accountable certificate management using undeniable attestations. | Ahto Buldas, Peeter Laud, Helger Lipmaa |
| 2000 | PKC | Optimally Efficient Accountable Time-Stamping. | Ahto Buldas, Helger Lipmaa, Berry Schoenmakers |
| 1998 | CRYPTO | Time-Stamping with Binary Linking Schemes. | Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Willemson |