On Symmetric Designs and Binary 3-Frameproof Codes

Guo, Chuan; Stinson, Douglas R.; Trung, Tran van

doi:10.1007/978-3-319-17729-8_10

Cited by 1 publication

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Intuitively, the most interesting and difficult case is to study the properties of binary frameproof codes. The recent papers [14], [15], [19] have made some efforts on this aspect.…”

Section: Frameproof Codesmentioning

confidence: 99%

New results for traitor tracing schemes

Shangguan,

Ma,

2016

Preprint

View full text Add to dashboard Cite

In the last two decades, several classes of codes are introduced to protect the copyrighted digital data. They have important applications in the scenarios like digital fingerprinting and broadcast encryption schemes. In this paper we will discuss three important classes of such codes, namely, frameproof codes, parent-identifying codes and traceability codes. Various improvements concerning on several basic properties of these codes are presented.Firstly, suppose N (t) is the minimal integer such that there exists a binary t-frameproof code of length N with cardinality larger than N , we prove that N (t) ≥ 15+ √ 33 24 (t−2) 2 , which is a great improvement of the previously known bound N (t) ≥ t+12 . Moreover, we find that the determination of N (t) is closely related to a conjecture of Erdős, Frankl and Füredi posed in the 1980's, which implies the conjectured value N (t) = t 2 + o(t 2 ). Secondly, we derive a new upper bound for parent-identifying codes, which is superior than all previously known bounds. Thirdly, we present an upper bound for 3-traceability codes, which shows that a q-ary 3-traceability code of length N can have at most cq ⌈N/9⌉ codewords, where c is a constant only related to the code length N . It is the first meaningful upper bound for 3-traceability codes and our result supports a conjecture of Blackburn et al. posed in 2010.

show abstract

“…Intuitively, the most interesting and difficult case is to study the properties of binary frameproof codes. The recent papers [14], [15], [19] have made some efforts on this aspect.…”

Section: Frameproof Codesmentioning

confidence: 99%