A tight bound for frameproof codes viewed in terms of separating hash families
详细信息 查看全文
- 作者：Tran van Trung (1)
- 关键词：Frameproof code ; Separating hash family ; Tight bound ; 68R05
- 刊名：Designs, Codes and Cryptography
- 出版年：2014
- 出版时间：September 2014
- 年：2014
- 卷：72
- 期：3
- 页码：713-718
- 全文大小：
- 参考文献：1. Bazrafshan M., van Trung T.: Bounds for separating hash families. J. Comb. Theory Ser. A 118, 1129鈥?135 (2011)
2. Bazrafshan M.: Separating hash families, PhD thesis, University of Duisburg-Essen (2011)
3. Bazrafshan M., van Trung T.: Improved bounds for separating hash families. Des. Codes Cryptogr. (2012). doi:10.1007/s10623-012-9673-7
4. Blackburn S.R.: Frameproof codes. SIAM J. Discret. Math. 16(3), 499鈥?10 (2003)
5. 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鈥?256 (2008)
6. Boneh D., Shaw J.: Collusion-free fingerprinting for digital data. IEEE Trans. Inf. Theory 44, 1897鈥?905 (1998)
7. Bush K.A.: A generalization of a theorem due to MacNeish. Ann. Math. Stat. 23, 293鈥?95 (1952)
8. Bush K.A.: Orthogonal arrays of index unity. Ann. Math. Stat. 23, 426鈥?34 (1952)
9. Chor B., Fiat A., Naor M.: Tracing traitors, in advances in cryptology鈥擟RYPTO鈥?4. In: Desmedt, Y.G. (ed.) Lecture Notes in Computer Science, pp. 257鈥?70. 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鈥揙ctober 1, pp. 985鈥?90 (2010)
11. Colbourn C.J., Horsley D., McLean C.: Compressive sensing matrices and hash families. Trans. Commun. 59(7), 1840鈥?845 (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鈥擟RYPTO鈥?9. In: Weiner M. (ed.) Lecture Notes in Computer Science, vol. 1666, pp. 354鈥?71. 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鈥?40 (2006)
15. Sarkar P., Stinson D.R.: Frameproof and IPP codes, progress in cryptology鈥擨ndocrypt. In: Pandu Rangan聽C., Ding C. (eds.) Lecture Notes in Computer Science, vol. 2247, pp. 117鈥?26. 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鈥?049 (2001)
17. Stinson D.R., Wei R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discret. Math. 11, 41鈥?3 (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鈥?17 (2000)
19. Stinson D.R., Wei R., Chen K.: On generalized separating hash families. J. Comb. Theory Ser. A 115, 105鈥?20 (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鈥?514 (2008) - 作者单位：Tran van Trung (1)
1. Institut f眉r Experimentelle Mathematik, Universit盲t Duisburg-Essen, Ellernstrasse 29, 45326, 聽Essen, Germany - ISSN：1573-7586
文摘
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.