Call for Papers - Ongoing round of submission, notification and publication.
    
  
Home    |    Login or Register    |    Contact CSC
By Title/Keywords/Abstract   By Author
Browse CSC-OpenAccess Library.
  • HOME
  • LIST OF JOURNALS
  • AUTHORS
  • EDITORS & REVIEWERS
  • LIBRARIANS & BOOK SELLERS
  • PARTNERSHIP & COLLABORATION
Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available
(no registration required)

(98.85KB)


-- CSC-OpenAccess Policy
-- Creative Commons Attribution NonCommercial 4.0 International License
>> COMPLETE LIST OF JOURNALS

EXPLORE PUBLICATIONS BY COUNTRIES

EUROPE
MIDDLE EAST
ASIA
AFRICA
.............................
United States of America
United Kingdom
Canada
Australia
Italy
France
Brazil
Germany
Malaysia
Turkey
China
Taiwan
Japan
Saudi Arabia
Jordan
Egypt
United Arab Emirates
India
Nigeria
An ID-based Blind Signature Scheme from Bilinear Pairings
B.Umaprasada Rao, K.A.Ajmath
Pages - 98 - 106     |    Revised - 25-02-2010     |    Published - 31-03-2010
Published in International Journal of Computer Science and Security (IJCSS)
Volume - 4   Issue - 1    |    Publication Date - March 2010  Table of Contents
MORE INFORMATION
References   |   Cited By (1)   |   Abstracting & Indexing
KEYWORDS
Public key cryptography, Blind signature scheme, Hess ID based digital signature scheme, Bilinear pairing, CDH problem
ABSTRACT
Blind signatures, introduced by Chaum, allow a user to obtain a signature on a message without revealing any thing about the message to the signer. Blind signatures play on important role in plenty of applications such as e-voting, e-cash system where anonymity is of great concern. Identity based(ID-based) public key cryptography can be a good alternative for certified based public key setting, especially when efficient key management and moderate security are required. In this paper, we propose an ID-based blind signature scheme from bilinear pairings. The proposed scheme is based on the Hess ID- based digital signature scheme. Also we analyze security and efficiency of the proposed scheme.
CITED BY (1)  
1 R. Shakerian, T. M. Pour, S.H. Kamali and M. Hedayati, “An Identity Based Public Key Cryptography Blind Signature Scheme from Bilinear Pairings”, in Proceedings, Computer Science and Information Technology, 3rd IEEE International Conference, Chengdu, pp. 28-32, 9-11 July 2010.
ABSTRACTING & INDEXING
1 Google Scholar 
2 Academic Journals Database 
3 ScientificCommons 
4 CiteSeerX 
5 iSEEK 
6 Socol@r  
7 ResearchGATE 
8 Libsearch 
9 Bielefeld Academic Search Engine (BASE) 
10 Scribd 
11 WorldCat 
12 SlideShare 
13 PDFCAST 
14 PdfSR 
REFERENCES
A,Shamir, “Identity-based cryptosystems and signature schemes”, In Proc. of CRYPTO’84, LNCS 196, pp. 47-53 Springer-verlag, 1984.
A. Juels, M. Luby and R. Ostrovsky, “Security of blind digital signatures”, Advances in Cryptology- Crypto 97, LNCS 1294, pp.150-164, Springer-Verlag, 1997.
A.Joux, “A one round protocol for tripartite diffie-Hellman” In proc.of ANTS-IV, LNCS 1838, pp.385- 394, Springer-Verlag, 2000.
C.P. Schnorr, “Efficient Identification and Signatures for Smart cards”, In G.Brassard(ed), In proceedings of CRYPTO 1989, Springer-Verlag,LNCS 435,pp.239-252,1990.
D. Chaum, “Blind signatures for untraceable payments”, In Proc. CRYPTO 82, pp.199-203, NY, Plenum, 1983.
D. Pointcheval and J. Stern, “Security arguments for digital signatures and blind Signatures”, Journal of Cryptology, Vol.13, No.3, pp.361-396, 2000.
D.Boneh and M.Franklin, “Identity-based encryption from the Weil pairing”, In Proc.of CRYPTO’01, LNCS 2139, pp.213-229, Springer-verlag, 2001.
D.Pointcheval and J.Stern, “New Blind Signature Signatures Equilent to Factorization”, In proceedings of the 4th ACM Conference on Computer and Communications Security, pp.92-99, Zurich, Switzerland, 1997.
D.Pointcheval and J.Stern, “Provably Secure Blind signature Schemes”, In Advances in Cryptology – ASIACRYPT 1992, Springer-Verlag, LNCS 1163, pp.252-26,1992.
F. Hess, “Efficient identity based signature schemes based on pairings”, SAC 2002, LNCS2595, pp.310-324, Springer-Verlag, 2002.
F. Zhang and K. Kim, “Efficient ID-based blind signature and proxy signature from bilinear pairings”, ACISP 03, LNCS 2727, pp. 312-323, Springer-Verlag, 2003.
F. Zhang and K. Kim, “ID-based blind signature and ring signature from pairings”, Proc. of Asiacrpt 2002, LNCS 2501, pp. 533-547, Springer-Verlag, 2002.
P.S.L.M.Barreto, H.Y.Kim, B.Lynn and M.Scott, “Efficient algorithms for pairing- based cryptosystems”, Advances in Cryptology-Crypto 2002, LNCS 2442, pp.354-368, Springer-Verlag, 2002.
S.D.Galbraith, K. Harrison, and D.Soldera, “Implementing the Tate pairing”, ANTS 2002, LNCS 2369, pp.324-337, Springer-Verlag, 2002.
T.Okamoto, “Provable, Secure and Practical Identification Schemes and Corresponding signature schemes”, In Advances in Cryptology-CRYPTO 1984, Springer-Verlag, LNCS 740, pp.31-53,1992.
MANUSCRIPT AUTHORS
Mr. B.Umaprasada Rao
Andhra University - India
buprasadcrypt@gmail.com
Mr. K.A.Ajmath
Sri Venkateswara Universirty - India


CREATE AUTHOR ACCOUNT
 
LAUNCH YOUR SPECIAL ISSUE
View all special issues >>
 
PUBLICATION VIDEOS
 
You can contact us anytime since we have 24 x 7 support.
Join Us|List of Journals|
    
Copyrights © 2025 Computer Science Journals (CSC Journals). All rights reserved. Privacy Policy | Terms of Conditions