Circumventing IP-address pseudonymization

نویسندگان

  • Tønnes Brekne
  • André Årnes
چکیده

This paper presents an attack that circumvents anonymization of IP addresses in IP network traffic data in O(n) time, or O(n) time under certain circumstances. The attack is based on packet injection, and circumvents all anonymization techniques that assign a static and unique pseudonym to an IP address. It turns out that the packet injection itself, as well as the extraction of the corresponding anonymized header data, are the most time-consuming steps.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudonymization of patient identifiers for translational research

BACKGROUND The usage of patient data for research poses risks concerning the patients' privacy and informational self-determination. Next-generation-sequencing technologies and various other methods gain data from biospecimen, both for translational research and personalized medicine. If these biospecimen are anonymized, individual research results from genomic research, which should be offered...

متن کامل

Pseudonymization Service for X-Road eGovernment Data Exchange Layer

Pseudonymization is sometimes used as a light-weight alternative to fully cryptographic solutions, when information from different data sources needs to be linked in a privacy-preserving manner. In this paper, we review several previously proposed pseudonymization techniques, point out their cryptographic and design flaws. As a solution, we have developed a simple pseudonymization framework bas...

متن کامل

Comparison of Traffic Trace Anonymization Tools

Collecting network traffic traces from deployed networks is one of the basic steps in network research. These traces can be used to study real users, traffic engineering, packet classification, web performance, security application or more general network measurement and simulation. However for security and privacy reason monitored traffic traces have to be modified before they are published. T...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005