Helger Lipmaa

Orcid: 0000-0001-8393-6821

Affiliations:
  • Simula UiB, Bergen, Norway
  • University of Tartu, Estonia (former)


According to our database1, Helger Lipmaa authored at least 94 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions.
IACR Cryptol. ePrint Arch., 2024

Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions.
IACR Cryptol. ePrint Arch., 2024

Polymath: Groth16 Is Not The Limit.
IACR Cryptol. ePrint Arch., 2024

2023
Algebraic Group Model with Oblivious Sampling.
IACR Cryptol. ePrint Arch., 2023

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

Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees.
IACR Cryptol. ePrint Arch., 2023

2022
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK.
IACR Cryptol. ePrint Arch., 2022

Set (Non-)Membership NIZKs from Determinantal Accumulators.
IACR Cryptol. ePrint Arch., 2022

2021
On Subversion-Resistant SNARKs.
J. Cryptol., 2021

Succinct Functional Commitment for a Large Class of Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2021

A Unified Framework for Non-Universal SNARKs.
IACR Cryptol. ePrint Arch., 2021

More Efficient Shuffle Argument from Unique Factorization.
IACR Cryptol. ePrint Arch., 2021

Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2021

Efficient NIZKs for Algebraic Sets.
IACR Cryptol. ePrint Arch., 2021

Smooth Zero-Knowledge Hash Functions.
IACR Cryptol. ePrint Arch., 2021

Gentry-Wichs is Tight: a Falsifiable Non-adaptively Sound SNARG.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Somewhere Statistically Binding Commitment Schemes with Applications.
IACR Cryptol. ePrint Arch., 2020

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

Key-and-Argument-Updatable QA-NIZKs.
IACR Cryptol. ePrint Arch., 2019

UC-Secure CRS Generation for SNARKs.
IACR Cryptol. ePrint Arch., 2019

DL-Extractable UC-Commitment Schemes.
IACR Cryptol. ePrint Arch., 2019

2018
On the Security Properties of e-Voting Bulletin Boards.
IACR Cryptol. ePrint Arch., 2018

On QA-NIZK in the BPK Model.
IACR Cryptol. ePrint Arch., 2018

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

A Simpler Rate-Optimal CPIR Protocol.
IACR Cryptol. ePrint Arch., 2017

Optimally Sound Sigma Protocols Under DCRA.
IACR Cryptol. ePrint Arch., 2017

An Efficient Pairing-Based Shuffle Argument.
IACR Cryptol. ePrint Arch., 2017

CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions.
IACR Cryptol. ePrint Arch., 2017

A Subversion-Resistant SNARK.
IACR Cryptol. ePrint Arch., 2017

2016
Valiant's Universal Circuit: Improvements, Implementation, and Applications.
IACR Cryptol. ePrint Arch., 2016

A Shuffle Argument Secure in the Generic Model.
IACR Cryptol. ePrint Arch., 2016

2015
Optimal Rate Private Information Retrieval from Homomorphic Encryption.
Proc. Priv. Enhancing Technol., 2015

Efficient Culpably Sound NIZK Shuffle Argument without Random Oracles.
IACR Cryptol. ePrint Arch., 2015

Communication Optimal Tardos-Based Asymmetric Fingerprinting.
Proceedings of the Topics in Cryptology, 2015

Analysis and Implementation of an Efficient Ring-LPN Based Commitment Scheme.
Proceedings of the Cryptology and Network Security - 14th International Conference, 2015

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

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

Near Optimal Rate Homomorphic Encryption for Branching Programs.
IACR Cryptol. ePrint Arch., 2014

Efficient Non-Interactive Zero Knowledge Arguments for Set Operations.
IACR Cryptol. ePrint Arch., 2014

Efficient NIZK Arguments via Parallel Verification of Benes Networks.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Linear Batch Codes.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2013
A more efficient computationally sound non-interactive zero-knowledge shuffle argument.
J. Comput. Secur., 2013

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

Secure Equality and Greater-Than Tests with Sublinear Online Complexity.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Practical Fully Simulatable Oblivious Transfer with Sublinear Communication.
Proceedings of the Financial Cryptography and Data Security, 2013

Efficient Modular NIZK Arguments from Shift and Product.
Proceedings of the Cryptology and Network Security - 12th International Conference, 2013

2012
New Non-Interactive Zero-Knowledge Subset Sum, Decision Knapsack And Range Arguments.
IACR Cryptol. ePrint Arch., 2012

A Non-interactive Range Proof with Constant Communication.
Proceedings of the Financial Cryptography and Data Security, 2012

