Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
717 results
-
-
Seminar
-
Cryptography
Disjunctions for Hash Proof Systems: New Constructions and Applications
Speaker : Fabrice Ben Hamouda - ENS
Hash Proof Systems were first introduced by Cramer and Shoup (Eurocrypt'02) as a tool to construct efficient chosen-ciphertext-secure encryption schemes. Since then, they have found many other applications, including password authenticated key exchange, oblivious transfer, and zero-knowledge arguments. One of the aspects that makes hash proof systems so interesting and powerful is that they can be[…] -
-
-
Seminar
-
Cryptography
On Error Correction for Physical Unclonable Functions
Speaker : Sven Muelich - Institute of Communications Engineering, Ulm University
Cryptographic applications require random, unique and unpredictable keys. Since most cryptosystems need to access the key several times, it usually has to be stored permanently. This is a potential vulnerability regarding security, even if a protected memory is used as key storage. Implementing secure key generation and storage is therefore an important and challenging task which can be[…] -
-
-
Seminar
-
Cryptography
Décodage des codes de Reed-Solomon et logarithme discret dans
Speaker : Daniel Augot - INRIA Saclay
Alors que le problème associé au décodage des Reed-Solomon est connu pour être NP-complet, on sait pas bien quelles sont les instances difficiles, ni si les codes de Reed-Solomon standard font partie de ce ces instances.<br/> Dans le but d'analyser les codes standard, Cheng et Wan étudient depuis 2004 comment le logarithme discret sur les corps non premiers se réduit à un certain problème de[…] -
-
-
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
Decoding interleaved Gabidulin codes and skew complexity of sequences.
Speaker : Vladimir Sidorenko - Univ. Ulm
Gabidulin codes are the rank metric analogues of Reed?Solomon codes and have found many applications including network coding and cryptography. Interleaving or the direct sum of Gabidulin codes allows both decreasing the redundancy and increasing the error correcting capability for network coding. We consider a transform domain algorithm correcting both errors and erasures with interleaved[…] -
-
-
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[…] -