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 …

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 …

Digital copies of the signed statements were provided to NIST in the original submission on
Nov. 30, 2017. The paper versions have been provided to NIST at the First PQC …

4 Design Rationale and Considerations (2. B. 6) 11 4.1 What is BIKE and how should it be
used?............... 11 4.1. 1 What is BIKE in one sentence?................. 11 4.1. 2 How many …

We propose a framework for constructing efficient code-based encryption schemes that do
not hide any structure in their public matrix. The framework is in the spirit of the schemes first …

A new generation of cryptographic primitives is on the horizon and they are likely to replace
soon many previous and widespread systems. This is due to the cybersecurity threat …

In this work, we introduce a new code-based signature scheme, called FuLeeca, based on
the NP-hard problem of finding codewords of given Lee-weight. The scheme follows the …

This paper introduces a variant of the McEliece cryptosystem and employs the-construction
to generate a new code from two arbitrary linear codes. We propose an efficient hard …

We report on the concrete cryptanalysis of LEDAcrypt, a 2nd Round candidate in NIST's Post-
Quantum Cryptography standardization process and one of 17 encryption schemes that …

It is notably challenging to design an efficient and secure signature scheme based on error-
correcting codes. An approach to build such signature schemes is to derive it from an …