Helger Lipmaa

University of Tartu — EE

Computer Science · Physical Sciences

32h-index4.1kcitations154works7.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(105), Complexity and Algorithms in Graphs(40), Cryptographic Implementations and Security(37), Internet Traffic Analysis and Secure E-voting(27), Privacy-Preserving Technologies in Data(20)

Publications154 total

Plonk is Simulation Extractable in ROM Under Falsifiable Assumptions
Lecture notes in computer science·2025Open Access
Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees
Lecture notes in computer science·2024· 11 citedOpen Access
Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions
Lecture notes in computer science·2024· 8 cited
Polymath: Groth16 Is Not the Limit
Lecture notes in computer science·2024· 9 cited
Algebraic Group Model with Oblivious Sampling
Lecture notes in computer science·2023· 14 citedOpen Access
Set (Non-)Membership NIZKs from Determinantal Accumulators
Lecture notes in computer science·2023· 1 cited
On Black-Box Knowledge-Sound Commit-And-Prove SNARKs
Lecture notes in computer science·2023· 3 citedOpen Access
A Unified Framework for Non-universal SNARKs
Lecture notes in computer science·2022· 11 cited
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK
Lecture notes in computer science·2022· 15 cited
Efficient NIZKs for Algebraic Sets
HAL (Le Centre pour la Communication Scientifique Directe)·2021Open Access
On Subversion-Resistant SNARKs
Journal of Cryptology·2021· 1 cited
Somewhere Statistically Binding Commitment Schemes with Applications
Lecture notes in computer science·2021
Smooth Zero-Knowledge Hash Functions
Lecture notes in computer science·2021· 1 cited
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
Lecture notes in computer science·2021· 2 cited
More Efficient Shuffle Argument from Unique Factorization
Lecture notes in computer science·2021
More Efficient Shuffle Argument from Unique Factorization
IACR Cryptology ePrint Archive·2021
Efficient NIZKs for Algebraic Sets
Lecture notes in computer science·2021· 4 cited
Succinct Functional Commitment for a Large Class of Arithmetic Circuits.
IACR Cryptology ePrint Archive·2021
Gentry-Wichs is Tight: a Falsifiable Non-adaptively Sound SNARG
Lecture notes in computer science·2021· 5 cited
Key-and-Argument-Updatable QA-NIZKs
Lecture notes in computer science·2020· 5 cited
page 1 of 8Next →

Frequent Co-authors

Sven Laur(5), Ahto Buldas(4), Michał Zając(4), Taneli Mielikäinen(3), Aggelos Kiayias(3), Peeter Laud(3), Prastudy Fauzi(3), Janno Siim(3), Edith Elkind(2), Behzad Abdolmaleki(2), Rafik Chaabouni(2), Bingsheng Zhang(2), Kateryna Pavlyk(2), Bart Goethals(1), Jens Groth(1), N. Asokan(1), Valtteri Niemi(1), Phillip Rogaway(1), David Wagner(1), Guilin Wang(1)