Random-Error Resilience of a Short Collusion-Secure Code

• YOSHIOKA Katsunari

  Graduate School of Environment and Information Sciences, Yokohama National University

• MATSUMOTO Tsutomu

  Graduate School of Environment and Information Sciences, Yokohama National University

抄録

The c-Secure CRT code is a collusion-secure fingerprinting code whose code length is reduced by using the Chinese Remainder Theorem. The tracing algorithm for the c-secure CRT code drops its performance of traitor tracing when random errors are added to the codewords. In this paper, we show two ap-proaches to enhance random-error-resilience to the tracing algorithm of the c-secure CRT code. The first approach is introducing thresholds for the distinction of the detected part of the embedded data called detected blocks. We propose, a method to derive appropriate values of the thresholds on an assumption that the tracer can estimate the random error rate, This modification extends the capability of traitor tracing to the attacks in which the alteration rate of the detected blocks is not fixed to 0.5. The second approach is extending the scope of the search for the detected blocks. With numerical results by computer simulations, we confirmed an impressive improvement of random-error-resilience of a c-secure CRT code.

収録刊行物

• IEICE transactions on fundamentals of electronics, communications and computer sciences

  IEICE transactions on fundamentals of electronics, communications and computer sciences 86 (5), 1147-1155, 2003-05-01

  一般社団法人電子情報通信学会

キーワード

• fingerprinting
• collusion attack
• collusion-secure code

詳細情報

• CRID: 1573950402085497088
• NII論文ID: 110003221189
• NII書誌ID: AA10826239
• ISSN: 09168508
• 本文言語コード: en
• データソース種別:
  • CiNii Articles