Helger Lipmaa

H. Lipmaa, J. Siim and M. Zając

Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK

Asiacrypt 2022

H. Lipmaa

A Unified Framework for Non-universal SNARKs

Public-Key Cryptography – PKC 2022

B. Abdolmaleki, H. Lipmaa, J. Siim and M. Zajac

On Subversion-Resistant SNARKs

J. Cryptol.

B. Abdolmaleki, H. Lipmaa, J. Siim and M. Zając

On Subversion-Resistant SNARKs

Journal of Cryptology

G. Couteau, H. Lipmaa, R. Parisella and A. T. Ødegaard

Efficient NIZKs for Algebraic Sets

Advances in Cryptology – Asiacrypt 2021

H. Lipmaa and K. Pavlyk

Gentry-Wichs is Tight: a Falsifiable Non-adaptively Sound SNARG

Asiacrypt 2021

T. Krips and H. Lipmaa

More Efficient Shuffle Argument from Unique Factorization

Cryptographers’ Track at the RSA Conference

B. Abdolmaleki, H. Khoshakhlagh and H. Lipmaa

Smooth Zero-Knowledge Hash Functions

Indocrypt 2021

P. Fauzi, H. Lipmaa, Z. Pindado and J. Siim

Somewhere Statistically Binding Commitment Schemes with Applications

FC 2021

P. Fauzi, H. Lipmaa, J. Siim, M. Zajac and A. T. Ødegaard

Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge

Asiacrypt 2021

H. Lipmaa

Key-and-Argument-Updatable QA-NIZKs

International Conference on Security and Cryptography for Networks

B. Abdolmaleki, H. Lipmaa, J. Siim and M. Zając

On QA-NIZK in the BPK Model

PKC 2020

H. Lipmaa and K. Pavlyk

Succinct Functional Commitment for a Large Class of Arithmetic Circuits

ASIACRYPT 2020

B. Abdolmaleki, K. Baghery, H. Lipmaa, J. Siim and M. Zajac

DL-Extractable UC-Commitment Schemes

ACNS 2019

B. Abdolmaleki, K. Baghery, H. Lipmaa, J. Siim and M. Zając

UC-Secure CRS Generation for SNARKs

Africacrypt 2019

A. Kiayias, A. Kuldmaa, H. Lipmaa, J. Siim and T. Zacharias

On the Security Properties of e-Voting Bulletin Boards

SCN 2018

H. Lipmaa

Prover-efficient commit-and-prove zero-knowledge SNARKs

International Journal of Applied Cryptography

H. Lipmaa and K. Pavlyk

A Simpler Rate-Optimal CPIR Protocol

B. Abdolmaleki, K. Baghery, H. Lipmaa and M. Zając

A Subversion-Resistant SNARK

Asiacrypt 2017

P. Fauzi, H. Lipmaa, M. Zając and J. Siim

An Efficient Pairing-Based Shuffle Argument

ASIACRYPT 2017

F. Benhamouda, F. Bourse and H. Lipmaa

CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions

H. Lipmaa

Optimally Sound Sigma Protocols Under DCRA

Lecture Notes in Computer ScienceSecure IT Systems

P. Fauzi, H. Lipmaa and M. Zając

A Shuffle Argument Secure in the Generic Model

International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2016)

P. Fauzi and H. Lipmaa

Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles

Cryptographers’ Track at the RSA Conference (CT-RSA 2016)

H. Lipmaa

Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs

A. Kiayias, N. Leonardos, H. Lipmaa, K. Pavlyk and Q. Tang

Optimal Rate Private Information Retrieval from Homomorphic EncryptionAbstract

Proceedings on Privacy Enhancing Technologies

H. Lipmaa and K. Pavlyk

Analysis and Implementation of an Efficient Ring-LPN Based Commitment Scheme

CANS 2015

A. Kiayias, N. Leonardos, H. Lipmaa, K. Pavlyk and Q. Tang

Communication Optimal Tardos-Based Asymmetric Fingerprinting

CT-RSA 2015

P. Fauzi, H. Lipmaa and B. Zhang

Efficient Non-Interactive Zero Knowledge Arguments for Set Operations

FC 2014: Financial Cryptography and Data Security

P. Fauzi, H. Lipmaa and B. Zhang

Efficient Modular NIZK Arguments from Shift and Product

Cryptology and Network Security (CANS 2013)