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.
667 résultats
-
-
Séminaire
-
Cryptographie
New uses in Symmetric Cryptography: from Cryptanalysis to Designing
Orateur : Clémence Bouvier - INRIA
New symmetric primitives are being designed to be run in abstract settings such as Multi-Party Computations (MPC) or Zero-Knowledge (ZK) proof systems. More particularly, these protocols have highlighted the need to minimize the number of multiplications performed by the primitive in large finite fields.<br/> As the number of such primitives grows, it is important to better understand the[…] -
-
-
Séminaire
-
Cryptographie
PMNS for efficient arithmetic and small memory cost
Orateur : Fangan Yssouf Dosso - Ecole des Mines de Saint-Etienne
The Polynomial Modular Number System (PMNS) is an integer number system which aims to speed up arithmetic operations modulo a prime p. Such a system is defined by a tuple (p, n, g, r, E), where p, n, g and r are positive integers, E is a monic polynomial with integer coefficients, having g as a root modulo p. Most of the work done on PMNS focus on polynomials E such that E(X) = X^n – l, where l is[…] -
-
-
Séminaire
-
Cryptographie
On Rejection Sampling in Lyubashevsky's Signature Scheme
Orateur : Julien Devevey - ENS de Lyon
Lyubashevsky’s signatures are based on the Fiat-Shamir with aborts paradigm, whose central ingredient is the use of rejection sampling to transform (secret-key-dependent) signature samples into samples from a secret-key-independent distribution. The choice of these two underly- ing distributions is part of the rejection sampling strategy, and various instantiations have been considered up to this[…] -
-
-
Séminaire
-
Cryptographie
Implicit proofs of membership
Orateur : Olivier Blazy - Université Limoges
Smooth hash proof systems have been introduced by Cramer and shoup to build compact efficient cca2 encryption in the standard model. Since then, they found applications in a broad range of protocols from oblivious transfer to authenticated key exchange, passing by witness examples.<br/> In this talk, we will start by a panorama of languages that can be managed by such a primitive and then show how[…] -
-
-
Séminaire
-
Cryptographie
A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs
Orateur : Thomas Prest - PQShield
Continuous group key agreements (CGKAs) are a class of protocols that can provide strong security guarantees to secure group messaging protocols such as Signal and MLS. Protection against device compromise is provided by commit messages: at a regular rate, each group member may refresh their key material by uploading a commit message, which is then downloaded and processed by all the other members[…] -
-
-
Séminaire
-
Cryptographie
Middle-Product Learning with Rounding Problem and its Applications
Orateur : Katharina Boudgoust - Univ Rennes, CNRS, IRISA
This talk focuses on a new variant of the Learning With Errors (LWE) problem, a fundamental computational problem used in lattice-based cryptography.<br/> At Crypto17, Roşca et al. introduced the Middle-Product LWE problem (MP-LWE), whose hardness is based on the hardness of the Polynomial LWE (P-LWE) problem parameterized by a large set of polynomials, making it more secure against the possible[…] -