1 / 4

Maximizing Innocence: Collusion Attacks on Tardos Codes

Discover asymptotically false-positive-maximizing attacks on non-binary Tardos codes in ICT. Learn about coalition of pirates and their strategies to minimize coalition scores and lengthen innocent tails in this method. Explore curve shapes, accusation probabilities, and strategies used by pirates. Simulation results show the innocent curve going to Gaussian for large code lengths, pirates aim to reduce it. For more info, refer to poster 118.

kass
Télécharger la présentation

Maximizing Innocence: Collusion Attacks on Tardos Codes

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Asymptotically false-positive-maximizing attack on non-binary Tardos codes Antonino Simone and Boris Škorić Eindhoven University of Technology ICT.open, November 2011

  2. Collusion attacks "Coalition of pirates" Symbols received by pirates “Restricted Digit Model” Symbols allowed

  3. Accusation probabilities m = code length c = #pirates μ̃= expected coalition score per segment Pirates want to minimize μ̃ and make the innocent tail longer threshold • Curve shapes depend on: • F, g0, g1 (fixed ‘a priori’) • Code length • # pirates • Pirate strategy guilty innocent total score (scaled) Method to compute innocent curve [Simone+Škorić 2010] Big m  innocent curve goes to Gaussian

  4. For further information… … poster 118 Thank you for your attention

More Related