Table of contents

  • This session has been presented May 20, 2025 (11:00 - 12:00).

Description

  • 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 engineering 
expertise nor security knowledge, a situation that could make systems 
vulnerable. We present approaches based on short games, knowledge cards 
and serious game jams designed to help these non-experts gain the 
knowledge and ability to communicate on code security. These are some of 
the outputs of the Secrious project published recently in the IEEE 
Security & Privacy magazine, and in the ACM Games and Computer Standards 
& Interfaces journals. The project was supported by the Engineering and 
Physical Research Council (Grant EP/T017511/1 "Serious Coding: A Game 
Approach To Security For The New Code-Citizens"). 

Manuel Maarek from Heriot-Watt University is visiting the Université de 
Rennes/IRISA as part of the MLSEAN Machine Learning based software 
systems SEcurity ANalysis project supported by the UK-France Science, 
Innovation, and Technology Researcher Mobility Scheme.

Practical infos

Next sessions

  • Black-Box Collision Attacks on Widely Deployed Perceptual Hash Functions and Their Consequences

    • June 13, 2025 (11:00 - 12:00)

    • Inria Center of the University of Rennes - Aurigny room

    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

    • June 20, 2025 (11:00 - 12:00)

    • Inria Center of the University of Rennes - - Petri/Turing room

    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

Show previous sessions
Page top