Filter by event type
Select one or more filters. This choice will reload the page to display the filtered results.
Filter by tag
Select one or more filters. This choice will reload the page to display the filtered results.
11 results
-
-
Seminar
-
Cryptography
Oblivious Transfer from Zero-Knowledge Proofs (or how to achieve round-optimal quantum Oblivious Transfer without structure)
Speaker : Léo Colisson - Université Grenoble Alpes
We provide a generic construction to turn any classical Zero-Knowledge (ZK) protocol into a composable oblivious transfer (OT) protocol (the protocol itself involving quantum interactions), mostly lifting the round-complexity properties and security guarantees (plain-model/statistical security/unstructured functions…) of the ZK protocol to the resulting OT protocol. Such a construction is unlikely[…]-
Cryptography
-
-
-
Seminar
-
SoSysec
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
-
-
-
Seminar
-
Cryptography
La crypto-graphie et les crypto-monnaies
Speaker : Daniel Augot - INRIA Saclay—Île-de-France
De nos jours, la requête «crypto» dans un moteur de recherche renvoieaux cryptomonnaies. Mais «crypto means crypto», et on peut se poser laquestion des liens pertinents entre les deux domaines. D'un coté, le monde des cryptomonnaies et de la technologiesous-jacente s'est développé et évolue encore en dehors du mondeacadémique. Il faut suivre d'un coté des posts de blog, des fils dediscussion X[…] -
-
-
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
-
Cryptography
SoK: Security of the Ascon Modes
Speaker : Charlotte Lefevre - Radboud University
The Ascon authenticated encryption scheme and hash function of Dobraunig et al (Journal of Cryptology 2021) were recently selected as winner of the NIST lightweight cryptography competition. The mode underlying Ascon authenticated encryption (Ascon-AE) resembles ideas of SpongeWrap, but not quite, and various works have investigated the generic security of Ascon-AE, all covering different attack[…] -
-
-
Seminar
-
SemSecuElec
Fine-grained dynamic partitioning against cache-based side channel attacks
Speaker : Nicolas Gaudin - Trasna
The growth of embedded systems takes advantage of architectural advances from modern processors to increase performance while maintaining a low power consumption. Among these advances is the introduction of cache memory into embedded systems. These memories speed up the memory accesses by temporarily storing data close to the execution core. Furthermore, data from different applications share the[…]-
SemSecuElec
-
Micro-architectural vulnerabilities
-
Hardware architecture
-