research-article

EM decoding of tardos traitor tracing codes

Authors:

Teddy Furon,

Luis Pérez-FreireAuthors Info & Claims

MM&Sec '09: Proceedings of the 11th ACM workshop on Multimedia and security

Pages 99 - 106

https://doi.org/10.1145/1597817.1597835

Published: 07 September 2009 Publication History

Get Access

Abstract

This paper proposes a major shift in the decoding of probabilistic Tardos traitor tracing code. The goal of the decoder is to accuse colluders but it ignores how they have been mixing their copies in order to forge the pirated content. As originally proposed by Tardos, so far proposed decoders are agnostic and their performances are stable with respect to this unknown collusion attack. However, this stability automatically leads to non-optimality from a detection theory perspective. This is the reason why this paper proposes to estimate the collusion attack in order to approximate the optimal matched decoder. This is done iteratively thanks to the application of the well-known Expectation-Maximization algorithm. We have dropped the stability: the power of our decoding algorithm deeply depends on the collusion attack. Some attacks are worse than others. However, even for the worst collusion channel, our decoder performs better than the original Tardos decoding.

References

[1]

E. Amiri and G. Tardos. High rate fingerprinting codes and the fingerprinting capacity. In Proc. of 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), jan 2009.

Digital Library

Google Scholar

[2]

O. Blayer and T. Tassa. Improved versions of Tardos' fingerprinting scheme. Des. Codes Cryptography, 48(1):79--103, 2008.

Digital Library

Google Scholar

[3]

D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory, 44:1897--1905, September 1998.

Digital Library

Google Scholar

[4]

A. Charpentier, F. Xie, C. Fontaine, and T. Furon. Expectation maximisation decoding of tardos probabilistic fingerprinting code. In N. Memon, editor, Security, steganography and watermarking of multimedia contents, San Jose, CA, USA, jan 2009. SPIE Electronic Imaging.

Google Scholar

[5]

T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley series in Telecommunications, 1991.

Digital Library

Google Scholar

[6]

T. Furon, A. Guyader, and F. Cérou. On the design and optimization of tardos probabilistic fingerprinting codes. In 10th International Workshop on Information Hiding, IH'08, Santa Barbara, California, USA, May 19-21 2008.

Digital Library

Google Scholar

[7]

T. Furon, L. Pérez-Freire, A. Guyader, and F. Cérou. Estimating the minimal length of tardos code. In Information Hiding, Darmstadt, Germany, jun 2009. Accepted.

Digital Library

Google Scholar

[8]

T. K. Moon. The expectation-maximization algorithm. IEEE Signal Processing Magazine, 13(6):47--60, November 1996.

Crossref

Google Scholar

[9]

P. Moulin. Universal fingerprinting: capacity and random-coding exponents. IEEE Transactions on Information Theory, January 2008. Submitted. Preprint available at http://arxiv.org/abs/0801.3837.

Crossref

Google Scholar

[10]

K. Nuida, S. Fujitsu, M. Hagiwara, T. Kitagawa, H. Watanabe, K. Ogawa, and H. Imai. An improvement of Tardos's collusion-secure fingerprinting codes with very short lengths. In Proc. 9th International Workshop on Information Hiding, IH'07, volume 4851 of LNCS, pages 80--89, Saint Malo, France, June 2007.

Digital Library

Google Scholar

[11]

B. Skoric, T. Vladimirova, M. Celik, and J. Talstra. Tardos fingerprinting is better than we thought. arXiv:cs/0607131v1, July 2006.

Google Scholar

[12]

G. Tardos. Optimal probabilistic fingerprint codes. In Proc. of the 35th annual ACM symposium on theory of computing, pages 116--125, San Diego, CA, USA, 2003. ACM.

Digital Library

Google Scholar

Cited By

View all

Maho TFuron TMerrer E(2023)Fingerprinting Classifiers With Benign InputsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.330126818(5459-5472)Online publication date: 2023
https://doi.org/10.1109/TIFS.2023.3301268
Quan X(2022)Anti-Collusion Fingerprint Scheme of Digital Image2022 7th International Conference on Computer and Communication Systems (ICCCS)10.1109/ICCCS55155.2022.9845910(284-288)Online publication date: 22-Apr-2022
https://doi.org/10.1109/ICCCS55155.2022.9845910
Megías DKuribayashi MQureshi A(2020)Survey on Decentralized Fingerprinting Solutions: Copyright Protection through Piracy TracingComputers10.3390/computers90200269:2(26)Online publication date: 3-Apr-2020
https://doi.org/10.3390/computers9020026
Show More Cited By

Index Terms

