Hardening Bloom Filter PPRL by modifying identifier encodings

60 mins,  231.12 MB,  iPod Video  480x270,  29.97 fps,  44100 Hz,  525.92 kbits/sec
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Schnell, R (City University, London, Universität Duisburg-Essen)
Monday 12th September 2016 - 10:00 to 11:00
 
Created: 2016-09-15 16:19
Collection: Data Linkage and Anonymisation
Publisher: Isaac Newton Institute
Copyright: Schnell, R
Language: eng (English)
Distribution: World     (downloadable)
Explicit content: No
Aspect Ratio: 16:9
Screencast: No
Bumper: UCS Default
Trailer: UCS Default
 
Abstract: Co-author: Christian Borgs (University of Duisburg Essen)

Using appropriate parameter settings, Bloom filter approaches show linkage results comparable to linkage based on unencrypted identifiers. Furthermore, this approach has been used in real-world settings with data sets containing up to 100 Million records. By the application of suitable blocking strategies, linking can be done in reasonable time. However, Bloom filters have been subject of cryptographic attacks. Previous research has shown that the straight application of Bloom filters has a nonzero re-identification risk. We will present new results on recently developed techniques to defy all known attacks on PPRL Bloom filters. These computationally simple algorithms modify the identifiers by different cryptographic diffusion techniques. The presentation will demonstrate these new algorithms and show their performance concerning precision, recall in large databases.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 640x360    1.95 Mbits/sec 880.77 MB View Download
WebM 640x360    881.49 kbits/sec 387.38 MB View Download
iPod Video * 480x270    525.92 kbits/sec 231.12 MB View Download
MP3 44100 Hz 251.98 kbits/sec 110.74 MB Listen Download
Auto (Allows browser to choose a format it supports)