Time-Stamping with Binary Linking Schemes. - Ahto Buldas; Peeter Laud; Helger Lipmaa; Jan Willemson (CRYPTO, 1998)

IDEA: A Cipher For Multimedia Architectures? - Helger Lipmaa (Selected Areas in Cryptography, 1998)

Fast Implementations of AES Candidates. - Kazumaro Aoki; Helger Lipmaa (AES Candidate Conference, 2000)

Optimally Efficient Accountable Time-Stamping. - Ahto Buldas; Helger Lipmaa; Berry Schoenmakers (Public Key Cryptography, 2000)

Accountable Certificate Management using Undeniable Attestations. - Ahto Buldas; Peeter Laud; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2000)

Statistical Zero-Knowledge Proofs from Diophantine Equations. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2001)

Secure Vickrey Auctions without Threshold Trust. - Helger Lipmaa; N. Asokan; Valtteri Niemi (IACR Cryptol. ePrint Arch., 2001)

Efficient Algorithms for Computing Differential Properties of Addition. - Helger Lipmaa; Shiho Moriai (IACR Cryptol. ePrint Arch., 2001)

On Differential Properties of Pseudo-Hadamard Transform and Related Mappings. - Helger Lipmaa (INDOCRYPT, 2002)

Fast Software Implementations of SC2000. - Helger Lipmaa (ISC, 2002)

On Optimal Hash Tree Traversal for Interval Time-Stamping. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2002)

Eliminating Counterevidence with Applications to Accountable Certificate Management. - Ahto Buldas; Peeter Laud; Helger Lipmaa (J. Comput. Secur., 2002)

Verifiable Homomorphic Oblivious Transfer and Private Equality Test. - Helger Lipmaa (ASIACRYPT, 2003)

Cryptographic Randomized Response Techniques. - Andris Ambainis; Markus Jakobsson; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2003)

Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. - Edith Elkind; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2003)

On Diophantine Complexity and Statistical Zero-Knowledge Arguments. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2003)

On the Additive Differential Probability of Exclusive-Or. - Helger Lipmaa; Johan Wallén; Philippe Dumas 001 (FSE, 2004)

On Private Scalar Product Computation for Privacy-Preserving Data Mining. - Bart Goethals; Sven Laur; Helger Lipmaa; Taneli Mielikäinen (ICISC, 2004)

An Oblivious Transfer Protocol with Log-Squared Communication. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2004)

Small Coalitions Cannot Manipulate Voting. - Edith Elkind; Helger Lipmaa (Financial Cryptography, 2005)

Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction. - Helger Lipmaa; Guilin Wang; Feng Bao 001 (ICALP, 2005)

Private Itemset Support Counting. - Sven Laur; Helger Lipmaa; Taneli Mielikäinen (ICICS, 2005)

On Delegatability of Four Designated Verifier Signatures. - Yong Li 002; Helger Lipmaa; Dingyi Pei (ICICS, 2005)

Hybrid Voting Protocols and Hardness of Manipulation. - Edith Elkind; Helger Lipmaa (ISAAC, 2005)

A New Protocol for Conditional Disclosure of Secrets And Its Applications. - Sven Laur; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2005)

SLC: Efficient Authenticated Encryption for Short Packages. - Ammar Alkassar; Elena Andreeva 001; Helger Lipmaa (Sicherheit, 2006)

Black-Box Knowledge Extraction Revisited: Universal Approach with Precise Bounds. - Emilia Käsper; Sven Laur; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2006)

On the Feasibility of Consistent Computations. - Sven Laur; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2006)

Cryptographically Private Support Vector Machines. - Sven Laur; Helger Lipmaa; Taneli Mielikäinen (IACR Cryptol. ePrint Arch., 2006)

Asymptotic Behaviour of a Non-commutative Rational Series with a Nonnegative Linear Representation. - Philippe Dumas 001; Helger Lipmaa; Johan Wallén (Discret. Math. Theor. Comput. Sci., 2007)

New Communication-Efficient Oblivious Transfer Protocols Based on Pairings. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2007)

Hybrid Damgård Is CCA1-Secure under the DDH Assumption. - Yvo Desmedt; Helger Lipmaa; Duong Hieu Phan (CANS, 2008)

Succinct NP Proofs from an Extractability Assumption. - Giovanni Di Crescenzo; Helger Lipmaa (CiE, 2008)

