A Tree Based One-Key Broadcast Encryption Scheme with Low Computational Overhead

Asano, Tomoyuki; Kamio, Kazuya

doi:10.1007/11506157_8

Cited by 4 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Asano [Asa02] and [AK05] proposed very interesting schemes with constant size private keys. Because private keys in these scheme are of constant size, one might think traitors cannot contribute a partial key information to the public and that pirates 2.0 can then be excluded.…”

Section: Framework Firstmentioning

confidence: 99%

“…This consideration might fail to cover attacks who can derive some partial decryption keys from a set of its key and then could use the partial key to break the security. al's schemes [Asa02,AK05]) keys corresponding to intermediate nodes in the tree. We also note that the previous schemes in the subset-cover framework are susceptible to pirate evolution attacks because each user can always possess (or derive, in Asano et.…”

Section: Definition 4 (Resistance To Pevoa) a System Is Susceptible mentioning

confidence: 99%

See 1 more Smart Citation

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: Framework Firstmentioning

confidence: 99%

Section: Definition 4 (Resistance To Pevoa) a System Is Susceptible mentioning

confidence: 99%

Provable Security

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Efficient Broadcast Encryption Scheme with Log-Key Storage

Hwang

Lee

2006

Financial Cryptography and Data Security

View full text Add to dashboard Cite

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

A Tree Based One-Key Broadcast Encryption Scheme with Low Computational Overhead

Cited by 4 publications

References 14 publications

Provable Security

Provable Security

Efficient Broadcast Encryption Scheme with Log-Key Storage

Identity-Based Trace and Revoke Schemes

Contact Info

Product

Resources

About