Helger Lipmaa

153 papers A* 6A 3B 14C 7Misc 12Journal 69Unranked 40
YearRankTypeTitle / Venue / Authors
2026 J jnl
Cyclo: Lightweight Lattice-based Folding via Partial Range Checks.
IACR Cryptol. ePrint Arch.
Albert Garreta, Helger Lipmaa, Urmas Luhaäär, Michal Osadnik
2026 J jnl
Special Soundness and Binding Properties: A Framework for Tightly Secure zk-SNARKs.
IACR Cryptol. ePrint Arch.
Erki Külaots, Helger Lipmaa, Roberto Parisella, Janno Siim
2025 — conf
On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions.
CRYPTO (7)
Helger Lipmaa, Roberto Parisella, Janno Siim
2025 — conf
Plonk is Simulation Extractable in ROM Under Falsifiable Assumptions.
TCC (4)
Helger Lipmaa
2025 J jnl
Plonk is Simulation Extractable in ROM Under Falsifiable Assumptions.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2024 — conf
Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions.
EUROCRYPT (6)
Helger Lipmaa, Roberto Parisella, Janno Siim
2024 J jnl
Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Roberto Parisella, Janno Siim
2024 — conf
Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees.
Public Key Cryptography (2)
Matteo Campanelli, Antonio Faonio, Dario Fiore, Tianyu Li, Helger Lipmaa
2024 J jnl
On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Roberto Parisella, Janno Siim
2024 J jnl
Polymath: Groth16 Is Not The Limit.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2024 — conf
Polymath: Groth16 Is Not the Limit.
CRYPTO (10)
Helger Lipmaa
2023 — conf
Algebraic Group Model with Oblivious Sampling.
TCC (4)
Helger Lipmaa, Roberto Parisella, Janno Siim
2023 J jnl
Algebraic Group Model with Oblivious Sampling.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Roberto Parisella, Janno Siim
2023 J jnl
Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees.
IACR Cryptol. ePrint Arch.
Matteo Campanelli, Antonio Faonio, Dario Fiore, Tianyu Li, Helger Lipmaa
2023 — conf
On Black-Box Knowledge-Sound Commit-And-Prove SNARKs.
ASIACRYPT (2)
Helger Lipmaa
2023 J jnl
On Black-Box Knowledge-Sound Commit-And-Prove SNARKs.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2023 — conf
Set (Non-)Membership NIZKs from Determinantal Accumulators.
LATINCRYPT
Helger Lipmaa, Roberto Parisella
2022 — conf
A Unified Framework for Non-universal SNARKs.
Public Key Cryptography (1)
Helger Lipmaa
2022 — conf
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK.
ASIACRYPT (2)
Helger Lipmaa, Janno Siim, Michal Zajac
2022 J jnl
Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Janno Siim, Michal Zajac
2022 J jnl
Set (Non-)Membership NIZKs from Determinantal Accumulators.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Roberto Parisella
2021 J jnl
A Unified Framework for Non-Universal SNARKs.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2021 — conf
Efficient NIZKs for Algebraic Sets.
ASIACRYPT (3)
Geoffroy Couteau, Helger Lipmaa, Roberto Parisella, Arne Tobias Ødegaard
2021 J jnl
Efficient NIZKs for Algebraic Sets.
IACR Cryptol. ePrint Arch.
Geoffroy Couteau, Helger Lipmaa, Roberto Parisella, Arne Tobias Ødegaard
2021 — conf
Gentry-Wichs is Tight: a Falsifiable Non-adaptively Sound SNARG.
ASIACRYPT (3)
Helger Lipmaa, Kateryna Pavlyk
2021 B conf
More Efficient Shuffle Argument from Unique Factorization.
CT-RSA
Toomas Krips, Helger Lipmaa
2021 J jnl
More Efficient Shuffle Argument from Unique Factorization.
IACR Cryptol. ePrint Arch.
Toomas Krips, Helger Lipmaa
2021 J jnl
On Subversion-Resistant SNARKs.
J. Cryptol.
Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac
2021 Misc conf
Smooth Zero-Knowledge Hash Functions.
INDOCRYPT
Behzad Abdolmaleki, Hamidreza Khoshakhlagh, Helger Lipmaa
2021 J jnl
Smooth Zero-Knowledge Hash Functions.
IACR Cryptol. ePrint Arch.
Behzad Abdolmaleki, Hamidreza Khoshakhlagh, Helger Lipmaa
2021 — conf
Somewhere Statistically Binding Commitment Schemes with Applications.
Financial Cryptography (1)
Prastudy Fauzi, Helger Lipmaa, Zaira Pindado, Janno Siim
2021 J jnl
Succinct Functional Commitment for a Large Class of Arithmetic Circuits.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Kateryna Pavlyk
2021 — conf
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge.
ASIACRYPT (4)
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac, Arne Tobias Ødegaard
2021 J jnl
Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge.
IACR Cryptol. ePrint Arch.
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac, Arne Tobias Ødegaard
2020 Misc conf
Key-and-Argument-Updatable QA-NIZKs.
SCN
Helger Lipmaa
2020 — conf
On QA-NIZK in the BPK Model.
Public Key Cryptography (1)
Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac
2020 J jnl
On Subversion-Resistant SNARKs.
IACR Cryptol. ePrint Arch.
Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac
2020 J jnl
Somewhere Statistically Binding Commitment Schemes with Applications.
IACR Cryptol. ePrint Arch.
Prastudy Fauzi, Helger Lipmaa, Zaira Pindado, Janno Siim
2020 — conf
Succinct Functional Commitment for a Large Class of Arithmetic Circuits.
ASIACRYPT (3)
Helger Lipmaa, Kateryna Pavlyk
2019 B conf
DL-Extractable UC-Commitment Schemes.
ACNS
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac
2019 J jnl
DL-Extractable UC-Commitment Schemes.
IACR Cryptol. ePrint Arch.
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac
2019 J jnl
Key-and-Argument-Updatable QA-NIZKs.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2019 J jnl
Simple Yet Efficient Knowledge-Sound and Non-Black-Box Any-Simulation-Extractable ZK-SNARKs.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2019 — conf
UC-Secure CRS Generation for SNARKs.
AFRICACRYPT
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac
2019 J jnl
UC-Secure CRS Generation for SNARKs.
IACR Cryptol. ePrint Arch.
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Janno Siim, Michal Zajac
2018 J jnl
On QA-NIZK in the BPK Model.
IACR Cryptol. ePrint Arch.
Behzad Abdolmaleki, Helger Lipmaa, Janno Siim, Michal Zajac
2018 Misc conf
On the Security Properties of e-Voting Bulletin Boards.
SCN
Aggelos Kiayias, Annabell Kuldmaa, Helger Lipmaa, Janno Siim, Thomas Zacharias
2018 J jnl
On the Security Properties of e-Voting Bulletin Boards.
IACR Cryptol. ePrint Arch.
Aggelos Kiayias, Annabell Kuldmaa, Helger Lipmaa, Janno Siim, Thomas Zacharias
2017 — conf
A Simpler Rate-Optimal CPIR Protocol.
Financial Cryptography
Helger Lipmaa, Kateryna Pavlyk
2017 J jnl
A Simpler Rate-Optimal CPIR Protocol.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Kateryna Pavlyk
2017 — conf
A Subversion-Resistant SNARK.
ASIACRYPT (3)
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Michal Zajac
2017 J jnl
A Subversion-Resistant SNARK.
IACR Cryptol. ePrint Arch.
Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, Michal Zajac
2017 — conf
An Efficient Pairing-Based Shuffle Argument.
ASIACRYPT (2)
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac
2017 J jnl
An Efficient Pairing-Based Shuffle Argument.
IACR Cryptol. ePrint Arch.
Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac
2017 — conf
CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions.
Public Key Cryptography (2)
Fabrice Benhamouda, Florian Bourse, Helger Lipmaa
2017 J jnl
CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions.
IACR Cryptol. ePrint Arch.
Fabrice Benhamouda, Florian Bourse, Helger Lipmaa
2017 — conf
Optimally Sound Sigma Protocols Under DCRA.
Financial Cryptography
Helger Lipmaa
2017 J jnl
Optimally Sound Sigma Protocols Under DCRA.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2017 J jnl
Prover-efficient commit-and-prove zero-knowledge SNARKs.
Int. J. Appl. Cryptogr.
Helger Lipmaa
2017 — ed.
Secure IT Systems - 22nd Nordic Conference, NordSec 2017, Tartu, Estonia, November 8-10, 2017, Proceedings
NordSec
Helger Lipmaa, Aikaterini Mitrokotsa, Raimundas Matulevicius
2016 — conf
A Shuffle Argument Secure in the Generic Model.
ASIACRYPT (2)
Prastudy Fauzi, Helger Lipmaa, Michal Zajac
2016 J jnl
A Shuffle Argument Secure in the Generic Model.
IACR Cryptol. ePrint Arch.
Prastudy Fauzi, Helger Lipmaa, Michal Zajac
2016 B conf
Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles.
CT-RSA
Prastudy Fauzi, Helger Lipmaa
2016 — conf
Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs.
AFRICACRYPT
Helger Lipmaa
2016 J jnl
Valiant's Universal Circuit: Improvements, Implementation, and Applications.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Payman Mohassel, Seyed Saeed Sadeghian
2015 B conf
Analysis and Implementation of an Efficient Ring-LPN Based Commitment Scheme.
CANS
Helger Lipmaa, Kateryna Pavlyk
2015 B conf
Communication Optimal Tardos-Based Asymmetric Fingerprinting.
CT-RSA
Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang
2015 J jnl
Efficient Culpably Sound NIZK Shuffle Argument without Random Oracles.
IACR Cryptol. ePrint Arch.
Prastudy Fauzi, Helger Lipmaa
2015 J jnl
Optimal Rate Private Information Retrieval from Homomorphic Encryption.
Proc. Priv. Enhancing Technol.
Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang
2014 J jnl
A Simple Cast-as-Intended E-Voting Protocol by Using Secure Smart Cards.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2014 J jnl
Almost Optimal Short Adaptive Non-Interactive Zero Knowledge.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2014 Misc conf
Efficient NIZK Arguments via Parallel Verification of Benes Networks.
SCN
Helger Lipmaa
2014 — conf
Efficient Non-Interactive Zero Knowledge Arguments for Set Operations.
Financial Cryptography
Prastudy Fauzi, Helger Lipmaa, Bingsheng Zhang
2014 J jnl
Efficient Non-Interactive Zero Knowledge Arguments for Set Operations.
IACR Cryptol. ePrint Arch.
Prastudy Fauzi, Helger Lipmaa, Bingsheng Zhang
2014 — conf
Linear Batch Codes.
ICMCTA
Helger Lipmaa, Vitaly Skachek
2014 J jnl
Linear Batch Codes.
CoRR
Helger Lipmaa, Vitaly Skachek
2014 J jnl
Near Optimal Rate Homomorphic Encryption for Branching Programs.
IACR Cryptol. ePrint Arch.
Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang
2013 J jnl
A more efficient computationally sound non-interactive zero-knowledge shuffle argument.
J. Comput. Secur.
Helger Lipmaa, Bingsheng Zhang
2013 B conf
Efficient Modular NIZK Arguments from Shift and Product.
CANS
Prastudy Fauzi, Helger Lipmaa, Bingsheng Zhang
2013 — conf
Practical Fully Simulatable Oblivious Transfer with Sublinear Communication.
Financial Cryptography
Bingsheng Zhang, Helger Lipmaa, Cong Wang, Kui Ren
2013 — conf
Secure Equality and Greater-Than Tests with Sublinear Online Complexity.
ICALP (2)
Helger Lipmaa, Tomas Toft
2013 — conf
Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes.
ASIACRYPT (1)
Helger Lipmaa
2013 J jnl
Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2012 Misc conf
A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument.
SCN
Helger Lipmaa, Bingsheng Zhang
2012 — conf
A Non-interactive Range Proof with Constant Communication.
Financial Cryptography
Rafik Chaabouni, Helger Lipmaa, Bingsheng Zhang
2012 — ed.
E-Voting and Identity - Third International Conference, VoteID 2011, Tallinn, Estonia, September 28-30, 2011, Revised Selected Papers
VoteID
Aggelos Kiayias, Helger Lipmaa
2012 J jnl
New Non-Interactive Zero-Knowledge Subset Sum, Decision Knapsack And Range Arguments.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Bingsheng Zhang
2012 B conf
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments.
TCC
Helger Lipmaa
2012 B conf
Secure Accumulators from Euclidean Rings without Trusted Setup.
ACNS
Helger Lipmaa
2011 J jnl
A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Bingsheng Zhang
2011 J jnl
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2011 J jnl
Two Simple Code-Verification Voting Protocols.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2010 Misc conf
Additive Combinatorics and Discrete Logarithm Based Range Protocols.
ACISP
Rafik Chaabouni, Helger Lipmaa, Abhi Shelat
2010 — conf
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate.
Public Key Cryptography
Jens Groth, Aggelos Kiayias, Helger Lipmaa
2010 A conf
On E-Vote Integrity in the Case of Malicious Voter Computers.
ESORICS
Sven Heiberg, Helger Lipmaa, Filip van Laenen
2010 J jnl
On E-Vote Integrity in the Case of Malicious Voter Computers.
IACR Cryptol. ePrint Arch.
Sven Heiberg, Helger Lipmaa, Filip van Laenen
2010 Misc conf
On the CCA1-Security of Elgamal and Damgård's Elgamal.
Inscrypt
Helger Lipmaa
2010 — conf
On the Feasibility of Consistent Computations.
Public Key Cryptography
Sven Laur, Helger Lipmaa
2010 B conf
Two New Efficient PIR-Writing Protocols.
ACNS
Helger Lipmaa, Bingsheng Zhang
2009 J jnl
Additive Combinatorics and Discrete Logarithm Based Range Protocols.
IACR Cryptol. ePrint Arch.
Rafik Chaabouni, Helger Lipmaa, Abhi Shelat
2009 Misc conf
Efficient Generalized Selective Private Function Evaluation with Applications in Biometric Authentication.
Inscrypt
Helger Lipmaa, Bingsheng Zhang
2009 Misc conf
First CPIR Protocol with Data-Dependent Computation.
ICISC
Helger Lipmaa
2009 J jnl
First CPIR Protocol with Data-Dependent Computation.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2009 — conf
Security and Trust for the Norwegian E-Voting Pilot Project
NordSec
Arne Ansper, Sven Heiberg, Helger Lipmaa, Tom André Øverland, Filip van Laenen
2008 B conf
3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge.
ISAAC
Giovanni Di Crescenzo, Helger Lipmaa
2008 B conf
Hybrid Damgård Is CCA1-Secure under the DDH Assumption.
CANS
Yvo Desmedt, Helger Lipmaa, Duong Hieu Phan
2008 C conf
New Communication-Efficient Oblivious Transfer Protocols Based on Pairings.
ISC
Helger Lipmaa
2008 J jnl
On the CCA1-Security of Elgamal and Damgård's Elgamal.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2008 J jnl
Private Branching Programs: On Communication-Efficient Cryptocomputing.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2008 C conf
Succinct NP Proofs from an Extractability Assumption.
CiE
Giovanni Di Crescenzo, Helger Lipmaa
2007 B conf
A New Protocol for Conditional Disclosure of Secrets and Its Applications.
ACNS
Sven Laur, Helger Lipmaa
2007 J jnl
Asymptotic Behaviour of a Non-commutative Rational Series with a Nonnegative Linear Representation.
Discret. Math. Theor. Comput. Sci.
Philippe Dumas, Helger Lipmaa, Johan Wallén
2007 J jnl
New Communication-Efficient Oblivious Transfer Protocols Based on Pairings.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2006 J jnl
Black-Box Knowledge Extraction Revisited: Universal Approach with Precise Bounds.
IACR Cryptol. ePrint Arch.
Emilia Käsper, Sven Laur, Helger Lipmaa
2006 J jnl
Cryptographically Private Support Vector Machines.
IACR Cryptol. ePrint Arch.
Sven Laur, Helger Lipmaa, Taneli Mielikäinen
2006 A* conf
Cryptographically private support vector machines.
KDD
Sven Laur, Helger Lipmaa, Taneli Mielikäinen
2006 Misc ed.
Information Security and Cryptology, Second SKLOIS Conference, Inscrypt 2006, Beijing, China, November 29 - December 1, 2006, Proceedings
Inscrypt
Helger Lipmaa, Moti Yung, Dongdai Lin
2006 J jnl
On the Feasibility of Consistent Computations.
IACR Cryptol. ePrint Arch.
Sven Laur, Helger Lipmaa
2006 — conf
SLC: Efficient Authenticated Encryption for Short Packages.
Sicherheit
Ammar Alkassar, Elena Andreeva, Helger Lipmaa
2005 J jnl
A New Protocol for Conditional Disclosure of Secrets And Its Applications.
IACR Cryptol. ePrint Arch.
Sven Laur, Helger Lipmaa
2005 C conf
An Oblivious Transfer Protocol with Log-Squared Communication.
ISC
Helger Lipmaa
2005 A* conf
Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction.
ICALP
Helger Lipmaa, Guilin Wang, Feng Bao
2005 B conf
Hybrid Voting Protocols and Hardness of Manipulation.
ISAAC
Edith Elkind, Helger Lipmaa
2005 C conf
On Delegatability of Four Designated Verifier Signatures.
ICICS
Yong Li, Helger Lipmaa, Dingyi Pei
2005 C conf
Private Itemset Support Counting.
ICICS
Sven Laur, Helger Lipmaa, Taneli Mielikäinen
2005 — conf
Small Coalitions Cannot Manipulate Voting.
Financial Cryptography
Edith Elkind, Helger Lipmaa
2004 J jnl
An Oblivious Transfer Protocol with Log-Squared Communication.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2004 — conf
Cryptographic Randomized Response Techniques.
Public Key Cryptography
Andris Ambainis, Markus Jakobsson, Helger Lipmaa
2004 — conf
Interleaving Cryptography and Mechanism Design: The Case of Online Auctions.
Financial Cryptography
Edith Elkind, Helger Lipmaa
2004 Misc conf
On Private Scalar Product Computation for Privacy-Preserving Data Mining.
ICISC
Bart Goethals, Sven Laur, Helger Lipmaa, Taneli Mielikäinen
2004 A* conf
On the Additive Differential Probability of Exclusive-Or.
FSE
Helger Lipmaa, Johan Wallén, Philippe Dumas
2003 J jnl
Cryptographic Randomized Response Techniques
CoRR
Andris Ambainis, Markus Jakobsson, Helger Lipmaa
2003 J jnl
Cryptographic Randomized Response Techniques.
IACR Cryptol. ePrint Arch.
Andris Ambainis, Markus Jakobsson, Helger Lipmaa
2003 J jnl
Interleaving Cryptography and Mechanism Design: The Case of Online Auctions.
IACR Cryptol. ePrint Arch.
Edith Elkind, Helger Lipmaa
2003 A conf
On Diophantine Complexity and Statistical Zero-Knowledge Arguments.
ASIACRYPT
Helger Lipmaa
2003 J jnl
On Diophantine Complexity and Statistical Zero-Knowledge Arguments.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2003 A conf
Verifiable Homomorphic Oblivious Transfer and Private Equality Test.
ASIACRYPT
Helger Lipmaa
2002 J jnl
Eliminating Counterevidence with Applications to Accountable Certificate Management.
J. Comput. Secur.
Ahto Buldas, Peeter Laud, Helger Lipmaa
2002 C conf
Fast Software Implementations of SC2000.
ISC
Helger Lipmaa
2002 Misc conf
On Differential Properties of Pseudo-Hadamard Transform and Related Mappings.
INDOCRYPT
Helger Lipmaa
2002 C conf
On Optimal Hash Tree Traversal for Interval Time-Stamping.
ISC
Helger Lipmaa
2002 J jnl
On Optimal Hash Tree Traversal for Interval Time-Stamping.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2002 — conf
Secure Vickrey Auctions without Threshold Trust.
Financial Cryptography
Helger Lipmaa, N. Asokan, Valtteri Niemi
2001 A* conf
Efficient Algorithms for Computing Differential Properties of Addition.
FSE
Helger Lipmaa, Shiho Moriai
2001 J jnl
Efficient Algorithms for Computing Differential Properties of Addition.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, Shiho Moriai
2001 J jnl
Secure Vickrey Auctions without Threshold Trust.
IACR Cryptol. ePrint Arch.
Helger Lipmaa, N. Asokan, Valtteri Niemi
2001 J jnl
Statistical Zero-Knowledge Proofs from Diophantine Equations.
IACR Cryptol. ePrint Arch.
Helger Lipmaa
2000 J jnl
Accountable Certificate Management using Undeniable Attestations.
IACR Cryptol. ePrint Arch.
Ahto Buldas, Peeter Laud, Helger Lipmaa
2000 A* conf
Accountable certificate management using undeniable attestations.
CCS
Ahto Buldas, Peeter Laud, Helger Lipmaa
2000 — conf
Fast Implementations of AES Candidates.
AES Candidate Conference
Kazumaro Aoki, Helger Lipmaa
2000 — conf
Optimally Efficient Accountable Time-Stamping.
Public Key Cryptography
Ahto Buldas, Helger Lipmaa, Berry Schoenmakers
1998 B conf
IDEA: A Cipher For Multimedia Architectures?
Selected Areas in Cryptography
Helger Lipmaa
1998 A* conf
Time-Stamping with Binary Linking Schemes.
CRYPTO
Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Willemson