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.
729 résultats
-
-
Séminaire
-
Cryptographie
Practical Strategy-Resistant Privacy-Preserving Elections
Orateur : Quentin Santos - Orange
Recent advances in cryptography promise to let us run com- plex algorithms in the encrypted domain. However, these results are still mostly theoretical since the running times are still much larger than their equivalents in the plaintext domain. In this context, Majority Judgment is a recent proposal for a new voting system with several interesting practical advantages, but which implies a more[…] -
-
-
Séminaire
-
Cryptographie
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[…] -
-
-
Séminaire
-
Cryptographie
Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble
Orateur : Michele Orru - ENS
-
-
-
Séminaire
-
Cryptographie
Cocks-Pinch curves of embedding degree five to eight and optimal ate pairing computation
Orateur : Simon Masson - Loria, Nancy
Recent algorithmic improvements of discrete logarithm computation in special extension fields threaten the security of pairing-friendly curves used in practice. A possible answer to this delicate situation is to propose alternative curves that are immune to these attacks, without compromising the efficiency of the pairing computation too much. We follow this direction, and focus on embedding[…] -
-
-
Séminaire
-
Cryptographie
Low-Complexity Cryptographic Hash Functions
Orateur : Vinod Vaikuntanathan - Massachusetts Institute of Technology
Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function. The most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which the function has the same output.<br/> Despite[…] -
-
-
Séminaire
-
Cryptographie
identity-based encryption with rank metric
Orateur : Adrien Hauteville - Université de Limoges
Code-based cryptography has a long history, almost as long as the history of public-key encryption (PKE). While we can construct almost all primitives from codes such as PKE, signature, group signature etc, it is a long standing open problem to construct an identity-based encryption from codes. We solve this problem by relying on codes with rank metric. The concept of identity-based encryption […] -