Improved versions of Tardos' fingerprinting scheme

Oded Blayer, Tamir Tassa

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء


We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardos' analysis of the scheme and extracting from it all constants that were arbitrarily selected. We replace those constants with parameters and derive a set of inequalities that those parameters must satisfy so that the desired security properties of the scheme still hold. Then we look for a solution of those inequalities in which the parameter that governs the codeword length is minimal. A further reduction in the codeword length is achieved by decoupling the error probability of falsely accusing innocent users from the error probability of missing all colluding pirates. Finally, we simulate the Tardos scheme and show that, in practice, one may use codewords that are shorter than those in the original Tardos scheme by a factor of at least 16.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)79-103
عدد الصفحات25
دوريةDesigns, Codes, and Cryptography
مستوى الصوت48
رقم الإصدار1
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - يوليو 2008


أدرس بدقة موضوعات البحث “Improved versions of Tardos' fingerprinting scheme'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا