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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Secured Blinding Signature Protocol based on Linear Block Public Key Algorithm

by Prakash Kuppuswamy, Saeed Q Y Al-khalidi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 61 - Number 14
Year of Publication: 2013
Authors: Prakash Kuppuswamy, Saeed Q Y Al-khalidi
10.5120/9995-4851

Prakash Kuppuswamy, Saeed Q Y Al-khalidi . Secured Blinding Signature Protocol based on Linear Block Public Key Algorithm. International Journal of Computer Applications. 61, 14 ( January 2013), 14-17. DOI=10.5120/9995-4851

@article{ 10.5120/9995-4851,
author = { Prakash Kuppuswamy, Saeed Q Y Al-khalidi },
title = { Secured Blinding Signature Protocol based on Linear Block Public Key Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { January 2013 },
volume = { 61 },
number = { 14 },
month = { January },
year = { 2013 },
issn = { 0975-8887 },
pages = { 14-17 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume61/number14/9995-4851/ },
doi = { 10.5120/9995-4851 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:09:06.000570+05:30
%A Prakash Kuppuswamy
%A Saeed Q Y Al-khalidi
%T Secured Blinding Signature Protocol based on Linear Block Public Key Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 61
%N 14
%P 14-17
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Cryptography and Network Security is one of the most important and emerging research in academic and industry circles. Cryptography usage is a detailed design issue that is largely beyond the scope of the high-level algorithm description earlier. One obvious issue is key size. With many cryptography algorithms, the time it takes to crack a message varies directly with the size of the encryption key. This Research deals with a new cryptographic blinding signature protocol algorithm. The requirements for securing blind signature are privacy, authentication, integrity maintenance and non-repudiation. These are crucial and significant issues in recent times for E-voting which is transacted over the internet through e-commerce channels. A new method of security is suggested which is a based on block cipher algorithm.

References
  1. Chaum. D, "Blind Signature for Untraceable Payments". Crypto'82, Springer-Verlag, pp. 199-203,1983.
  2. A. Fujioka,T. Okamato and K. ohta. "A Practical Secret Voting Scheme for Large Scale Elections" AUSCRYPT'92,LNCS 1163,Springer-Verlag,pp. 125-132,1997.
  3. Nidhi Gupta, Praveen Kumar and Satish Chhokar, "A Secure Blind Signature Application in E Voting", Proceedings of the 5th National Conference -2011, New Delhi.
  4. A. Menezes, P. van Oorschot and S. Vanstone, "Handbook of Applied Cryptography" by CRC Press, 1996.
  5. David A. Santos, Linear Algebra Notes, January 2, 2010 Revision, dsantos@ccp. edu.
  6. Prakash Kuppuswamy, Dr. C. Chandrasekar, "Enrichment of Security through Cryptographic Public key Algorithm Based on Block cipher", IJCSE, ISSN : 0976-5166 Vol. 2 No. 3 Jun-Jul 2011 PP 347-355.
  7. Anoop MS, Public Key Cryptography Applications Algorithms and Mathematical Explanations, Tata Elxsi Ltd, India, anoopms@tataelxsi. co. in
  8. Prakash Kuppuswamy, Dr. Wajeb Gharibi, "Securing data using 4 variable linear block Asymmetric key Algorithm", IJCDS, ISSN: 2278-5183, Vol. No. 1, Issue 3, October 2012.
  9. A. Baraani, J. Pieprzyk, R. Safavi, "A Practical Electronic Voting Protocol Using Threshold Schemes", Centre for Computer Security Research, Department of Computer Science, University of Wollongong, Australia, May 1994.
  10. J. Benaloh, D. Tuinstra, "Receipt-Free Secret-Ballot Elections", Clarckson University, 1994.
  11. J. Benaloh and M. Yung, "Distributing The Power Of A Government To Enhance The Privacy Of Votes", in Proc. of the 5th ACM Symposium on Principles of Distributed Computing, pages 52-62, August 1986.
  12. J. D. Cohen, M. J. Fischer, "A Robust And Verifiable Cryptographically Secure Election Scheme", in 26th Annual Symposium on Foundations of Computer Science, IEEE, pages 372-382, October 1985.
  13. J. Padhye, V. Firoiu, and D. Towsley, "A stochastic model of TCP Reno congestion avoidance and control," Univ. of Massachusetts, Amherst, MA, CMPSCI Tech. Rep. 99-02, 1999.
  14. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specification, IEEE Std. 802. 11, 1997.
Index Terms

Computer Science
Information Sciences

Keywords

Public key Private key RSA blinding Chaum's blinding signing unblinding inverse matrix

Powered by PhDFocusTM