589 résultats
-
Approx-SVP in Ideal Lattices with Pre-processing
Orateur : Alice Pellet-Mary - ENS de Lyon
Finding a short non zero vector in an Euclidean lattice is a well-studied problem which has proven useful to construct many cryptographic primitives. The current best asymptotic algorithm to find a relatively short vector in an arbitrary lattice is the BKZ algorithm. This algorithm recovers a vector which is at most $2^{n^{\alpha}}$ times larger than the shortest non zero vector in time $2^{n^{1-[…] -
Automated software protection for the masses against side-channel attacks
Orateur : Nicolas Belleville
This presentation will present an approach and a tool that answer the need for effective, generic, and easily applicable protections against side-channel attacks. The protection mechanism is based on code polymorphism, so that the observable behaviour of the protected component is variable and unpredictable to the attacker. Our approach combines lightweight specialized runtime code generation with[…] -
Homomorphic Signatures on Randomizable Ciphertexts
Orateur : David Pointcheval - ENS
Anonymity is a primary ingredient for our digital life. Several tools have been designed to address it such as, for authentication, blind signatures, group signatures or anonymous credentials and, for confidentiality, randomizable encryption or mix-nets.<br/> When it comes to complex electronic voting schemes, random shuffling of ciphertexts with mix-nets is the only known tool. Such mix-nets are[…] -
Do Not Trust Modern System-on-Chips - Electromagnetic fault injection against a System-on-Chip
Orateur : Ronan Lashermes
Electromagnetic fault injection (EMFI) is a well known technique to disturb the behavior of a chip and weaken its security. These attacks are still mostly done on simple microcontrollers since the fault effects is relatively simple and understood.Unlocking EMFI on modern System-on-Chips (SoCs), the fast and complex chips ubiquitous today, requires to understand the impact of the faults. In this[…] -
Quantum security of the Fiat-Shamir transform of commit and open protocols
Orateur : André Chailloux - INRIA
Applying the Fiat-Shamir transform on identification schemes is one of the main ways of constructing signature schemes. While the classical security of this transformation is well understood, there are still many cases for which we do not know whether the quantum security holds or not. In this paper, we show that if we start from a commit-and-open identification scheme, where the prover first[…] -
New candidate PRFs and their applications
Orateur : Alain Passelègue - Inria
In this talk, I will present new and simple candidate PRFs introduced in a recent work. In this work, we depart from the traditional approaches for building PRFs used in provable security or in applied cryptography by exploring a new space of plausible PRF candidates. Our guiding principle is to maximize simplicity while optimizing complexity measures that are relevant to advanced cryptographic[…]