EM decoding of tardos traitor tracing codes
1. Security and privacy
  1. Systems security
    1. Information flow control
    2. Operating systems security

Recommendations

Towards joint tardos decoding: the 'don quixote' algorithm
IH'11: Proceedings of the 13th international conference on Information hiding

'Don Quixote' is a new accusation process for Tardos traitor tracing codes which is, as far as we know, the first practical implementation of joint decoding. The first key idea is to iteratively prune the list of potential colluders to keep the ...
Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

We propose an efficient maximum-likelihood (ML) decoding algorithm for decoding low-density parity-check (LDPC) codes over the binary-erasure channel (BEC). We also analyze the computational complexity of the proposed algorithm.
Soft decoding method for systematic raptor codes

Raptor codes are a class of rateless codes that were originally designed for binary erasure channels. To enhance their performance, multiple soft iterative loops can be employed in the decoder. In this study, the authors propose a method to construct ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

MM&Sec '09: Proceedings of the 11th ACM workshop on Multimedia and security

September 2009

186 pages

ISBN:9781605584928

DOI:10.1145/1597817

General Chair:
Edward W. Felten
Center for Information Technology Policy, Princeton University USA
,
Program Chairs:
Jana Dittmann
Otto-von-Guericke University Magdeburg, Germany
,
Jessica Fridrich
SUNY Binghamton, USA
,
Scott Craver
SUNY Binghamton, USA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 September 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MM&Sec '09

Sponsor:

MM&Sec '09: Multimedia and Security Workshop

September 7 - 8, 2009

New Jersey, Princeton, USA

Acceptance Rates

Overall Acceptance Rate 128 of 318 submissions, 40%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
100
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Maho TFuron TMerrer E(2023)Fingerprinting Classifiers With Benign InputsIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.330126818(5459-5472)Online publication date: 2023
https://doi.org/10.1109/TIFS.2023.3301268
Quan X(2022)Anti-Collusion Fingerprint Scheme of Digital Image2022 7th International Conference on Computer and Communication Systems (ICCCS)10.1109/ICCCS55155.2022.9845910(284-288)Online publication date: 22-Apr-2022
https://doi.org/10.1109/ICCCS55155.2022.9845910
Megías DKuribayashi MQureshi A(2020)Survey on Decentralized Fingerprinting Solutions: Copyright Protection through Piracy TracingComputers10.3390/computers90200269:2(26)Online publication date: 3-Apr-2020
https://doi.org/10.3390/computers9020026
Yasui TKuribayashi MFunabiki NEchizen I(2020)Near-Optimal Detection for Binary Tardos Code by Estimating Collusion StrategyIEEE Transactions on Information Forensics and Security10.1109/TIFS.2019.295658715(2069-2080)Online publication date: 2020
https://doi.org/10.1109/TIFS.2019.2956587
Laarhoven TCogranne RVerdoliva LLyu SPastoriza JZhang X(2019)Nearest Neighbor Decoding for Tardos Fingerprinting CodesProceedings of the ACM Workshop on Information Hiding and Multimedia Security10.1145/3335203.3335732(182-187)Online publication date: 2-Jul-2019
https://dl.acm.org/doi/10.1145/3335203.3335732
Kuribayashi MFunabiki N(2019)Decentralized tracing protocol for fingerprinting systemAPSIPA Transactions on Signal and Information Processing10.1017/ATSIP.2018.288Online publication date: 9-Jan-2019
https://doi.org/10.1017/ATSIP.2018.28
KURIBAYASHI MFUNABIKI N(2018)Universal Scoring Function Based on Bias Equalizer for Bias-Based Fingerprinting CodesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.E101.A.119E101.A:1(119-128)Online publication date: 2018
https://doi.org/10.1587/transfun.E101.A.119
Kuribayashi M(2018)Bias-Based Binary Fingerprinting Code Under Erasure ChannelIEEE Signal Processing Letters10.1109/LSP.2018.286303425:9(1423-1427)Online publication date: Sep-2018
https://doi.org/10.1109/LSP.2018.2863034
Laarhoven T(2016)Asymptotics of fingerprinting and group testingEURASIP Journal on Information Security10.1186/s13635-015-0026-82016:1(1-15)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1186/s13635-015-0026-8
Chaabane FCharfeddine MPuech WBen Amar C(2016)An EM-based estimation for a two-level traitor tracing scheme2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)10.1109/SMC.2016.7844791(003594-003599)Online publication date: Oct-2016
https://doi.org/10.1109/SMC.2016.7844791
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Towards joint tardos decoding: the 'don quixote' algorithm

Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

Soft decoding method for systematic raptor codes