A Signature Scheme Based on Implicit and Explicit Certificates Against k-Traitors Collusion Attack - Computer Information Systems and Industrial Management (CISIM 2017) Access content directly
Conference Papers Year : 2017

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.
Fichier principal
Vignette du fichier
448933_1_En_55_Chapter.pdf (938.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01656248 , version 1 (05-12-2017)

Licence

Attribution

Identifiers

Cite

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⟩
129 View
123 Download

Altmetric

Share

Gmail Facebook X LinkedIn More