Mobile Networks and Management. 9th International Conference, MONAMI 2017, Melbourne, Australia, December 13-15, 2017, Proceedings

Research Article

A Variant of BLS Signature Scheme with Tight Security Reduction

  • @INPROCEEDINGS{10.1007/978-3-319-90775-8_13,
        author={Tiong-Sik Ng and Syh-Yuan Tan and Ji-Jian Chin},
        title={A Variant of BLS Signature Scheme with Tight Security Reduction},
        proceedings={Mobile Networks and Management. 9th International Conference, MONAMI 2017, Melbourne, Australia, December 13-15, 2017, Proceedings},
        proceedings_a={MONAMI},
        year={2018},
        month={5},
        keywords={BLS Signature Tight security reduction Provable security},
        doi={10.1007/978-3-319-90775-8_13}
    }
    
  • Tiong-Sik Ng
    Syh-Yuan Tan
    Ji-Jian Chin
    Year: 2018
    A Variant of BLS Signature Scheme with Tight Security Reduction
    MONAMI
    Springer
    DOI: 10.1007/978-3-319-90775-8_13
Tiong-Sik Ng1,*, Syh-Yuan Tan1,*, Ji-Jian Chin1,*
  • 1: Multimedia University
*Contact email: ng.tiong.sik@gmail.com, sytan@mmu.edu.my, jjchin@mmu.edu.my

Abstract

In 2001, Boneh, Lynn and Shacham designed a signature scheme using the properties of bilinear pairing from elliptic curve, and based its security under the Computational Diffie-Hellman (CDH) assumption. However, the security reduction is not tight as there is a loss of roughly , the number of sign queries. In this paper, we propose a variant of the BLS signature with tight security reduction based on the co-CDH assumption. Besides upgraded to the notion of strong existential unforgeability under chosen message attack, the variant is backward-compatible with the original BLS signature.