Abstract
We derive upper bounds on the size of set systems having the c-identifiable parent property (c-IPP) and the c-traceability property (c-TA).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Stav, U.: New bounds on parent-identifying codes: The case of multiple parents. Comb. Probab. Comput. 13(6), 795–807 (2004)
Blackburn, S.R.: An upper bound on the size of a code with the k-identifiable parent property. J. Comb. Theory, Ser. A 102(1), 179–185 (2003)
Chor, B., Fiat, A., Naor, M., Pinkas, B.: Tracing traitors. IEEE Transactions on Information Theory 46(3), 893–910 (2000)
Füredi, Z., Erdős, P., Frankl, P.: Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51(1), 79–89 (1985)
Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discr. Math. 11, 41–53 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Collins, M.J. (2008). Upper Bounds for Set Systems with the Identifiable Parent Property. In: Safavi-Naini, R. (eds) Information Theoretic Security. ICITS 2008. Lecture Notes in Computer Science, vol 5155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85093-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-85093-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85092-2
Online ISBN: 978-3-540-85093-9
eBook Packages: Computer ScienceComputer Science (R0)