Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
690 results
-
-
Seminar
-
Cryptography
Correction of dual lattice attacks
Speaker : Kevin Carrier - CY Cergy
The security of cryptographic systems such as Kyber and Dilithium (currently undergoing standardization by NIST) fundamentally hinges on the Learning With Errors (LWE) problem. However, the state of the art for attacking this problem is not yet entirely clear. Specifically, the validity of dual attacks on LWE is currently under scrutiny due to their analyses relying on heuristics that have proven[…] -
-
-
Working group
Modélisation statistique et sécurité des générateurs d'aléa pour la cryptographie
Speaker : David Lubicz - DGA, IRMAR
Dans cet exposé on essaie d'expliquer ce que l'on entend pas méthodes statistiques et on donne des exemples concrets d'application dans la cybersécurité.-
Cryptography
-
-
-
Working group
Analyse statistique des extrêmes pour la modélisation d'évènements rares ou atypiques
Speaker : Gilles Stupfler - ENSAI
-
-
-
Seminar
-
SoSysec
How to decrypt without keys with GlobalPlatform SCP02 protocol
Speaker : par Loic Ferreira (Orange Labs, IRISA)
The GlobalPlatform SCP02 protocol is a security protocol implemented in smart cards, and used by transport companies, in the banking world and by mobile network operators (UICC/SIM cards). We describe how to perform a padding oracle attack against SCP02. The attack allows an adversary to efficiently retrieve plaintext bytes from an encrypted data field. We provide results of our experiments done[…] -
-
-
Seminar
-
SoSysec
Breaking and fixing HB+DB: A Short Tale of Provable vs Experimental Security and Lightweight Designs
Speaker : Ioana Boureanu (University of Surrey)
HB+ is a well-know authentication scheme purposely designed to be lightweight. However, HB+ is vulnerable to a key-recovery, man-in-the-middle (MiM) attack dubbed GRS. To this end, at WiSec2015, the HB+DB protocol added a distance-bounding dimension to HB+, which was experimentally shown to counteract the GRS attack.In this talk, we will exhibit however a number of security flaws in the HB+DB[…] -
-
-
Seminar
-
SoSysec
Voting : You Can’t Have Privacy without Individual Verifiability
Speaker : Joseph Lallemand (Loria)
Electronic voting typically aims at two main security goals: vote privacy and verifiability. These two goals are often seen as antagonistic and some national agencies even impose a hierarchy between them: first privacy, and then verifiability as an additional feature. Verifiability typically includes individual verifiability (a voter can check that her ballot is counted); universal verifiability […] -