Traitor Tracing against Public Collaboration

Zhao, Xingwen; Zhang, Fangguo

doi:10.1007/978-3-642-21031-0_23

Cited by 7 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, in a recently proposed work [ZZ11], the authors also proposed a method to deal with pirates 2.0 in code-based schemes. In fact, their method is essentially similar to the method in [ADML + 07] except that they split the second level in [ADML + 07] into L levels (L is the length of code).…”

Section: Related Workmentioning

confidence: 99%

Provable Security

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

that were accepted to the academic track of the conference. The Program Committee also invited two distinguished researchers to deliver their keynote talks. The first speaker was Jens Groth from University College London, UK. His talk was entitled "Optimal Structure-Preserving Signatures." The second speaker was Vipul Goyal from Microsoft Research, India. His talk was entitled "Secure Composition of Cryptographic Protocols."The conference received 75 submissions this year. Each paper was assigned to four referees and we tried our best to ensure that each paper received a thorough and fair review. We are indebted to the members of the Program Committee and the external reviewers for all their hard work. The committee accepted 22 regular papers and 4 short papers to be included in the conference program. These proceedings contain revised versions of the accepted papers. While revisions are expected to take the referees' comments into account, this was not enforced and the authors bear full responsibility for the content of their papers.In addition to the academic track, the conference hosted a non-archival technical track whose papers were also carefully selected from among the submissions.

show abstract

Section: Related Workmentioning

confidence: 99%

Provable Security

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We compare our scheme with several codes based schemes [2,3,5,6,7,8,9] in Table 1. In the comparison, all schemes are assumed to employ codewords of the same length L. In schemes that did not mention the employed public key encryption scheme (such as [5] and [6]), we assume that secure ElGamal encryption over a cyclic group of a large prime order p is used.…”

Section: Efficiency Analysismentioning

confidence: 99%

“…Chor et al [1] presented the first traitor tracing scheme against pirate decoders. Since then, many traitor tracing schemes against pirate decoders have been proposed and among them there is a kind of traitor tracing schemes called codes based schemes (such as [2,3,4,5,6,7,8]). In these schemes, each user is assigned decryption keys according to each bit of his/her codeword.…”

Section: Introductionmentioning

confidence: 99%

Fully Secure Codes Based Tracing and Revoking Scheme with Constant Ciphertext

Zhao

2014

AMM

View full text Add to dashboard Cite

In broadcast encryption system certain users may leak their decryption keys to build pirate decoders, so traitor tracing is quite necessary. There exist many codes based traitor tracing schemes. As pointed out by Billet and Phan in ICITS 2008, these schemes lack revocation ability. The ability of revocation can disable identified malicious users and users who fail to fulfill the payments, so that the broadcast encryption system can be more practical. Recently, Zhao and Li presented a construction of codes based tracing and revoking scheme which achieves user revocation as well as traitor tracing. However, their scheme is only secure against chosen plaintext attacks under selective-adversary model with random oracle. In this paper, we obtain a new construction of codes based tracing and revoking scheme which is proved secure against chosen ciphertext attacks under adaptive-adversary model without random oracle. Our idea is to insert codeword into Boneh and Hamburgs identity based broadcast encryption scheme to retain the ability of user revocation and use Boneh and Naors method to trace traitors. Our fully secure scheme is roughly as efficient as Zhao and Lis scheme while the security is enhanced.

show abstract

Identity-Based Trace and Revoke Schemes

Phan

Trinh

2011

Provable Security

View full text Add to dashboard Cite

International audienceTrace and revoke systems allow for the secure distribution of digital content in such a way that malicious users, who collude to produce pirate decoders, can be traced back and revoked from the system. In this paper, we consider such schemes in the identity-based setting, by extending the model of identity-based traitor tracing scheme by Abdalla et al. to support revocation.The proposed constructions rely on the subset cover framework. We first propose a generic construction which transforms an identity-based encryption with wildcard (WIBE) of depth log(N) (N being the number of users) into an identity-based trace and revoke scheme by relying on the complete subtree framework (of depth log(N)). This leads, however, to a scheme with log(N) private key size (as in a complete subtree scheme). We improve this scheme by introducing generalized WIBE (GWIBE) and propose a second construction based on GWIBE of two levels. The latter scheme provides the nice feature of having constant private key size (3 group elements).In our schemes, we also deal with advanced attacks in the subset cover framework, namely pirate evolution attacks (PEvoA) and pirates 2.0. The only known strategy to protect schemes in the subset cover framework against pirate evolution attacks was proposed by Jin and Lotspiech but decreases seriously the efficiency of the original schemes: each subset is expanded to many others subsets; the total number of subsets to be used in the encryption could thus be O(N1/b) to prevent a traitor from creating more than b generations. Our GWIBE based scheme, resisting PEvoA better than the Jin and Lotspiech's method. Moreover, our method does not need to change the partitioning procedure in the original complete subtree scheme and therefore, the resulted schemes are very competitive compared to the original scheme, with r log(N/r) logN-size ciphertext and constant size private key

show abstract

Traitor Tracing against Public Collaboration

Cited by 7 publications

References 27 publications

Provable Security

Provable Security

Fully Secure Codes Based Tracing and Revoking Scheme with Constant Ciphertext

Identity-Based Trace and Revoke Schemes

Contact Info

Product

Resources

About