Defeating N-1 Attacks Through Message Mix Strategy

cost to defeat the n 1 n.w
1 / 6
Embed
Share

Learn about a strategic approach to defeat N-1 attacks by modifying message pools to output extra messages, maintaining a pool of dummy messages, and using heartbeat traffic to detect attacks. Explore the effectiveness, costs, and potential pitfalls of this defense strategy against network attacks.

  • Network Security
  • Message Mix Strategy
  • N-1 Attacks
  • Heartbeat Traffic
  • Defense Strategy

Uploaded on | 0 Views


Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.

E N D

Presentation Transcript


  1. Cost to defeat the N-1 Attack Neil Chettiar

  2. Plan Modify a pool mix to output n+k messages for every n input messages. MIX

  3. How costly is it? Always maintain a pool of k dummy messages. Use a random function to decide if the mix should or should not send out k dummy messages. Use Heartbeat traffic to check if an N-1 attack is in progress, use this information to weigh the decision. Set a Time-To-Live value for the dummy traffic.

  4. Focus Points Does the strategy really beat the N-1 attack? How is the pool Mix triggered: OR/AND, Dynamic Threshold? Set limits of the number of dummy messages used. How expensive is it to use the Dummy messages? Cases when HeartBeat strategy gets wrongly triggered. Extreme situations when the proposed random function fails to defeat the N-1 attack.

  5. Resources 1. On blending attacks for mixes with Memory extended version. 2. Regroup-And-Go mixes to counter the (n-1) attack. 3. Active attacks on Reputable mix Networks. 4. Heartbeat traffic to counter (n-1) attacks. 5. A Least Squares approach to the static traffic analysis of high-latency anonymous communication systems. 6. Untraceable electronic mail, return addresses and digital pseudonyms. 7. From a trickle to a Flood: Active attacks on several Mix types. 8. Real-Time Mixes: A Bandwidth-Efficient anonymity protocol.

  6. Questions?

More Related Content