A New Short Signature Scheme with Random Oracle from Bilinear Pairings

Authors

  • Sedat Akleylek
  • Bariş Bülent Kırlar
  • Ömer Sever
  • Zaliha Yüce

DOI:

https://doi.org/10.26636/jtit.2011.1.1125

Keywords:

bilinear Diffie-Hellman problem, bilinear pairings, ring signature, short signature

Abstract

In this paper, we propose a new and efficient short signature scheme from the bilinear pairings. Our scheme is constructed by bilinear inverse-square Diffie-Hellman problem (BISDHP) and does not require any special hash function. The exact security proofs are also explained in the random Oracle model. We give the implementation and comparison results of our proposed signature scheme with the signature scheme proposed by Boneh, Lynn, Shacham (BLS) and Zhang, Safavi, Susilo (ZSS). Furthermore, we use this signature scheme to construct a ring signature scheme.

Downloads

Download data is not yet available.

Downloads

Published

2011-03-30

Issue

No. 1 (2011)

Section

ARTICLES FROM THIS ISSUE

License

Copyright (c) 2023 Journal of Telecommunications and Information Technology

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
S. Akleylek, B. B. Kırlar, Ömer Sever, and Z. Yüce, “A New Short Signature Scheme with Random Oracle from Bilinear Pairings”, JTIT, vol. 43, no. 1, pp. 5–10, Mar. 2011, doi: 10.26636/jtit.2011.1.1125.