Combinatorial properties and constructions of traceability schemes and frameproof codes

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 1, 1998, Pages 41-53

  Stinson, D R ^a   Wei, R ^b  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Frameproof code; Hash family; t design; Traceability scheme

Indexed keywords

EID: 0002016098     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480196304246     Document Type: Article

References (13)

1. N. ALON, Explicit construction of exponential sized family of k-independent sets, Discrete Math., 58 (1986), pp. 191-193.
2. N. ALON AND M. NAOR, Derandomization, Witnesses for Boolean Matrix Multiplication and Constructions of Perfect Hash Functions, Technical Report CS94-11, Weizmann Institute of Science, Rehovot, Israel.
3. M. ATICI, S. S. MAGLIVERAS, D. R. STINSON, AND W.-D. WEI, Some recursive constructions for perfect hash families, J. Combin. Designs, 4 (1996), pp. 353-363.
4. D. BONEH AND J. SHAW, Collusion-secure fingerprinting for digital data, in Advances in Cryptology-CRYPTO '95, D. Coppersmith, ed., Lecture Notes in Comput. Sci. 963, SpringerVerlag, Berlin, 1995, pp. 452-465.
5. J. T. BRASSIL, S. Low, N. F. MAXEMCHUK, AND L. O'GORMAN, Electronic marking and identification techniques to discourage document copying, IEEE J. Selected Areas in Communications, 13 (1995), pp. 1495-1503.
6. M. CARAGIU, On a class of constant weight codes, Electronic J. Combin., 3 (1996), # R4, http://www.combinatorics.org.
7. Y. M. CHEE, Turán-type Problems in Group Testing, Coding Theory and Cryptography, Ph.D. thesis, University of Waterloo, Waterloo, Ontario, Canada, 1996.
8. B. CHOR, A. FIAT, AND M. NAOR, Tracing traitors, in Advances in Cryptology-CRYPTO '94, Y. G. Desmedt, ed., Lecture Notes in Computer Science, 839 (1994), pp. 257-270.
9. C. J. COLBOURN AND J. H. DINITZ, EDS., CRC Handbook of Combinatorial Designs, CRC Press, Inc., Boca Raton, FL, 1996.
10. P. ERDÖS, P. FRANKL, AND Z. FÜREDI, Families a finite sets in which no set is covered by the union of r others, Israel J. Math., 51 (1985), pp. 79-89.
11. J. H. VAN LINT AND R. M. WILSON, A Course in Combinatorics, Cambridge University Press, Cambridge, 1992.
12. K. MEHLHORN, Data Structures and Algorithms, Vol. 1., Springer-Verlag, New York, 1984.
13. A. SHAMIR, How to share a secret, Comm. ACM, 22 (1979), pp. 612-613.