Design of Collusion-Free Hiding Codes using MAI-Free Principle

Cha, Byung-Ho; Kuo, C.-C. Jay

doi:10.1109/icassp.2007.366193

Cited by 9 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, a different user ID is assigned to a different spreading code and the system has a total number of 256 users by direct spreading without shifts. For results with the equal-weight collusion attack, we refer to [4], which shows that OSIFT codes can detect all colluders. For the unequal-weight collusion attack, we consider the following case.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…As a result of the weighted collusion attack, hiding codes of colluders from different groups experience MAI so that they are more difficult to detect. By following the work in [17,18], we have developed an anti-collusion code called OSIFT (Orthogonal Spreading followed by the Inverse Fourier Transform) [3][4][5]. The OSIFT code was initially proposed in [3].…”

Section: Introductionmentioning

confidence: 99%

“…The OSIFT code was initially proposed in [3]. Several variations of the OSIFT code were considered in [4]. The idea of shifted spreading to increase the user capacity was discussed in [5].…”

Section: Introductionmentioning

confidence: 99%

“…3, and the design of OSIFT spreading codes is discussed in Sect. 4. The detection analysis of OSIFT spreading codes is presented in Sect.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Design and Analysis of High-Capacity Anti-Collusion Hiding Codes

Cha

Kuo

2008

Circuits Syst Signal Process

Self Cite

View full text Add to dashboard Cite

A new methodology for the design of high-capacity anti-collusion hiding codes in a large-scale fingerprint-based traitor tracing system is proposed in this work. We consider a hiding code of MN bits, where M bits are used as the user ID and N bits are the length of the spreading codes. Since each user is assigned one out of 2 M ID numbers and one out of N spreading codewords, the total number of users is equal to 2 M N. To accommodate an even larger number of users, we propose a shifted spreading scheme that shifts the spreading codeword circularly by a certain amount. By allowing P shifts (with P mod N ), the total number of users increases from 2 M N to 2 M NP . When multiple users perform a weighted collusion attack, we show that the task of identifying colluders and their attack weights can be formulated as a user detection and channel estimation problem in a multiuser wireless communication system with a multipath fading channel. For the latter, there exist code design techniques that choose the spreading codes carefully so as to reduce multiaccess interference of users with different spreading codewords effectively. By exploiting this analogy, we develop an anti-collusion code called OSIFT (Orthogonal Spreading followed by the Inverse Fourier Transform). We compare several hiding codes in a fingerprinting system consisting of hundreds of colluders. It is demonstrated by computer simulation that, when the OSIFT code is adopted, colluders and their attack weights can be found by the proposed fingerprinting system more accurately.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%