3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge. - Giovanni Di Crescenzo; Helger Lipmaa (ISAAC, 2008)

Private Branching Programs: On Communication-Efficient Cryptocomputing. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2008)

On the CCA1-Security of Elgamal and Damgård's Elgamal. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2008)

Efficient Generalized Selective Private Function Evaluation with Applications in Biometric Authentication. - Helger Lipmaa; Bingsheng Zhang (Inscrypt, 2009)

Security and Trust for the Norwegian E-Voting Pilot Project E-valg 2011. - Arne Ansper; Sven Heiberg; Helger Lipmaa; Tom André Øverland; Filip van Laenen (NordSec, 2009)

Additive Combinatorics and Discrete Logarithm Based Range Protocols. - Rafik Chaabouni; Helger Lipmaa; Abhi Shelat (IACR Cryptol. ePrint Arch., 2009)

First CPIR Protocol with Data-Dependent Computation. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2009)

Two New Efficient PIR-Writing Protocols. - Helger Lipmaa; Bingsheng Zhang (ACNS, 2010)

Multi-query Computationally-Private Information Retrieval with Constant Communication Rate. - Jens Groth; Aggelos Kiayias; Helger Lipmaa (Public Key Cryptography, 2010)

On E-Vote Integrity in the Case of Malicious Voter Computers. - Sven Heiberg; Helger Lipmaa; Filip van Laenen (IACR Cryptol. ePrint Arch., 2010)

Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2011)

Two Simple Code-Verification Voting Protocols. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2011)

Secure Accumulators from Euclidean Rings without Trusted Setup. - Helger Lipmaa (ACNS, 2012)

A Non-interactive Range Proof with Constant Communication. - Rafik Chaabouni; Helger Lipmaa; Bingsheng Zhang (Financial Cryptography, 2012)

New Non-Interactive Zero-Knowledge Subset Sum, Decision Knapsack And Range Arguments. - Helger Lipmaa; Bingsheng Zhang (IACR Cryptol. ePrint Arch., 2012)

Efficient Modular NIZK Arguments from Shift and Product. - Prastudy Fauzi; Helger Lipmaa; Bingsheng Zhang (CANS, 2013)

Practical Fully Simulatable Oblivious Transfer with Sublinear Communication. - Bingsheng Zhang; Helger Lipmaa; Cong Wang 001; Kui Ren 001 (Financial Cryptography, 2013)

Secure Equality and Greater-Than Tests with Sublinear Online Complexity. - Helger Lipmaa; Tomas Toft (ICALP (2), 2013)

Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2013)

A more efficient computationally sound non-interactive zero-knowledge shuffle argument. - Helger Lipmaa; Bingsheng Zhang (J. Comput. Secur., 2013)

Linear Batch Codes. - Helger Lipmaa; Vitaly Skachek (ICMCTA, 2014)

Efficient NIZK Arguments via Parallel Verification of Benes Networks. - Helger Lipmaa (SCN, 2014)

Efficient Non-Interactive Zero Knowledge Arguments for Set Operations. - Prastudy Fauzi; Helger Lipmaa; Bingsheng Zhang (IACR Cryptol. ePrint Arch., 2014)

Near Optimal Rate Homomorphic Encryption for Branching Programs. - Aggelos Kiayias; Nikos Leonardos; Helger Lipmaa; Kateryna Pavlyk; Qiang Tang 005 (IACR Cryptol. ePrint Arch., 2014)

A Simple Cast-as-Intended E-Voting Protocol by Using Secure Smart Cards. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2014)

Almost Optimal Short Adaptive Non-Interactive Zero Knowledge. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2014)

Analysis and Implementation of an Efficient Ring-LPN Based Commitment Scheme. - Helger Lipmaa; Kateryna Pavlyk (CANS, 2015)

Communication Optimal Tardos-Based Asymmetric Fingerprinting. - Aggelos Kiayias; Nikos Leonardos; Helger Lipmaa; Kateryna Pavlyk; Qiang Tang 005 (CT-RSA, 2015)

Efficient Culpably Sound NIZK Shuffle Argument without Random Oracles. - Prastudy Fauzi; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2015)

Optimal Rate Private Information Retrieval from Homomorphic Encryption. - Aggelos Kiayias; Nikos Leonardos; Helger Lipmaa; Kateryna Pavlyk; Qiang Tang 005 (Proc. Priv. Enhancing Technol., 2015)

