Volume- 4
Issue- 1
Year- 2016
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
Ayman A.Rahim A.Rahman , Abdulameer Hussain
This paper presents a modified version of blind signature . The proposed method adds more complex blind factors to increase the blindeness property of the message sent . In order to achieve this goal , the proposed system suplements the traditional blind signature methods by multiple random variables which are called blind factors attached at different locations in the original message . The blind signature method in this paper is implemented in sensitive applications such as voting and cash transfer.
[1] RSA Laboratories. PKCS #9: Selected Object Classes and Attribute Types, 2.0 edition, February 2000.
[2] Chaum, David . "Blind signatures for untraceable payments". Advances in Cryptology Proceedings of Crypto 82 (3): 199–203
[3] A. Juels, M. Luby, and R. Ostrovsky. Security of blind digital signatures. In B. S. Kaliski Jr., editor, Advances in Cryptology — CRYPTO ’97, volume 1294 of Lecture Notes in Computer Science, pages 150–164. Springer-Verlag, 1997
[4] Chaum, D., (1983) “Blind signatures system”,in Advances in cryptology , CRYPTO’83, pp:153-156,1983.
[5] Stefan A.Brands., (2000), “ Rethinking Public Key Infrastructures and Digital Certificates : Building in Pravacy”:.MIT Press, Cambridge, MA, USA,2000.
[6] Jan Camenisch and Thomas GroB,(2008) “Efficentt attributes for anonymous credentials” In Peng Ning, Paul F. Syverson, and Somesh Jha, editor s, ACM CCS 08: 15th Conference on Computer and Communications Security, Alexandria, Virginia, USA, October 27-31, pp: 345-356, 2008.
[7] Ronny Bjones, (2010) “ U-prove technology overview”.http://www.itforum.dk/downloads/ Ronny_Bjones_Uprove.pdf , October 2010.
[8] Microsoft (2011), MICROSOFT U-PROVE. Microsoft u-prove ctp release 2. http://connect.microsoft.com/site642/Downloads/Down loadDetails.aspx?DownloadID=26953 , March 2011.
[9] Chu-I Fan, Chen,W.K. & Yeh,Y.S., (2000) “Randomization enhanced Chaum’s blind signature scheme Computer communications , Vol 23, 2000, pp 1677-1680.
[10] Zuhua Shao,(2000) “Improved user efficient blind signatures”, Electronics Letters , Vol.36, no.16, pp.1372-1374, 2000.
[11] Verma,G.K., (2008) “ Blind signature schems over Braid groups” http://eprint.iacr.org/2008/027.
[12] Markus Ruckert, (2008) “ Lattice-based Blind signatures”, http://eprint.iacr.org/2008/322.
[13] Fuh-Gwo Jeng, Tzen-Long Chem, & Tzer-Shyong Chen, (2010) “An ECC-Based Blind Signature Scheme”,Journal of Networks,Vol 5, No 8, 2010.
[14] Carmenisch,J.L., Piveteau,J.M. & Stadler,M.A., (1994) “Blind signature based on the discrete logarithm problem”, EUROCRYPT '94, Perugia, Italy,1994.
[15] David Pointcheval & Jaques Stern, (1996) “Provably Secure Blind Signature Schemes” ,Advances in Cryptology – Proceedings of ASIACRYPT ' 96, M. Y. Rhee and K. Kim Eds.Springer-Verlag, LNCS 1163, pages 252-265, 1996.
[16] Chun-I Fan, Wei-Kuei Chen , An Efficient Blind Signature Scheme for Information Hiding , International Journal of Electronic Commerce ,Volume 6, Issue 1, 2001
[17] E.H. El Kinani, Fatima Amounas , Proposed Developments of Blind Signature Scheme based on The Elliptic Curve Discrete Logarithm Problem , Computer Engineering and Applications Journal , Vol 3, No 2 (2014)
[18] Amir Aliabadian , Ali Delavari Ghara, New Blind Digital Signature Based On Modified Elgamal Signature in Electronic Voting , international Journal of Engineering and Advanced Technology (IJEAT) ISSN: 2249 –8958,Volume - 1, Issue -6, August 2012
[19] N. M. F. Tahat, E. S. Ismail and R. R. Ahmad , A New Blind Signature Scheme Based On Factoring and Discrete Logarithms , International Journal of Cryptology Research 1 (1) : 1-9 (2009)
CIS, Jerash University/ Jerash, Jordan
No. of Downloads: 8 | No. of Views: 1289
Dipti Prajapati, Samishtarani Sabat, Sanika Bhilare, Rashmi Vishe, Prof. Suman Bhujbal.
March 2024 - Vol 12, Issue 2
Anu Sharma, Vivek Kumar.
May 2023 - Vol 11, Issue 3
Venkateswaran Radhakrishnan.
May 2023 - Vol 11, Issue 3