Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
700 results
-
-
Seminar
-
SoSysec
Un protocole SMPC de curation de données d'entrainement et sa fragilité aux hypothèses de sécurité...
Speaker : Marc-Olivier Killijian - Université du Québec à Montréal
... ou "Sécurité et insécurité - dans quel état j’erre, ai-je bien rangé mon modèle de sécurité ?" De nos jours, les sources de données, et leurs curateurs, sont répartis à travers le monde. Il arrive que les propriétaires de ces données souhaitent collaborer entre eux afin d’augmenter la qualité de ces données, particulièrement avant d’entrainer des modèles d’apprentissage machine.Dans cet exposé[…]-
SoSysec
-
Privacy
-
Machine learning
-
Distributed systems
-
-
-
Seminar
-
Cryptography
Solving the Tensor Isomorphism Problem for Special Orbits
Speaker : Valerie Gilchrist - ULB
Public key cryptography relies on using mathematical functions that are easy to compute but hard to invert. A recent work by D'Alconzo, Flamini, and Gangemi attempted to build such a function from tensors and use it to create a commitment scheme. In this talk, we will review their construction and present an attack on it, rendering it completely insecure. We will also offer an approach to[…]-
Cryptography
-
Asymmetric primitive
-
Protocols
-
-
-
Seminar
-
Cryptography
Computational assumptions in the quantum world
Speaker : Alex Bredariol Grilo - LIP6 (CNRS / Sorbonne Université)
QKD is a landmark of how quantum resources allow us to implement cryptographicfunctionalities with a level of security that is not achievable only with classical resources.However, key agreement is not sufficient to implement all functionalities of interest, and it iswell-known that they cannot be implemented with perfect security, even if we have accessto quantum resources. Thus, computational[…]-
Cryptography
-
-
-
Seminar
-
Cryptography
MinRank Gabidulin encryption scheme on matrix codes
Speaker : Adrien Vinçotte - XLIM, Université de Limoges
The McEliece scheme is a generic framework allowing to use any error correcting code which disposes of an efficient decoding algorithm to design an encryption scheme by hiding a generator matrix of this code.In the context of rank metric, we propose a generalization of the McEliece frame to matrix codes. From a vector code, we compute a matrix version of this code, that is hidden in such a way[…]-
Cryptography
-
Asymmetric primitive
-
-
-
Seminar
-
Cryptography
Polytopes in the Fiat-Shamir with Aborts Paradigm
Speaker : Hugo Beguinet - ENS Paris / Thales
The Fiat-Shamir with Aborts paradigm (FSwA) uses rejection sampling to remove a secret’s dependency on a given source distribution. Recent results revealed that unlike the uniform distribution in the hypercube, both the continuous Gaussian and the uniform distribution within the hypersphere minimise the rejection rate and the size of the proof of knowledge. However, in practice both these[…]-
Cryptography
-
Asymmetric primitive
-
Mode and protocol
-
-
-
Seminar
-
Cryptography
Improved Provable Reduction of NTRU and Hypercubic Lattices
Speaker : Henry Bambury - ENS Paris
Lattice-based cryptography typically uses lattices with special properties to improve efficiency. We show how blockwise reduction can exploit lattices with special geometric properties, effectively reducing the required blocksize to solve the shortest vector problem to half of the lattice's rank, and in the case of the hypercubic lattice , further relaxing the approximation factor of blocks to . […]-
Cryptography
-
Asymmetric primitive
-