Pairing-Based Signature Scheme with Strong Security and Tight Reduction

Provided by: Binary Information Press
Topic: Security
Format: PDF
Based on bilinear pairings, by combining four secret components as the signing key and correspondingly generating two public parameters as the public key, a new signature scheme is proposed. This scheme is proved to be secure against forgery under adaptive chosen-message attacks under the hardness assumption of Computing Diffie-Hellman Problem (CDHP). The security proof of the authors' scheme has a tight reduction, which shows an explicit bound on the adversary's success probability. To make the scheme have a stronger security, the bad case, which is different to adaptive chosen-message attack, is considered.

Find By Topic