Filtrer par type d'événement

Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.

Filtrer par thématique

Sélectionnez un ou plusieurs filtres. Ce choix permettra de recharger la page pour afficher les résultats filtrés.

Supprimer tous les filtres

2 résultats

    • Séminaire

    • SoSysec

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

    • 13 juin 2025 (11:00 - 12:00)

    • Inria Center of the University of Rennes - Aurigny room

    Orateur : 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

    • Séminaire

    • SoSysec

    A non-comparison oblivious sort and its application to private k-NN

    • 20 juin 2025 (11:00 - 12:00)

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

    Orateur : 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