Probabilistic Existence Results for Parent-Identifying Schemes

Yujie Gu, Minquan Cheng, Grigory Kabatiansky, Ying Miao

研究成果: ジャーナルへの寄稿学術誌査読

11 被引用数 (Scopus)

抄録

Parent-identifying schemes provide a way to identify causes from effects for some information systems, such as digital fingerprinting and group testing. In this paper, we consider the combinatorial structures for parent-identifying schemes. First, we establish an equivalent relationship between the parent-identifying schemes and forbidden configurations. Based on this relationship, we derive the probabilistic existence lower bounds for two related combinatorial structures, that is, t -parent-identifying set systems ( t -IPPS) and t -multimedia parent-identifying codes ( t -MIPPC), which are used in broadcast encryption and multimedia fingerprinting, respectively. The probabilistic lower bound for the maximum size of a t -IPPS has the asymptotically optimal order of magnitude in many cases, and that for t -MIPPC provides the asymptotically optimal code rate when t=2 and the best known asymptotic code rate when t\ge 3. Furthermore, we analyze the structure of 2-IPPS and prove some bounds for certain cases.

本文言語英語
論文番号8756061
ページ(範囲)6160-6170
ページ数11
ジャーナルIEEE Transactions on Information Theory
65
10
DOI
出版ステータス出版済み - 10月 2019
外部発表はい

!!!All Science Journal Classification (ASJC) codes

  • 情報システム
  • コンピュータ サイエンスの応用
  • 図書館情報学

フィンガープリント

「Probabilistic Existence Results for Parent-Identifying Schemes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル