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.
670 résultats
-
-
Séminaire
-
Cryptographie
New candidate PRFs and their applications
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
Tunnels sécurisés pour environnements contraints
Orateur : Loic Ferreira - soutenance de thèse salle Métivier à l'IRISA, 14h30
Avec l’extension de l’Internet des Objets et l’usage croissant de terminaux à bas coût, de nombreux protocoles de sécurité sont déployés à grande échelle. Cette thèse étudie le champ des protocoles d’échange de clé authentifié basés sur des fonctions cryptographiques symétriques. Nous montrons que les protocoles existants n’atteignent pas un niveau de sécurité correspondant à l’état de l’art en[…] -
-
-
Séminaire
-
Cryptographie
Zero-Knowledge Argument for Matrix-Vector Relations and Lattice-Based Group Encryption
Orateur : 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 […] -
-
-
Séminaire
-
Cryptographie
Improved Veron Identification and Signature Schemes in the Rank Metric
Orateur : Florian Caullery - Darkmatter
Abstract—It is notably challenging to design an efficient and secure signature scheme based on error-correcting codes. An approach to build such signature schemes is to derive it from an identification protocol through the Fiat-Shamir transform.<br/> All such protocols based on codes must be run several rounds, since each run of the protocol allows a cheating probability of either 2/3 or 1/2. The[…] -
-
-
Séminaire
-
Cryptographie
Repairing the Faure-Loidreau Public-Key Cryptosystem
Orateur : 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[…] -
-
-
Séminaire
-
Cryptographie
Lossy trapdoor primitives, zero-knowledge proofs and applications
Orateur : Chen Qian - soutenance de thèse salle Métivier à l'IRISA, 14h
In this thesis, we study two differentprimitives. Lossy trapdoor functions and zero-knwoledge proof systems.The lossy trapdoor functions (LTFs) arefunction families in which injective functionsand lossy ones are computationally indistin-guishable. Since their introduction, they havebeen found useful in constructing various cryp-tographic primitives. We give in this thesisefficient constructions of[…] -