Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
702 results
-
-
Seminar
-
Cryptography
Optimisation des Principaux Composants des Chiffrements par Bloc
Speaker : Baptiste Lambin - soutenance de thèse salle Métivier à l'IRISA, 14h
La sécurité des chiffrements par bloc évolue constamment au fur et à mesure que de nouvelles techniques de cryptanalyse sont découvertes. Lors de la conception de nouveaux chiffrements par bloc, il est donc nécessaire de considérer ces nouvelles techniques dans l'analyse de sécurité. Dans cette thèse, nous montrons comment construire certaines opérations internes des chiffrements par bloc pour[…] -
-
-
Seminar
-
Cryptography
Zero-Knowledge Argument for Matrix-Vector Relations and Lattice-Based Group Encryption
Speaker : Fabrice Mouhartem - ENS Lyon
Group encryption (GE) is the natural encryption analogue of group signatures in that it allows verifiably encrypting messages for some anonymous member of a group while providing evidence that the receiver is a properly certified group member. Should the need arise, an opening authority is capable of identifying the receiver of any ciphertext. As intro- duced by Kiayias, Tsiounis and Yung […] -
-
-
Seminar
-
Cryptography
New candidate PRFs and their applications
Speaker : Alain Passelègue - Inria
In this talk, I will present new and simple candidate PRFs introduced in a recent work. In this work, we depart from the traditional approaches for building PRFs used in provable security or in applied cryptography by exploring a new space of plausible PRF candidates. Our guiding principle is to maximize simplicity while optimizing complexity measures that are relevant to advanced cryptographic[…] -
-
-
Seminar
-
Cryptography
Repairing the Faure-Loidreau Public-Key Cryptosystem
Speaker : julian renns - Teschnische Universität Munchen
A repair of the Faure–Loidreau (FL) public-key code-based cryptosystem is proposed. The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special rank-metric codes. We prove that the recent structural attack on the system by Gaborit et al. is equivalent to decoding an interleaved Gabidulin code. Since all known polynomial-time decoders for these codes fail for a[…] -
-
-
Seminar
-
Cryptography
Cocks-Pinch curves of embedding degree five to eight and optimal ate pairing computation
Speaker : 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[…] -
-
-
Seminar
-
Cryptography
Tightly Secure CCA-Secure Encryption without Pairings.
Speaker : Romain Gay - ENS
(Joint work with Dennis Hofheinz, Eike Kiltz and Hoeteck Wee) We present the first CCA-secure public-key encryption scheme based on DDH where the security loss is independent of the number of challenge ciphertexts and the number of decryption queries. Our construction extends also to the standard k-Lin assumption in pairing-free groups, whereas all prior constructions starting with Hofheinz and[…] -