Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
718 results
-
-
Seminar
-
Cryptography
Symmetric Encryption Scheme adapted to Fully Homomorphic Encryption Scheme
Speaker : 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[…] -
-
-
-
Seminar
-
Cryptography
Fonction de hachage et protection de la vie privée
Speaker : Cédric Lauradoux - INRIA
Les fonctions de hachage à sens unique sont très utilisées pour générer des pseudonymes et anonymiser des données. Le résultat obtenu est rarement à la hauteur des espoirs mis dans le hachage. Dans de nombreux cas, on a pu ré-identifier des bases de données anonymiser avec des fonctions de hachage. Dans cet exposé, nous reviendrons sur les garanties d'anonymat (anonymity-set-size ou k-anonymity)[…] -
-
-
Seminar
-
Cryptography
A heuristic quasi-polynomial algorithm for discrete logarithm
Speaker : Razvan Basbulescu - LORIA
in finite fields of small characteristic The difficulty of discrete logarithm computations in fields GF(q^k) depends on the relative sizes of k and q. Until recently all the cases had a sub-exponential complexity of type L(1/3), similar to the complexity of factoring. If n is the bit-size of q^k, then L(1/3) can be approximated by 2^(n^(1/3)). In 2013, Joux designed a new algorithm for constant[…] -
-
-
Seminar
-
Cryptography
Keep your friends close with distance-bounding protocols
Speaker : Maria Cristina Onete - IRISA
Authentication protocols, run between a prover and a verifier, allow the verifier to check the legitimacy of the prover. A legitimate prover should always authenticate (the correctness requirement), while illegitimate parties (adversaries) should not authenticate (the soundness or impersonation resistance requirement). Secure authentication protocols thwart most Man-in-the-Middle (MIM) attacks,[…] -
-
-
Seminar
-
Cryptography
Broadcast encryption: combinatorial vs. algebraic methods
Speaker : Duong-Hieu Phan - ENS
We consider a generalisation of the encryption from "one-to-one'' to "one-to-many'' communication, i.e. broadcast encryption. The objective is to allow a center to send secret messages to a large number of receivers. The security notion in “one-to-many” communications needs to be extended beyond the notion of confidentiality in “one-to-one” encryption in order to meet practical requirements. Two[…] -