Filtrer par type de contenu
Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.
734 résultats
-
-
Séminaire
-
Cryptographie
Soutenance de thèse : Algorithmes de recherche sur bases de données chiffrées
Orateur : Raphaël Bost - Université Rennes 1
La recherche sur les bases de données chiffrées vise à rendre e cace une tâche apparemment simple : déléguer le stockage de données à un serveur qui ne serait pas de con ance, tout en conservant des fonctionnalités de recherche. Avec le développement des services de stockage dans le Cloud, destinés aussi bien aux entreprises qu’aux individus, la mise au point de solutions e caces à ce problème est[…] -
-
-
Séminaire
-
Cryptographie
Computing individual discrete logarithms in non-prime finite fields
Orateur : Aurore Guillevic - Inria Saclay, équipe Grace et Ecole Polytechnique, LIX
This talk is about computing discrete logarithms in non-prime finite fields. These fields arise in pairing-based cryptography. In this setting, the pairing-friendly curve is defined over GF(q) and the pairing takes its values in an extension GF(q^k), where k is the embedding degree.<br/> Fr example, GF(p^2) is the embedding field of supersingular elliptic curves in large characteristic; GF(p^3),[…] -
-
-
Séminaire
-
Cryptographie
Speeding up Fully Homomorphic Encryption
Orateur : Marie Paindavoine - Orange Labs
Access to encrypted data is often “all-or-nothing” : either one has to decrypt everything, or one cannot read anything. Following Gentry’s work in 2009, fully homomorphic encryption has gained more and more attention, in particular because it allows more flexibility on encrypted data access and process. It is now possible to evaluate functions on encrypted data and get only the result – encrypted[…] -
-
-
Séminaire
-
Cryptographie
Algorithms for polynomial selection in the number field sieve
Orateur : Shi Bai - Australian National University
The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The running-time of the number field sieve depends on the quality of the chosen polynomials. The quality of the chosen polynomials can be modeled in terms of size and root properties. In this talk, we will describe some[…] -
-
-
Séminaire
-
Cryptographie
Symmetric Encryption Scheme adapted to Fully Homomorphic Encryption Scheme
Orateur : Pierrick Méaux - ENS Paris
Fully Homomorphic Encryption is a powerful cryptographic construction, enabling to securely compute all functions on encrypted data, and decrypt the result of the function applied on the real data.<br/> This construction allows to securely delegate computation, which is a very important property with the increasing of the Cloud computing. Many client-server applications are appearing, all needing[…] -
-