Calendar
- 10/01/2025 ⇒ TG1 - Laetitia Della Torre (Université de technologie de Compiègne)
- 17/01/2025 ⇒ TG2 - Maïwenn Racouchot (CISPA)
- 31/01/2025 ⇒ TG3 - Kui Wang (Huawei)
- 07/02/2025 ⇒ Free
- 07/03/2025 ⇒ Free
- 14/03/2025 ⇒ TG1
- 21/03/2025 ⇒ TG4 - Roxane Cohen and Robin David (Quarkslab)
- 04/04/2025 ⇒ TG3
- 16/05/2025 ⇒ TG2
- 20/05/2025 ⇒ TG3 - Manuel Maarek (Heriot-Watt University)
- 06/06/2025 ⇒ Free
- 13/06/2025 ⇒ TG1 - Diane Leblanc-Albarel (KU Leuven)
- 20/06/2025 ⇒ TG3 - Sofiane Azogagh (UQÀM)
THE FOUR THEME GROUPS OF THE SOSYSEC SEMINAR
- TG1 : AI security, privacy, cybersecurity considerations in society
- TG2 : Formal methods, proofs of protocols, security of protocols, access control, security policies
- TG3 : OS and virtualization security, security based on virtualization, database security, distributed systems security, security of programming languages, network security
- TG4 : Vulnerability analysis, binary analysis, software attacks on hardware and mitigations, obfuscation, forensics, intrusion detection and security monitoring, malware mitigation
Registration is compulsory for each talk and must be made at least 48 hours in advance for all "on-site" participants.
Presentation of the seminar
-
Information systems and networks have become indispensable aids in our everyday lives. In addition to highly visible uses as mobile phones or personal computers, it is worth mentioning applications more subtle but equally important for economic activity such as cloud computing, industrial control systems, electrical networks. In fact, our society nurtures a growing dependence towards information systems which makes economic and sovereignty issues related to security increasingly important.
At the same time, due to their increasing complexity, their ubiquity, and multiplicity of risks associated with malicious or fraudulent use, ensuring an acceptable level of security seems close to impossible. Many questions related to the control of the security of softwares and information systems are thus at the origin of an intense scientific activity. We can cite for example intrusion detection, vulnerability research, proof of protocols, static analysis, virtualization…
From the interaction of all these themes, emerges a deep scientific domain that forms a point of contact between fundamental research and applications with a strong economic potential. Rennes metropolitan area is home to many talents in this field of research, both in academia and industry. This seminar aims to become a natural platform to gather, stimulate and promote Rennes security research and development community by confronting it to the best achievements of international research.
-
-
Tristan Allard (Université de Rennes)
-
Louis Rilling (DGA)
-
Nadia Derouault (Inria) - assistant
-
-
The program committee is in charge of the organization and the program of the seminar.
Its members are:- Tristan Allard (Université de Rennes)
- Guillaume Doyen (IMT Atlantique)
- Teddy Furon (Inria)
- Guillaume Hiet (CentraleSupélec)
- Joseph Lallemand (CNRS)
- David Lubicz (DGA-MI)
- Louis Rilling (DGA-MI)
- Mohamed Sabt (Université de Rennes)
- Sandrine Turgis (Université de Rennes)
Practical infos
Next sessions
-
Black-Box Collision Attacks on Widely Deployed Perceptual Hash Functions and Their Consequences
Speaker : Diane Leblanc-Albarel - KU Leuven
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: multimedia[…]-
Cryptography
-
SoSysec
-
Protocols
-
-
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
-
Subscribe to the mailing list
A mailing list is available for announcements concerning SoSySeC seminar