Description
In this seminar, we will give an overview of Private Set Intersection (PSI), some of its constructions, use cases, and open research questions. The canonical PSI protocol allows Alice and Bob (both with their own set of elements) to interact in a way that Alice learns the intersection of the sets and nothing else. Numerous variants exist:cardinality of intersection only (how many elements in common), threshold cardinality (do we have at least X elements in common?), size-hiding, asymmetric scale, malicious versus semi-honest security, etc., and some of these will be explored. Along the way, other related “private” types of protocols and their applications will be discussed.
Prochains exposés
-
[CANCELLED] Black-Box Collision Attacks on Widely Deployed Perceptual Hash Functions and Their Consequences
Orateur : 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
-
-
A non-comparison oblivious sort and its application to private k-NN
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
-