Browse Proceedings

In recent years, many digital signature scheme proposals have been built from the so-called MPC-in-the-head paradigm. This has shown to be an outstanding way to design efficient signatures with security based on hard problems.

MinRank is an NP-...

In this paper, we show how to use the Matrix Code Equivalence (MCE) problem as a new basis to construct signature schemes. This extends previous work on using isomorphism problems for signature schemes, a trend that has recently emerged in post-...

The parametrization of (3, 3)-isogenies by Bruin, Flynn and Testa requires over 37.500 multiplications if one wants to evaluate a single isogeny in a point. We simplify their formulae and reduce the amount of required multiplications by $94\%$. ...${\mathrm{}}^{}{\mathrm{}}^{}$

We study the post-quantum security of authenticated encryption (AE) schemes, designed with classical security in mind. Under superposition attacks, many CBC-MAC variants have been broken, and AE modes employing those variants, such as EAX and GCM, ...

The NIST Post-Quantum Cryptography (PQC) standardization challenge was launched in December 2016 and recently, has released its first results. The whole process has given a considerable dynamic to the research in post-quantum cryptography, in ...${\mathbb{}}_{{\mathrm{}}^{}}$

In this paper we propose a new construction for building universal hash functions, a specific instance called multi-265, and provide proofs for their universality. Our construction follows the key-then-hash parallel paradigm. In a first step it ...${\mathrm{}}^{\mathrm{}}$

The construction of invertible non-linear layers over ${\mathbb{F}}_p^n$ that minimize the multiplicative cost is crucial for the design of symmetric primitives targeting Multi Party Computation (MPC), Zero-Knowledge proofs (ZK), and Fully Homomorphic Encryption ...${\mathbb{}}_{}$${}^{}$$\mathrm{}\mathrm{}$${\mathbb{}}_{}^{}$$\mathrm{}$$\mathcal{}$${\mathbb{}}_{}^{}$${\mathbb{}}_{}^{}{\mathbb{}}_{}$$$${\mathcal{}}_{}{}_{\mathrm{}}{}_{\mathrm{}}{}_{\mathrm{}}{}_{\mathrm{}}{}_{\mathrm{}}{}_{\mathrm{}}$${}_{}{}_{}{}_{\mathrm{}}{}_{\mathrm{}}$${\mathbb{}}_{}^{}{\mathbb{}}_{}$$\mathrm{}\mathrm{}\mathrm{}$${\mathcal{}}_{}$${\mathbb{}}_{}^{}$$\mathrm{}\mathrm{}$

Zero-knowledge proof systems for computational integrity have seen a rise in popularity in the last couple of years. One of the results of this development is the ongoing effort in designing so-called arithmetization-friendly hash functions in ...

Low energy is an important aspect of hardware implementation. For energy-limited battery-powered devices, low energy stream ciphers can play an important role. In IACR ToSC 2021, Caforio et al. proposed the Perfect Tree energy model for stream ...

Unit group computations are a cryptographic primitive for which one has a fast quantum algorithm, but the required number of qubits is $\tilde{O}(m^5)$. In this work we propose a modification of the algorithm for which the number of qubits is $\tilde{O}(m^2)$ in the ...$\mathbb{}{}_{}{}_{}^{\mathrm{}}$${\mathcal{}}_{}$

The multi-power RSA cryptosystem is a variant of RSA where the modulus is in the form $N=p^r{q}^s$ with $max(r,s)\ge 2$. In the multi-power RSA variant, the decryption phase is much faster than the standard RSA. While RSA has been intensively studied, the ...

We report on a new class of ECDSA signature vulnerability observed in the wild on the Bitcoin blockchain that results from a signature nonce generated by concatenating half of the bits of the message hash together with half of the bits of the ...

The efficiency of blockchain systems is often compared to popular credit card networks with respect to the transactions per second rate. This seems to be an unfair comparison since these networks do not complete a transaction from beginning to ...

The application of Fully Homomorphic Encryption (FHE) to privacy issues arising in inference or training of neural networks has been actively researched over the last few years. Yet, although practical performances have been demonstrated on ...$\mathbb{}$${\mathrm{}}^{\mathrm{}}$

A famous reduction by Regev shows that random instances of the Learning With Errors (LWE) problem are asymptotically at least as hard as a worst-case lattice problem. As such, by assuming that standard lattice problems are hard to solve, the ...

Fully Homomorphic Encryption (FHE) is a groundbreaking technology that allows for arbitrary computations to be performed on encrypted data. State-of-the-art schemes such as Brakerski Gentry Vaikuntanathan (BGV) are based on the Learning with ...

The learning with errors (LWE) problem is one of the fundamental problems in cryptography and it has many applications in post-quantum cryptography. There are two variants of the problem, the decisional-LWE problem, and the search-LWE problem. LWE ...

We present our speed records for Falcon signature generation and verification on ARMv8-A architecture. Our implementations are benchmarked on Apple M1 ‘Firestorm’, Raspberry Pi 4 Cortex-A72, and Jetson AGX Xavier. Our optimized signature ...$\mathrm{}$$$$\mathrm{}$$\mathrm{}$$\mathrm{}$$\mathrm{}$$$

This paper presents an analysis of the two lattice-based digital signature schemes, Dilithium and Falcon, which have been chosen by NIST for standardisation, on the ARM Cortex M7 using the STM32F767ZI NUCLEO-144 development board. This research is ...

The celebrated result by Gentry and Wichs established a theoretical barrier for succinct non-interactive arguments (SNARGs), showing that for (expressive enough) hard-on-average languages, we must assume non-falsifiable assumptions. We further ...

A whistleblower is a person who leaks sensitive information on a prominent individual or organisation engaging in an unlawful or immoral activity. Whistleblowing has the potential to mitigate corruption and fraud by identifying the misuse of ...