A Shuffle Argument Secure in the Generic Model. - Prastudy Fauzi; Helger Lipmaa; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2016)

Valiant's Universal Circuit: Improvements, Implementation, and Applications. - Helger Lipmaa; Payman Mohassel; Seyed Saeed Sadeghian (IACR Cryptol. ePrint Arch., 2016)

A Subversion-Resistant SNARK. - Behzad Abdolmaleki; Karim Baghery; Helger Lipmaa; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2017)

CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions. - Fabrice Benhamouda; Florian Bourse; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2017)

An Efficient Pairing-Based Shuffle Argument. - Prastudy Fauzi; Helger Lipmaa; Janno Siim; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2017)

Optimally Sound Sigma Protocols Under DCRA. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2017)

A Simpler Rate-Optimal CPIR Protocol. - Helger Lipmaa; Kateryna Pavlyk (IACR Cryptol. ePrint Arch., 2017)

Prover-efficient commit-and-prove zero-knowledge SNARKs. - Helger Lipmaa (Int. J. Appl. Cryptogr., 2017)

On QA-NIZK in the BPK Model. - Behzad Abdolmaleki; Helger Lipmaa; Janno Siim; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2018)

On the Security Properties of e-Voting Bulletin Boards. - Aggelos Kiayias; Annabell Kuldmaa; Helger Lipmaa; Janno Siim; Thomas Zacharias 001 (IACR Cryptol. ePrint Arch., 2018)

DL-Extractable UC-Commitment Schemes. - Behzad Abdolmaleki; Karim Baghery; Helger Lipmaa; Janno Siim; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2019)

UC-Secure CRS Generation for SNARKs. - Behzad Abdolmaleki; Karim Baghery; Helger Lipmaa; Janno Siim; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2019)

Key-and-Argument-Updatable QA-NIZKs. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2019)

Simple Yet Efficient Knowledge-Sound and Non-Black-Box Any-Simulation-Extractable ZK-SNARKs. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2019)

Somewhere Statistically Binding Commitment Schemes with Applications. - Prastudy Fauzi; Helger Lipmaa; Zaira Pindado; Janno Siim (IACR Cryptol. ePrint Arch., 2020)

Gentry-Wichs is Tight: a Falsifiable Non-adaptively Sound SNARG. - Helger Lipmaa; Kateryna Pavlyk (ASIACRYPT (3), 2021)

Smooth Zero-Knowledge Hash Functions. - Behzad Abdolmaleki; Hamidreza Khoshakhlagh; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2021)

Efficient NIZKs for Algebraic Sets. - Geoffroy Couteau; Helger Lipmaa; Roberto Parisella; Arne Tobias Ødegaard (IACR Cryptol. ePrint Arch., 2021)

Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge. - Prastudy Fauzi; Helger Lipmaa; Janno Siim; Michal Zajac 001; Arne Tobias Ødegaard (IACR Cryptol. ePrint Arch., 2021)

More Efficient Shuffle Argument from Unique Factorization. - Toomas Krips; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2021)

A Unified Framework for Non-Universal SNARKs. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2021)

Succinct Functional Commitment for a Large Class of Arithmetic Circuits. - Helger Lipmaa; Kateryna Pavlyk (IACR Cryptol. ePrint Arch., 2021)

On Subversion-Resistant SNARKs. - Behzad Abdolmaleki; Helger Lipmaa; Janno Siim; Michal Zajac 001 (J. Cryptol., 2021)

Set (Non-)Membership NIZKs from Determinantal Accumulators. - Helger Lipmaa; Roberto Parisella (IACR Cryptol. ePrint Arch., 2022)

Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK. - Helger Lipmaa; Janno Siim; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2022)

Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees. - Matteo Campanelli; Antonio Faonio; Dario Fiore 001; Tianyu Li 002; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2023)

On Black-Box Knowledge-Sound Commit-And-Prove SNARKs. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2023)

Algebraic Group Model with Oblivious Sampling. - Helger Lipmaa; Roberto Parisella; Janno Siim (IACR Cryptol. ePrint Arch., 2023)

Polymath: Groth16 Is Not The Limit. - Helger Lipmaa (IACR Cryptol. ePrint Arch., 2024)

Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions. - Helger Lipmaa; Roberto Parisella; Janno Siim (IACR Cryptol. ePrint Arch., 2024)

On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions. - Helger Lipmaa; Roberto Parisella; Janno Siim (IACR Cryptol. ePrint Arch., 2024)