Hierarchical key assignment for black-box tracing with efficient ciphertext size

  • Authors:
  • Tatsuyuki Matsushita;Hideki Imai

  • Affiliations:
  • Corporate Research & Development Center, Toshiba Corporation, Kawasaki, Japan;Faculty of Science and Engineering, Chuo University, Bunkyo-ku, Tokyo, Japan

  • Venue:
  • ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a hierarchical key-assignment method to reduce the ciphertext size in a black-box tracing scheme presented at ASIACRYPT 2004. Applying the proposed method to this scheme, the ciphertext size is reduced from to O(k+log(n/k)) without a substantial increase in the decryption-key size, where k,n denote the maximum number of colluders in a coalition and the total number of receivers respectively. The resulting scheme also supports black-box tracing and enjoys the following properties: Even if a pirate decoder does not respond any further queries when it detects itself being examined, the pirate decoder can be traced back to a person who participated in its construction. A tracer's key, which is necessary for black-box tracing, is public.