List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
An ID-based Blind Signature Scheme from Bilinear Pairings
Full text
 PDF(98.8KB)
Source 
International Journal of Computer Science and Security (IJCSS)
Table of Contents
Download Complete Issue    PDF(3.86MB)
Volume:  4    Issue:  1
Pages:  1-148
Publication Date:   March 2010
ISSN (Online): 1985-1553
Pages 
98 - 106
Author(s)  
B.Umaprasada Rao - India
K.A.Ajmath - India
 
Published Date   
31-03-2010 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   Public key cryptography, Blind signature scheme, Hess ID based digital signature scheme, Bilinear pairing, CDH problem 
 
 
This Manuscript is indexed in the following databases/websites:-
1. Directory of Open Access Journals (DOAJ)
2. Scribd
3. Docstoc
4. PDFCAST
5. Google Scholar
6. CiteSeerX
7. ScientificCommons
8. WorldCat
9. Bielefeld Academic Search Engine (BASE)
10. ResearchGATE
11. Socol@r
12. iSEEK
13. Academic Journals Database
14. Libsearch
15. slideshare
 
 
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.  
 
 
 
1 D. Chaum, “Blind signatures for untraceable payments”, In Proc. CRYPTO 82, pp.199-203, NY, Plenum, 1983.
2 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.
3 D.Pointcheval and J.Stern, “Provably Secure Blind signature Schemes”, In Advances in Cryptology – ASIACRYPT 1992, Springer-Verlag, LNCS 1163, pp.252-26,1992.
4 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.
5 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.
6 A,Shamir, “Identity-based cryptosystems and signature schemes”, In Proc. of CRYPTO’84, LNCS 196, pp. 47-53 Springer-verlag, 1984.
7 A.Joux, “A one round protocol for tripartite diffie-Hellman” In proc.of ANTS-IV, LNCS 1838, pp.385- 394, Springer-Verlag, 2000.
8 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.
9 F. Hess, “Efficient identity based signature schemes based on pairings”, SAC 2002, LNCS2595, pp.310-324, Springer-Verlag, 2002.
10 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.
11 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.
12 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.
13 D. Pointcheval and J. Stern, “Security arguments for digital signatures and blind Signatures”, Journal of Cryptology, Vol.13, No.3, pp.361-396, 2000.
14 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.
15 S.D.Galbraith, K. Harrison, and D.Soldera, “Implementing the Tate pairing”, ANTS 2002, LNCS 2369, pp.324-337, Springer-Verlag, 2002.
 
 
 
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.
 
 
 
1 TechRepublic
 
2 Baidu
 
3 The Ohio State University
 
 
 
B.Umaprasada Rao : Colleagues
K.A.Ajmath : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.