nach oben

Designs, Codes and Cryptography

Erschienen in:

01.09.2014

A tight bound for frameproof codes viewed in terms of separating hash families

verfasst von: Tran van Trung

Erschienen in: Designs, Codes and Cryptography | Ausgabe 3/2014

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Frameproof codes have been introduced for use in digital fingerprinting that prevent a coalition of \(w\) or fewer legitimate users from constructing a fingerprint of another user not in the coalition. It turns out that \(w\)-frameproof codes are equivalent to separating hash families of type \(\{1,w\}\). In this paper we prove a tight bound for frameproof codes in terms of separating hash families.

Vorheriger Artikel List decoding of number field codes

Nächster Artikel Naive configurations

Bazrafshan M., van Trung T.: Bounds for separating hash families. J. Comb. Theory Ser. A 118, 1129–1135 (2011)

Bazrafshan M.: Separating hash families, PhD thesis, University of Duisburg-Essen (2011)

Bazrafshan M., van Trung T.: Improved bounds for separating hash families. Des. Codes Cryptogr. (2012). doi:10.1007/s10623-012-9673-7

Blackburn S.R.: Frameproof codes. SIAM J. Discret. Math. 16(3), 499–510 (2003)

Blackburn S.R., Etzion T., Stinson D.R., Zaverucha G.M.: A bound on the size of separating hash families. J. Comb. Theory Ser. A 115, 1246–1256 (2008)

Boneh D., Shaw J.: Collusion-free fingerprinting for digital data. IEEE Trans. Inf. Theory 44, 1897–1905 (1998)

Bush K.A.: A generalization of a theorem due to MacNeish. Ann. Math. Stat. 23, 293–295 (1952)

Bush K.A.: Orthogonal arrays of index unity. Ann. Math. Stat. 23, 426–434 (1952)

Chor B., Fiat A., Naor M.: Tracing traitors, in advances in cryptology—CRYPTO’94. In: Desmedt, Y.G. (ed.) Lecture Notes in Computer Science, pp. 257–270. Springer, Berlin (1994)

10.

Colbourn C.J., Horsley D., Syrotiuk V.R. Frameproof codes and compressive sensing. In: Forty-Eighth Annual Allerton Conference, Allerton House, UIUC, Illinois, USA, September 29–October 1, pp. 985–990 (2010)

11.

Colbourn C.J., Horsley D., McLean C.: Compressive sensing matrices and hash families. Trans. Commun. 59(7), 1840–1845 (2011)

12.

Colbourn C.J., Dinitz J.H. (eds.): The CRC Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall/CRC, Boca Raton, FL (2007)

13.

Fiat A., Tassa T.: Dynamic traitor tracing, in advances in cryptology—CRYPTO’99. In: Weiner M. (ed.) Lecture Notes in Computer Science, vol. 1666, pp. 354–371. Springer, Berlin (1999)

14.

Li P.C., Wei R., van Rees G.H.J.: Constructions of 2-cover-free families and related separating hash families. J. Comb. Des. 14, 423–440 (2006)

15.

Sarkar P., Stinson D.R.: Frameproof and IPP codes, progress in cryptology—Indocrypt. In: Pandu Rangan C., Ding C. (eds.) Lecture Notes in Computer Science, vol. 2247, pp. 117–126. Springer, Berlin (2001)

16.

Staddon J.N., Stinson D.R., Wei R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47, 1042–1049 (2001)

17.

Stinson D.R., Wei R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discret. Math. 11, 41–53 (1998)

18.

Stinson D.R., van Trung T., Wei R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Stat. Plan. Inference 86, 595–617 (2000)

19.

Stinson D.R., Wei R., Chen K.: On generalized separating hash families. J. Comb. Theory Ser. A 115, 105–120 (2008)

20.

Stinson D.R., Zaverucha G.M.: Some improved bounds for secure frameproof codes and related separating hash families. IEEE Trans. Inf. Theory 54, 2508–2514 (2008)

Titel: A tight bound for frameproof codes viewed in terms of separating hash families
verfasst von: Tran van Trung
Publikationsdatum: 01.09.2014
Verlag: Springer US
Erschienen in: Designs, Codes and Cryptography / Ausgabe 3/2014
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI: https://doi.org/10.1007/s10623-013-9800-0

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 3/2014

Codes over an infinite family of rings with a Gray map

Proper circulant weighing matrices of weight

A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the Reed–Muller code

Kirkman frames having hole type for

The structure of quaternary quantum caps

On the non-existence of maximal difference matrices of deficiency 1