Skip to Main content Skip to Navigation
Conference papers

A Signature Scheme Based on Implicit and Explicit Certificates Against k-Traitors Collusion Attack

Abstract : In 2002, Mitsunari, Sakai and Kasahara formulated the Collusion Attack Algorithm with k traitors (known as k-CAA problem) and used it to develop the first traitor tracing scheme based on the bilinear pairings. Traitor tracing scheme is needed to discourage legitimate subscribers from sharing their secret keys to construct pirate decoders. In this paper, we propose a first signature scheme (IE-CBS-kCAA) based on k-CAA problem, which belongs to the fourth category of PKC schemes: the public key cryptography schemes based on an implicit and explicit certificates. The security analysis proves that our IE-CBS-kCAA scheme is secure against two game attacks in the random oracle model. The security is closely related to the difficulty of solving the modified k-CAA and discrete logarithm problems.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01656248
Contributor : Hal Ifip <>
Submitted on : Tuesday, December 5, 2017 - 2:58:57 PM
Last modification on : Wednesday, December 6, 2017 - 1:21:00 AM

File

448933_1_En_55_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Tomasz Hyla, Jerzy Pejaś. A Signature Scheme Based on Implicit and Explicit Certificates Against k-Traitors Collusion Attack. 16th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Jun 2017, Bialystok, Poland. pp.638-651, ⟨10.1007/978-3-319-59105-6_55⟩. ⟨hal-01656248⟩

Share

Metrics

Record views

162

Files downloads

85