Jan Willemson

Dr. Jan Willemson

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 September 2012 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
DBDan Bogdanov
Dan Bogdanov
MNMargus Niitsoo
Margus Niitsoo
TTTomas Toft
Tomas Toft
JWJan Willemson
Jan Willemson

16 June 2022 in Government Information Quarterly
Verified
Journal Article
Open access
PEPiret Ehin
Piret Ehin
MSMihkel Solvak
Mihkel Solvak
JWJan Willemson
Jan Willemson
PVPriit Vinkel
Priit Vinkel

18 December 2014 in International Journal of Information Security
Verified
Journal Article
Open access
PDF file
LKLiina Kamm
Liina Kamm
JWJan Willemson
Jan Willemson
In this paper, we show that it is possible and, indeed, feasible to use secure multiparty computation (SMC) for calculating the probability of a collision between two satellites. For this purpose, we first describe basic floating point arithmetic operators (addition and multiplication) for multiparty computations. The operators are implemented on the \({\textsc {Sharemind}}\) SMC engine. We discuss the implementation details, provide methods for evaluating example elementary functions (inverse, square root, exponentiation of \(e\) , error function). Using these primitives, we implement a satellite conjunction analysis algorithm and give benchmark results for the primitives as well as the conjunction analysis itself.

13 August 2015
Verified
Book Chapter
Closed access
PDF file
SHSven Heiberg
Sven Heiberg
APArnis Parsovs
Arnis Parsovs
JWJan Willemson
Jan Willemson

24 September 2019
Verified
Book Chapter
Closed access
PDF file
KKKristjan Krips
Kristjan Krips
JWJan Willemson
Jan Willemson

26 November 2024 in Journal of Cryptology
Verified
Journal Article
Open access
PDF file
VFValeh Farzaliyev
Valeh Farzaliyev
CPCalvin Pärn
Calvin Pärn
HSHeleen Saarse
Heleen Saarse
JWJan Willemson
Jan Willemson
This paper studies several building blocks needed for electronic voting in order to prepare for the post-quantum era. In particular, we present lattice-based constructions for a generic zero-knowledge (ZK) proof of ballot correctness, a ZK proof of ballot correctness applicable for the homomorphic tallying scenario, and a ZK proof to achieve cast-as-intended verification during the vote casting period. We implement and benchmark our ballot correctness proofs, giving concrete estimations comparing the performance of homomorphic tallying and mix-net based e-voting systems in case of our lattice-based constructions.