627 résultats
-
Towards Trustworthy Electronic Voting Systems
Orateur : Jacques Traoré - France telecom
We will focus on this talk on electronic voting which emulates traditional voting in a networked environment. We will first introduce the model of electronic voting. In particular, we will present the security requirements that an electronic voting system must fulfil in order to be a proper substitute for a paper-ballot system. We will also briefly review the cryptographic tools generally used to[…] -
Algebraic Analysis of MinRank
Orateur : Françoise Levy-dit-Vehel - ENSTA
We here investigate the hardness of one of the most relevant problems in multivariate cryptography, namely MinRank: given non-negative intgers n,k,r, and matrices M_0,...,M_k, of size n with entries in F_q, decide whether there exists an F_q-linear combination of those matrices which has rank less than or equal to r. Our starting point is the Kipnis-Shamir modeling of the problem. We first prove[…] -
AES-GCM plus rapide et résistant contre
Orateur : Peter Schwabe - Eindhoven University of Technology
Cet exposé a pour but de présenter une nouvelle implantation d'AES et d'AES-GCM. C'est la première qui résiste aux attaques temporelles et qui est en même temps efficace pour chiffrer des paquets courts.<br/> J'expliquerai pourquoi les méthodes classiques pour implanter AES sont vulnérables aux attaques dites de "cache-timing". Ensuite, je décrirai la technique de "bit-slicing" et détaillerai[…] -
Extended Private Information Retrieval Protocols: definitions,
Orateur : Julien Bringer - Sagem Sécurité
Cet exposé est basé sur des travaux communs avec Hervé Chabanne, David Pointcheval, Qiang Tang menés dans le cadre du projet ANR RNRT BACH (Biometric Authentication with Cryptographic Handling).<br/> Extended Private Information Retrieval (EPIR) is a generalization of the notion of Private Information Retrieval (PIR). The principle is to enable a user to privately evaluate a fixed and public[…] -
Rebound Attack on the Full LANE Compression Function
Orateur : Maria Naya - INRIA Rocquencourt
In this work, we apply the rebound attack to the AES based SHA-3 candidate LANE. The hash function LANE uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on LANE, we apply several new techniques to construct a collision for the full compression function of LANE-256 and LANE-512. Using a relatively sparse truncated[…] -
(Yet Another) Analysis of the Linux Random Number Generator
Orateur : Andrea Roeck - INRIA Rocquencourt
The Linux random number generator is part of the kernel since 1994. It collects entropy from user input, interrupts and disk movements and claims to output high quality random numbers. There are two different versions: /dev/random which blocks if the internal entropy count goes to zero and /dev/urandom which is faster since it produces as many bits as the user wants to. The only official[…]