Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
733 results
-
-
Seminar
-
Cryptography
Updatable Public Key Encryption with Lattices
Speaker : Calvin Abou-Haidar - ENS Lyon
Updatable public key encryption has recently been introduced as a so- lution to achieve forward-security in the context of secure group messaging without hurting efficiency, but so far, no efficient lattice-based instantia- tion of this primitive is known. In this work, we construct the first LWE-based UPKE scheme with polynomial modulus-to-noise rate, which is CPA-secure in the standard model. At[…] -
-
-
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 […] -