International Workshop on Public Key Cryptography

PKC 2004: Public Key Cryptography – PKC 2004 pp 277-290

An Efficient Signature Scheme from Bilinear Pairings and Its Applications

  • Fangguo Zhang
  • Reihaneh Safavi-Naini
  • Willy Susilo
Conference paper

DOI: 10.1007/978-3-540-24632-9_20

Volume 2947 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Zhang F., Safavi-Naini R., Susilo W. (2004) An Efficient Signature Scheme from Bilinear Pairings and Its Applications. In: Bao F., Deng R., Zhou J. (eds) Public Key Cryptography – PKC 2004. PKC 2004. Lecture Notes in Computer Science, vol 2947. Springer, Berlin, Heidelberg

Abstract

In Asiacrypt2001, Boneh, Lynn, and Shacham [8] proposed a short signature scheme (BLS scheme) using bilinear pairing on certain elliptic and hyperelliptic curves. Subsequently numerous cryptographic schemes based on BLS signature scheme were proposed. BLS short signature needs a special hash function [6,1,8]. This hash function is probabilistic and generally inefficient. In this paper, we propose a new short signature scheme from the bilinear pairings that unlike BLS, uses general cryptographic hash functions such as SHA-1 or MD5, and does not require special hash functions. Furthermore, the scheme requires less pairing operations than BLS scheme and so is more efficient than BLS scheme. We use this signature scheme to construct a ring signature scheme and a new method for delegation. We give the security proofs for the new signature scheme and the ring signature scheme in the random oracle model.

Keywords

Short signatureBilinear pairingsID-based cryptographyRing signatureProxy signature
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Fangguo Zhang
    • 1
  • Reihaneh Safavi-Naini
    • 1
  • Willy Susilo
    • 1
  1. 1.School of Information Technology and Computer ScienceUniversity of WollongongAustralia