599 results
-
Masked Proofs and Their Physical Assumptions
Speaker : Vincent Grosso
Les attaques par canaux auxiliaires sont des menaces majeures contre les mises en uvre cryptographiques. Pour contrer ces attaques, le masquage est une contre-mesure populaire. Un de ces principaux avantages est de pouvoir prouver la sécurité apportée par cette contre-mesure. Ces preuves se basent sur un certain nombre d’hypothèses sur le matériel qui met en uvre le masquage. Dans cette[…] -
Anonymous Server-Aided Verification
Speaker : par Elena Pagnin (Chalmers University of Technology, Sweden)
Server-Aided Verification (SAV) is a method that can be employed to speed up the process of verifying signatures by letting the verifier outsource part of its computation load to a third party. Achieving fast and reliable verification under the presence of an untrusted server is an attractive goal in cloud computing and internet of things scenarios.In this talk I will describe a simple and[…] -
Key Reinstallation Attacks: Forcing Nonce Reuse in WPA2
Speaker : Mathy Vanhoef - KU-Leuven
We introduce key reinstallation attacks (KRACKs). These attacks abuse features of a protocol to reinstall an already in-use key, thereby resetting nonces and/or replay counters associated to this key. We show that our novel attack technique breaks several handshakes that are used in a WPA2-protected network.<br/> All protected Wi-Fi networks use the 4-way handshake to generate fresh session[…] -
Automated verification of privacy-type properties for security protocols
Speaker : Ivan Gazeau (LORIA, Inria Nancy)
The applied pi-calculus is a powerful framework to model protocols and to define security properties. In this symbolic model, it is possible to verify automatically complex security properties such as strong secrecy, anonymity and unlinkability properties which are based on equivalence of processes.In this talk, we will see an overview of a verification method used by a tool, Akiss. The tool is[…] -
The Internet of Backdoors
Speaker : par Sam L. Thomas (University of Birmingham, UK)
Complex embedded devices are becoming ever prevalent in our everyday lives, yet only a tiny amount of people consider the potential security and privacy implications of attaching such devices to our home, business and government networks. As demonstrated through recent publications from academia and blog posts from numerous industry figures, these devices are plagued by poor design choices[…] -
Grost Distinguishing Attack: A new rebound attack of an AES-like permutation
Speaker : Victor Cauchois - DGA et IRMAR
Grostl est une fonction de hachage finaliste de la compétition SHA-3. Elle est dotée d'une preuve de sécurité qui assure sa résistance aux attaques en collision, pré-image et seconde pré-image sous l'hypothèse que deux permutations internes sont idéales. Ces permutations, 14 tours d'un SPN, calques de l'AES, présentent une structure sensible aux attaques rebond. Ces attaques[…]