Filter by event type
Select one or more filters. This choice will reload the page to display the filtered results.
Filter by tag
Select one or more filters. This choice will reload the page to display the filtered results.
6 results
-
-
Upcoming
-
Thesis defense
-
Cryptography
Algorithmique des variétés abéliennes avec les fonctions thêta
PhD : Antoine DEQUAY, IRMAR - Université de Rennes La thèse porte sur l'étude et le développement d'algorithmes pour les variétés abéliennes utilisant les fonctions thêta, et s'inscrit dans le développement de l'arithmétique efficace des variétés abéliennes de dimension quelconque munies de structures thêta. -
-
-
Seminar
-
Cryptography
Chiffrement homomorphe à l'aide des groupes après Nuida
Speaker : Pierre Guillot - Ravel Technologies/Université de strasbourg
Nuida et d'autres ont montré comment on peut obtenir un protocole de chiffrement pleinement homomorphe si l'on sait chiffrer les éléments d'un groupe G convenable, tout en sachant faire l'opération de G "en homomorphe". Les exemples étaient jusqu'à présent limités au chiffrement d'un bit à la fois, avec beaucoup d'opérations à effectuer pour "simuler" les portes logiques usuelles. Je vais[…]-
Cryptography
-
-
-
Seminar
-
SoSysec
Users Pay Twice: The Hidden Energy Cost of Web Advertising
Speaker : Samuel Pélissier - CentraleSupélec
Advertisements are everywhere on the Web: search engines promote results, most websites display ads, some require users to accept ads as a condition for access, video streaming services fund their infrastructure through an increasing volume of ads, and much of the gaming industry has adopted ad-based revenue models. In exchange for free access to a wide range of content, web users sacrifice their[…]-
Privacy
-
-
-
Seminar
-
Cryptography
Post-Quantum Signatures from Symmetric-Key-Friendly Techniques: From MPC-in-the-Head to VOLE-in-the-Head
Speaker : Dung Bui - Northwestern University
The MPC-in-the-Head (MPCitH) paradigm turns a secure multiparty computation protocol into a zero-knowledge proof and, via Fiat–Shamir, into a signature scheme whose security relies only on symmetric-key primitives. The framework of Katz, Kolesnikov and Wang (KKW, CCS18), which moves most of the MPC work into a committed preprocessing phase that the verifier checks by opening all-but-one of the[…] -
-
-
Seminar
-
Cryptography
Distinguishing and Attacking McEliece Cryptosystems Using GRS Codes with Higher-Weight Mask
Speaker : Michael Schaller - University of Zürich, Applied Algebra group
Due to the insecurity of McEliece cryptosystems instantiated with Generalized Reed-Solomon (GRS) codes, there have been several proposals of McEliece type systems that replace the permutation matrix by a matrix $M$ with larger row and column weight. In many of them, the secret key is still a GRS code.There have been successful attacks on some of those schemes with row and column weight between $1$[…] -
-
-
Seminar
-
Cryptography
Nouveaux doctorants
Exposés courts des nouveaux doctorants (Elouan, Quentin, Eliot) -