Secure Accumulators from Euclidean Rings without Trusted Setup.
Proceedings of the Applied Cryptography and Network Security, 2012

2011
Two Simple Code-Verification Voting Protocols.
IACR Cryptol. ePrint Arch., 2011

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

2010
On E-Vote Integrity in the Case of Malicious Voter Computers.
IACR Cryptol. ePrint Arch., 2010

Multi-query Computationally-Private Information Retrieval with Constant Communication Rate.
Proceedings of the Public Key Cryptography, 2010

Two New Efficient PIR-Writing Protocols.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
First CPIR Protocol with Data-Dependent Computation.
IACR Cryptol. ePrint Arch., 2009

Additive Combinatorics and Discrete Logarithm Based Range Protocols.
IACR Cryptol. ePrint Arch., 2009

Security and Trust for the Norwegian E-Voting Pilot Project <i>E-valg 2011</i>.
Proceedings of the Identity and Privacy in the Internet Age, 2009

Efficient Generalized Selective Private Function Evaluation with Applications in Biometric Authentication.
Proceedings of the Information Security and Cryptology - 5th International Conference, 2009

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

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

3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Succinct NP Proofs from an Extractability Assumption.
Proceedings of the Logic and Theory of Algorithms, 2008

Hybrid Damgård Is CCA1-Secure under the DDH Assumption.
Proceedings of the Cryptology and Network Security, 7th International Conference, 2008

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

Asymptotic Behaviour of a Non-commutative Rational Series with a Nonnegative Linear Representation.
Discret. Math. Theor. Comput. Sci., 2007

2006
Cryptographically Private Support Vector Machines.
IACR Cryptol. ePrint Arch., 2006

On the Feasibility of Consistent Computations.
IACR Cryptol. ePrint Arch., 2006

Black-Box Knowledge Extraction Revisited: Universal Approach with Precise Bounds.
IACR Cryptol. ePrint Arch., 2006

SLC: Efficient Authenticated Encryption for Short Packages.
Proceedings of the Sicherheit 2006: Sicherheit, 2006

2005
A New Protocol for Conditional Disclosure of Secrets And Its Applications.
IACR Cryptol. ePrint Arch., 2005

Hybrid Voting Protocols and Hardness of Manipulation.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

On Delegatability of Four Designated Verifier Signatures.
Proceedings of the Information and Communications Security, 7th International Conference, 2005

Private Itemset Support Counting.
Proceedings of the Information and Communications Security, 7th International Conference, 2005

Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Small Coalitions Cannot Manipulate Voting.
Proceedings of the Financial Cryptography and Data Security, 2005

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

On Private Scalar Product Computation for Privacy-Preserving Data Mining.
Proceedings of the Information Security and Cryptology, 2004

On the Additive Differential Probability of Exclusive-Or.
Proceedings of the Fast Software Encryption, 11th International Workshop, 2004

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

Interleaving Cryptography and Mechanism Design: The Case of Online Auctions.
IACR Cryptol. ePrint Arch., 2003

Cryptographic Randomized Response Techniques.
IACR Cryptol. ePrint Arch., 2003

Verifiable Homomorphic Oblivious Transfer and Private Equality Test.
Proceedings of the Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30, 2003

2002
Eliminating Counterevidence with Applications to Accountable Certificate Management.
J. Comput. Secur., 2002

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

Fast Software Implementations of SC2000.
Proceedings of the Information Security, 5th International Conference, 2002

On Differential Properties of Pseudo-Hadamard Transform and Related Mappings.
Proceedings of the Progress in Cryptology, 2002

2001
Efficient Algorithms for Computing Differential Properties of Addition.
IACR Cryptol. ePrint Arch., 2001

Secure Vickrey Auctions without Threshold Trust.
IACR Cryptol. ePrint Arch., 2001

Statistical Zero-Knowledge Proofs from Diophantine Equations.
IACR Cryptol. ePrint Arch., 2001

2000
Accountable Certificate Management using Undeniable Attestations.
IACR Cryptol. ePrint Arch., 2000

Optimally Efficient Accountable Time-Stamping.
Proceedings of the Public Key Cryptography, 2000

Fast Implementations of AES Candidates.
Proceedings of the Third Advanced Encryption Standard Candidate Conference, 2000

1998
IDEA: A Cipher For Multimedia Architectures?
Proceedings of the Selected Areas in Cryptography '98, 1998

Time-Stamping with Binary Linking Schemes.
Proceedings of the Advances in Cryptology, 1998


  Loading...