Abstract
Identifiable parent property (IPP) codes are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we consider explicit construction methods for IPP codes by means of recursion techniques. The first method directly constructs IPP codes, whereas the second constructs perfect hash families that are then used to derive IPP codes. In fact, the first construction provides an infinite class of IPP codes having the best known asymptotic behavior. We also prove that this class has a traitor tracing algorithm with a runtime of O(M) in general, where M is the number of codewords.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. A lon (1986) ArticleTitleExplicit construction of exponential sized families of k-independent sets iscrete Math 58 191–193
A. Barg G. Cohen S. Encheva G. Kabatiansky G. Z \’emor A hypergraph (2001) ArticleTitleapproach to the identifying parent property: the case of multiple parents SIAM J. Discrete. Math. 14 423–431 Occurrence Handle1011.94014 Occurrence Handle1857594
D. Boneh and M. Franklin, An efficient public key traitor tracing schemes, In Advances in Cryptology - Crypto’94, Lecture Notes in Computer Science, Springer-Verlag (1994) pp. 257–270.
D. Boneh J. S haw (1998) ArticleTitleCollusion-secure fingerprinting for digital data IEEE Trans. Inform. Theory 44 1897–1905 Occurrence Handle0931.94051 Occurrence Handle1664047
K. A. Bush (1952) ArticleTitleA generalization of a theorem due to MacNeish Ann. Math. Stat. 23 293–295 Occurrence Handle0047.01702 Occurrence Handle49145
C. J. Colbourn and J. H. Dinitz, CRC Handbook of Combinatorial Designs, CRC Press, Inc. (1996).
ZJ Czech G Havas BS Majewski (1997) ArticleTitlePerfect hashing Theor. Comp. Sci. 182 1–143 Occurrence Handle0954.68060 Occurrence Handle1463931
B. Chor, A. Fiat and M. Naor, Tracing traitors, In Advances in Cryptology - Crypto’94, Lecture Notes in Computer Science, Springer-Verlag (1994) pp. 257–270.
B. Chor A. Fiat M. Naor B. Pinkas (2000) ArticleTitleTracing traitors IEEE Trans. Inform. Theory 46 480–491
A. Fiat and T. Tassa, Dynamic traitor tracing, In Advances in Cryptology Crypto’99, Lecture Notes in Computer Science, Springer-Verlag (1999) pp. 354–371.
A. Fiat T. Tassa (2001) ArticleTitleDynamic traitor tracing J. Cryptology 14 211–223 Occurrence Handle1023.94541 Occurrence Handle1837789
kE. Gafni, J. Staddon, and Y. L. Yin, Efficient methods for integrating traceability and broadcast encryption, In Advances in Cryptology–Crypto’99, Lecture Notes in Computer Science, Springer-Verlag (1999) pp. 372–387.
V. Guruswami M. Sudan (1999) ArticleTitleImproved decoding of Reed-Solomon and algebraic-geometry codes IEEE Trans. Inform. Theory 45 1757–1767 Occurrence Handle0958.94036 Occurrence Handle1720630
V. Guruswami and M. Sudan, List decoding algorithms for certain concatenated codes, In Proc. 32nd ACM Symposium on Theory of Computing (STOC 2000), 181–190.
V. Guruswami, List Decoding of Error-Correcting Codes, PhD Thesis, MIT (2001).
H. D. L. Hollmann J. H. Lint Particlevan JP Linnartz LMGM Tolhuizen (1998) ArticleTitleOn codes with identifiable parent property J. Comb. Theory A 82 121–133 Occurrence Handle0910.05070
S. S. Martirosyan and S. S. Martirosyan, New upper bound on the cardinality of a K-separated set or perfect hash family and a near optimal construction for it, Trans. IPIA of NAN RA & YSU ‘‘Mathematical Problems of Computer Science’’, Vol. XXI (2000) pp. 104–115.
R. Safavi-Naini Yejing Wang (2001) ArticleTitleNew results on frameproof codes and traceability schemes IEEE Trans. Inform. Theory 47 3029–3033 Occurrence Handle1018.94019 Occurrence Handle1872863
P.Sarkar, D. R. Stinson, Frameproof and IPP Codes, Preprint.
A. Silverberg J. N. Staddon J. L. Walker (2001) ArticleTitleEfficient traitor tracing algorithms using list decoding In ASIACRYPT 2001 Lect. Notes Comput. Sci. 2248 175–192 Occurrence Handle10.1007/3-540-45682-1_11 Occurrence Handle1934842
J. N. Staddon D. R. Stinson R. Wei (2001) ArticleTitleCombinatorial properties of frameproof and traceability codes IEEE Trans. Inform. Theory 47 1042–1049 Occurrence Handle1001.94032 Occurrence Handle1829330
D. R. Stinson Tran Trung Particlevan R Wei (2000) ArticleTitleSecure frameproof codes, key distribution patterns, group testing algorithms and related structures J. Statist. Planning Inference 86 595–617 Occurrence Handle1054.94013
D. R. Stinson R. Wei (1998) ArticleTitleCombinatorial properties and constructions of traceability schemes and frameproof codes SIAM J. Discrete Math. 11 41–53 Occurrence Handle0972.94028 Occurrence Handle1612849
D. R. Stinson R. Wei L. Zhu (2000) ArticleTitleNew constructions for perfect hash families and related structures using combinatorial designs and codes J. Combin. Designs 8 189–200 Occurrence Handle0956.68159 Occurrence Handle1752734
M Sudan (1997) ArticleTitleDecoding of Reed-Solomon codes beyond the error-correction bound. J. Complexity 13 180–193 Occurrence Handle0872.68026 Occurrence Handle1449766
M. Sudan, Decoding of Reed-Solomon codes beyond the error-correction diameter, In Proc. 35th Annual Allerton Conference on Communication, Control and Computing (1997) pp. 215–224.
ran van Trung and Sosina Martirosyan, On a class of traceability codes, to appear in Designs, Codes and Cryptography.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Trung, T.V., Martirosyan, S. New Constructions for IPP Codes. Des Codes Crypt 35, 227–239 (2005). https://doi.org/10.1007/s10623-005-6402-5
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-005-6402-5