Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
645 results
-
-
Seminar
-
Cryptography
Lie algebras and the security of cryptosystems based on classical varieties in disguise
Speaker : Mingjie Chen - KU Leuven
In 2006, de Graaf et al. proposed a strategy based on Lie algebras for finding a linear transformation in the projective linear group that connects two linearly equivalent projective varieties defined over the rational numbers. Their method succeeds for several families of “classical” varieties, such as Veronese varieties, which are known to have large automorphism groups. In this talk, we[…]-
Cryptography
-
-
-
Seminar
-
SemSecuElec
Prise de contrôle d’un infodivertissement automobile à distance
Speaker : Philippe Trebuchet, Guillaume Bouffard - ANSSI
Les véhicules connectés intègrent de nombreuses technologies de communications sans-fil à distance, comme celles exploitant les protocoles Bluetooth ou WiFi. Si le gain en confort d’utilisation et d’interaction est notable, la mise à disposition de ce type d’interfaces augmente les risques en matière de cybersécurité. Dans cet article, nous analysons l’implémentation de la pile Bluetooth embarquée[…]-
SemSecuElec
-
Network
-
Embedded systems
-
-
-
Seminar
-
SoSysec
Empower New Code Citizens to Reflect and Communicate on Code Security
Speaker : Manuel Maarek - Heriot-Watt University
Creating secure software code requires software engineers to elicit and follow the security requirements of the system they are building. Software engineer teams might not have the security expertise to approach this angle of software development confidently. With the democratisation of access to software development and deployment, software are often built by developers with neither software[…] -
-
-
Seminar
-
SoSysec
A non-comparison oblivious sort and its application to private k-NN
Speaker : Sofiane Azogagh - UQÀM
Sorting is a fundamental subroutine of many algorithms and as such has been studied for decades. A well-known result is the Lower Bound Theorem, which states that no comparison-based sorting algorithm can do better than O(nlog(n)) in the worst case. However, in the fifties, new sorting algorithms that do not rely on comparisons were introduced such as counting sort, which can run in linear time[…]-
Cryptography
-
SoSysec
-
Privacy
-
Databases
-
Secure storage
-
-
-
Seminar
-
SoSysec
[CANCELLED] Black-Box Collision Attacks on Widely Deployed Perceptual Hash Functions and Their Consequences
Speaker : Diane Leblanc-Albarel - KU Leuven
[CANCELLED] Perceptual hash functions identify multimedia content by mapping similar inputs to similar outputs. They are widely used for detecting copyright violations and illegal content but lack transparency, as their design details are typically kept secret. Governments are considering extending the application of these functions to Client-Side Scanning (CSS) for end-to-end encrypted services:[…]-
Cryptography
-
SoSysec
-
Protocols
-
-
-
Seminar
-
SemSecuElec
Conformité TEMPEST et compromission d’information au travers de l’arbre d’alimentation d’un équipement
Speaker : Tristan PECHERAU, David HARDY - Thalès
THALES conçoit des équipements cryptographiques et de radiocommunication tactiques, navales et aéronautiques, embarquant des éléments de chiffrement pour la sécurité des communications. Cette sécurité notamment d’un point de vue des émanations électromagnétiques est normée. Ces normes de sécurité de l’information, sont connues sous le nom de code “TEMPEST”, correspondant aux normes OTAN SDIP-27,[…] -