Abstract
Frameproof and identifying parent property codes and their relationship to hash families and error correcting codes are studied. A upper bound on the size of such codes is presented. A generalization of identifying parent property is introduced and studied in terms of a new class of hash families - the strong separating hash families. Asymptotic consequences of some recursive construction techniques are described.
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.
Similar content being viewed by others
References
N. Alon. Explicit construction of exponential sized families of k-independent sets. Discrete Mathematics, Volume 58(1986), pp 191–193.
S.R. Blackburn. Frameproof codes. Preprint, 2000.
S.R. Blackburn. Frameproof codes. Preprint, 2001.
A. Barg, G. Cohen, S. Encheva, G. Kabatiansky and G. Zémor. A hypergraph approach to identifying parent property: the case of multiple parents. DIMACS Technical Report 2000-20.
D. Boneh and J. Shaw. Collision-secure fingerprinting for digital data. IEEE Transactions on Information Theory, Volume 44(1998), pp 1897–1905.
Z.J. Czech, G. Havas and B.S. Majewski. Perfect hashing. Theoretical Computer Science, Volume 182 (1997), pp 1–143.
J. Friedman. Constructing O(n log n) size monotone formulae for the kth elementary symmetric polynomial of n Boolean variables. Proceedings of the 25th Annual Symposium on Foundations of Computer Science, (1984), 506–515.
H.D.L. Hollman, J.H. van Lint, J-P. Linnartz and L.M.G.M. Tolhuizen. On codes with the identifiable parent property. Journal of Combinatorial Theory A, Volume 82 (1998), pp 121–133.
P. Sarkar and D. R. Stinson. Frameproof and IPP codes. CACR Technical Report CORR 2001-12, University of Waterloo, http://www.cacr.math.uwaterloo.ca, 2001.
J.N. Staddon, D.R. Stinson and R. Wei. Combinatorial properties of frameproof and traceability codes. CACR Technical Report CORR 2000-16, University of Waterloo, http://cacr.math.uwaterloo.ca, 2000.
D.R. Stinson, T. van Trung and R. Wei. Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Journal of Statistical Planning and Inference, Volume 86 (2000), pp 596–617.
D.R. Stinson and R. Wei. Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM Journal of Discrete Mathematics, Volume 11 (1998), pp 41–53.
D.R. Stinson, R. Wei and L. Zhu. New constructions for perfect hash families and related structures using combinatorial designs and codes. Journal of Combinatorial Designs, Volume 8 (2000), pp 189–200.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sarkar, P., Stinson, D.R. (2001). Frameproof and IPP Codes. In: Rangan, C.P., Ding, C. (eds) Progress in Cryptology — INDOCRYPT 2001. INDOCRYPT 2001. Lecture Notes in Computer Science, vol 2247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45311-3_12
Download citation
DOI: https://doi.org/10.1007/3-540-45311-3_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43010-0
Online ISBN: 978-3-540-45311-6
eBook Packages: Springer Book Archive