Bounds on Traceability Schemes

Yujie Gu, Ying Miao

研究成果: Contribution to journalArticle査読

11 被引用数 (Scopus)

抄録

The Stinson-Wei traceability scheme (known as traceability scheme) was proposed for broadcast encryption as a generalization of the Chor-Fiat-Naor traceability scheme (known as traceability code). Cover-free family was introduced by Kautz and Singleton in the context of binary superimposed code. In this paper, we find a new relationship between a traceability scheme and a cover-free family, which strengthens the anti-collusion strength from t to t2, i.e., a t-traceability scheme is a t2-cover-free family. Based on this interesting discovery, we derive new upper bounds for traceability schemes. By using combinatorial structures, we construct several infinite families of optimal traceability schemes, which attain our new upper bounds. We also provide a constructive lower bound for traceability schemes, the size of which has the same order of magnitude as our general upper bound. Meanwhile, we consider parent-identifying set systems, an anti-collusion key-distributing scheme requiring weaker conditions than traceability scheme but stronger conditions than cover-free family. A new upper bound is also given for parent-identifying set systems.

本文言語英語
ページ(範囲)3450-3460
ページ数11
ジャーナルIEEE Transactions on Information Theory
64
5
DOI
出版ステータス出版済み - 5 2018
外部発表はい

All Science Journal Classification (ASJC) codes

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

フィンガープリント

「Bounds on Traceability Schemes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル