Efficient pseudorandom correlation generators: Silent OT extension and more
Secure multiparty computation (MPC) often relies on correlated randomness for better
efficiency and simplicity. This is particularly useful for MPC with no honest majority, where …
efficiency and simplicity. This is particularly useful for MPC with no honest majority, where …
Efficient two-round OT extension and silent non-interactive secure computation
We consider the problem of securely generating useful instances of two-party correlations,
such as many independent copies of a random oblivious transfer (OT) correlation, using a …
such as many independent copies of a random oblivious transfer (OT) correlation, using a …
Optimizing bike for the intel haswell and arm cortex-m4
BIKE is a key encapsulation mechanism that entered the third round of the NIST post-
quantum cryptography standardization process. This paper presents two constant-time …
quantum cryptography standardization process. This paper presents two constant-time …
Non-interactive secure computation of inner-product from lpn and lwe
G Couteau, M Zarezadeh - International Conference on the Theory and …, 2022 - Springer
We put forth a new cryptographic primitive for securely computing inner-products in a
scalable, non-interactive fashion: any party can broadcast a public (computationally hiding) …
scalable, non-interactive fashion: any party can broadcast a public (computationally hiding) …
Fast transforms over finite fields of characteristic two
N Coxon - Journal of Symbolic Computation, 2021 - Elsevier
We describe new fast algorithms for evaluation and interpolation on the “novel” polynomial
basis over finite fields of characteristic two introduced by Lin et al.(2014). Fast algorithms are …
basis over finite fields of characteristic two introduced by Lin et al.(2014). Fast algorithms are …
Side-channel security for post-quantum cryptography
M Krausz - 2024 - hss-opus.ub.ruhr-unibochum.de
Post-quantum cryptography addresses the threat to our established asymmetric
cryptography posed by quantum computers. Like conventional cryptography …
cryptography posed by quantum computers. Like conventional cryptography …
Improved method for finding optimal formulas for bilinear maps in a finite field
S Covanov - Theoretical Computer Science, 2019 - Elsevier
Abstract In 2012, Barbulescu, Detrey, Estibals and Zimmermann proposed a new framework
to exhaustively search for optimal formulas for evaluating bilinear maps over finite fields …
to exhaustively search for optimal formulas for evaluating bilinear maps over finite fields …
Fast finite field arithmetic
R Larrieu - 2019 - theses.hal.science
The multiplication of polynomials is a fundamental operation in complexity theory. Indeed,
for many arithmetic problems, the complexity of algorithms is expressed in terms of the …
for many arithmetic problems, the complexity of algorithms is expressed in terms of the …
Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over FPr
A Mathieu-Mahias, M Quisquater - Proceedings of the 45th International …, 2020 - dl.acm.org
Lin, Chung and Han introduced in 2014 the LCH-basis in order to derive FFT-based
multipoint evaluation and interpolation algorithms with respect to this polynomial basis …
multipoint evaluation and interpolation algorithms with respect to this polynomial basis …