T6 et al presented a bilinear-map-based traitor tracing scheme（TSZ scheme） with revocation, but it is a symmetric scheme because it does not provide non-repudiation. In this paper, an improved TSZ scheme was propose...T6 et al presented a bilinear-map-based traitor tracing scheme（TSZ scheme） with revocation, but it is a symmetric scheme because it does not provide non-repudiation. In this paper, an improved TSZ scheme was proposed by using oblivious polynomial evaluation （OPE） protocol and service parameters. Under the recondition of general sameness capabilities of both TSZ and improved TSZ scheme, the new scheme adds some advantages such as providing multi-service capability, user＇s non-repudiation and data provider＇s no-framing innocent users. Furthermore, it is also proved to be semantically secure under the decisional bilinear Diffie-Hellman （DBDH problem） assumption.展开更多
Traitor tracing schemes are introduced to combat the piracy scenarios. The notation of dynamic traitor tracing is proposed by Fiat and Tassa, which fights against rebroadcast of decrypted content. In this paper, using...Traitor tracing schemes are introduced to combat the piracy scenarios. The notation of dynamic traitor tracing is proposed by Fiat and Tassa, which fights against rebroadcast of decrypted content. In this paper, using the idea of searching user address level by level, a new dynamic traitor tracing scheme based on a multilevel structure of user set is constructed. The scheme proposed can efficiently combat with the immediate rebroadcast attack, and possesses lower tracing complexity. Importantly, the tracing scheme can be applicable to systems with different sizes of subscriber sets.展开更多
In the content distribution services,traitor tracing encryption schemes are useful tools to trace illegal users that distribute content illegally to unauthorized users.However,solo use of these schemes does not necess...In the content distribution services,traitor tracing encryption schemes are useful tools to trace illegal users that distribute content illegally to unauthorized users.However,solo use of these schemes does not necessarily work well and has vulnerability.To complement the property of the traitor tracing schemes,it is effective to use watermarking scheme with them and the watermarking schemes with light load are required.A number of video watermarking methods with light load have been proposed that embed information into compressed video streams.When the compression scheme is MPEG2-Video,its codes are mostly pre-defined using coding tables,and therefore,information can be embedded in the compressed stream by substituting some of the codes.On the other hand,HEVC/H.265 uses arithmetic coding(CABAC)and it is not easy to substitute one code for another in a stream.To deal with this problem,a watermarking scheme for HEVC/H.265 video streams is proposed.It embeds information while the video is being encoded.A broadcasting system incorporating the scheme is also proposed.展开更多
In this paper we introduce an architecture for a multi-key pirate decoder which employs decryption keys from multiple traitors. The decoder has built-in monitoring and self protection functionalities and is capable of...In this paper we introduce an architecture for a multi-key pirate decoder which employs decryption keys from multiple traitors. The decoder has built-in monitoring and self protection functionalities and is capable of defeating most multiple-round based traitor tracing schemes such as the schemes based on the black-box confirmation method. In particular, the proposed pirate decoder is customized to defeat the private key and the public key fully collusion resistant traitor tracing （FTT） schemes, respectively. We show how the decoder prolongs a trace process so that the tracer has to give up his effort. FTT schemes are designed to identify all the traitors. We show that decoder enables the FTT schemes to identify at most 1 traitors. Finally, assuming the decoder is embedded with several bytes of memory, we demonstrate how the decoder is able to frame innocent users at will.展开更多
The necessity and the feasibility of introducing attribute weight into digital fingerprinting system are given. The weighted algorithm for fingerprinting relational databases of traitor tracing is proposed. Higher wei...The necessity and the feasibility of introducing attribute weight into digital fingerprinting system are given. The weighted algorithm for fingerprinting relational databases of traitor tracing is proposed. Higher weights are assigned to more significant attributes, so important attributes are more frequently fingerprinted than other ones. Finally, the robustness of the proposed algorithm, such as performance against collusion attacks, is analyzed. Experimental results prove the superiority of the algorithm.展开更多
基金Supported by the National Natural Science Foundation of China (60372046)
文摘T6 et al presented a bilinear-map-based traitor tracing scheme（TSZ scheme） with revocation, but it is a symmetric scheme because it does not provide non-repudiation. In this paper, an improved TSZ scheme was proposed by using oblivious polynomial evaluation （OPE） protocol and service parameters. Under the recondition of general sameness capabilities of both TSZ and improved TSZ scheme, the new scheme adds some advantages such as providing multi-service capability, user＇s non-repudiation and data provider＇s no-framing innocent users. Furthermore, it is also proved to be semantically secure under the decisional bilinear Diffie-Hellman （DBDH problem） assumption.
基金Supported by the National Key Basic Research and Development Program(973 Program)(2012CB316103)
文摘Traitor tracing schemes are introduced to combat the piracy scenarios. The notation of dynamic traitor tracing is proposed by Fiat and Tassa, which fights against rebroadcast of decrypted content. In this paper, using the idea of searching user address level by level, a new dynamic traitor tracing scheme based on a multilevel structure of user set is constructed. The scheme proposed can efficiently combat with the immediate rebroadcast attack, and possesses lower tracing complexity. Importantly, the tracing scheme can be applicable to systems with different sizes of subscriber sets.
文摘In the content distribution services,traitor tracing encryption schemes are useful tools to trace illegal users that distribute content illegally to unauthorized users.However,solo use of these schemes does not necessarily work well and has vulnerability.To complement the property of the traitor tracing schemes,it is effective to use watermarking scheme with them and the watermarking schemes with light load are required.A number of video watermarking methods with light load have been proposed that embed information into compressed video streams.When the compression scheme is MPEG2-Video,its codes are mostly pre-defined using coding tables,and therefore,information can be embedded in the compressed stream by substituting some of the codes.On the other hand,HEVC/H.265 uses arithmetic coding(CABAC)and it is not easy to substitute one code for another in a stream.To deal with this problem,a watermarking scheme for HEVC/H.265 video streams is proposed.It embeds information while the video is being encoded.A broadcasting system incorporating the scheme is also proposed.
文摘In this paper we introduce an architecture for a multi-key pirate decoder which employs decryption keys from multiple traitors. The decoder has built-in monitoring and self protection functionalities and is capable of defeating most multiple-round based traitor tracing schemes such as the schemes based on the black-box confirmation method. In particular, the proposed pirate decoder is customized to defeat the private key and the public key fully collusion resistant traitor tracing （FTT） schemes, respectively. We show how the decoder prolongs a trace process so that the tracer has to give up his effort. FTT schemes are designed to identify all the traitors. We show that decoder enables the FTT schemes to identify at most 1 traitors. Finally, assuming the decoder is embedded with several bytes of memory, we demonstrate how the decoder is able to frame innocent users at will.
文摘The necessity and the feasibility of introducing attribute weight into digital fingerprinting system are given. The weighted algorithm for fingerprinting relational databases of traitor tracing is proposed. Higher weights are assigned to more significant attributes, so important attributes are more frequently fingerprinted than other ones. Finally, the robustness of the proposed algorithm, such as performance against collusion attacks, is analyzed. Experimental results prove the superiority of the algorithm.
