ChinaCom2009-Network and Information Security Symposium

Research Article

A New Efficient Self-Certified One-Time Short Signature Scheme from Bilinear Pairings

  • @INPROCEEDINGS{10.1109/CHINACOM.2009.5339936,
        author={Renwang Su},
        title={A New Efficient Self-Certified One-Time Short Signature Scheme from Bilinear Pairings},
        proceedings={ChinaCom2009-Network and Information Security Symposium},
        publisher={IEEE},
        proceedings_a={CHINACOM2009-NIS},
        year={2009},
        month={11},
        keywords={One-time short signature self-certified bilinear pairing electronic cheque},
        doi={10.1109/CHINACOM.2009.5339936}
    }
    
  • Renwang Su
    Year: 2009
    A New Efficient Self-Certified One-Time Short Signature Scheme from Bilinear Pairings
    CHINACOM2009-NIS
    IEEE
    DOI: 10.1109/CHINACOM.2009.5339936
Renwang Su1,*
  • 1: Department of Information and Computing Science College of Statistics and Mathematics Zhejiang Gongshang University Hangzhou 310018, Zhejiang, China
*Contact email: srwang123@sina.com

Abstract

Recently, the self-certified public key system, due to its advantages, has been paid a great deal of attention. Over the past years, many self-certified digital signature schemes have been proposed. However, to the best of our current knowledge, self-certified one-time short signature has not been investigated till now. Therefore, in this paper, we would like to propose an efficient self-certified one-time short signature scheme from bilinear pairing techniques. Because of its one-timeness and unforgeability, the proposed scheme can be suitable for the electronic cheque scenario. Moreover, the size of the proposed signature scheme is as short as 160 bits since it is based on the BLS short scheme, which shows that the proposed scheme has a great advantage while the bandwidth of a communication channel is limited.