CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A New Short Signature Scheme from Weil Pairing

by Subhas Chandra Sahana, Somen Debnath, Bubu Bhuyan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 126 - Number 14
Year of Publication: 2015
Authors: Subhas Chandra Sahana, Somen Debnath, Bubu Bhuyan
10.5120/ijca2015906288

Subhas Chandra Sahana, Somen Debnath, Bubu Bhuyan . A New Short Signature Scheme from Weil Pairing. International Journal of Computer Applications. 126, 14 ( September 2015), 5-8. DOI=10.5120/ijca2015906288

@article{ 10.5120/ijca2015906288,
author = { Subhas Chandra Sahana, Somen Debnath, Bubu Bhuyan },
title = { A New Short Signature Scheme from Weil Pairing },
journal = { International Journal of Computer Applications },
issue_date = { September 2015 },
volume = { 126 },
number = { 14 },
month = { September },
year = { 2015 },
issn = { 0975-8887 },
pages = { 5-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume126/number14/22618-2015906288/ },
doi = { 10.5120/ijca2015906288 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:17:26.380200+05:30
%A Subhas Chandra Sahana
%A Somen Debnath
%A Bubu Bhuyan
%T A New Short Signature Scheme from Weil Pairing
%J International Journal of Computer Applications
%@ 0975-8887
%V 126
%N 14
%P 5-8
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Currently, short signature is receiving significant attention since it is particularly useful in low-bandwidth communication environments. In this paper, a short signature scheme is proposed from weil pairing. The proposed scheme is efficient as lesser number of cost effective pairing operations involved. We analyze security and efficiency comparison of the proposed scheme with other short signature schemes.

References
  1. Boneh, Dan, Ben Lynn, and Hovav Shacham. "Short signatures from the Weil pairing." Advances in Cryptology—ASIACRYPT 2001. Springer Berlin Heidelberg, 2001. 514-532.
  2. FIPS 186. Digital Signature Algorithm, 1994.
  3. F. Zhang, R. Safavi-Naini and W. Susilo, 2004, “An efficient signature scheme from bilinear pairings and its applications”, PKC 2004 Singapore. LNCS, Springer-Verlag..
  4. SedatAkleylek, Barıs Bulent Kırlar,2011, ¨Omer Sever, and ZalihaY¨uce, Short Signature Scheme From Bilinear Pairings.Journal of telecommunication and information technology.
  5. Sharma Neetu, and Birendra Kumar Sharma. "New Short Signature Scheme with Weil Pairing." International Journal of Computer Applications 94.10 (2014): 25-28..
  6. Hoffstein, Jeffrey, et al. An introduction to mathematical cryptography. New York: Springer, 2008.
  7. V.S.Miller,1986 Use of elliptic curves in cryptography, Advances in Cryptology-Proceedings of Crypto85, LNCS, vol. 218, Springer.
  8. Washington, Lawrence C. Elliptic curves: number theory and cryptography. CRC press, 2008.
  9. J.H.Silverman, 1986, The arithmetic of elliptic curves, volume 106 of graduate texts in mathematics, springer-verlag,Newyork 1986.
Index Terms

Computer Science
Information Sciences

Keywords

short signature elliptic curve cryptosystem weil pairing

Powered by PhDFocusTM