[1] David Chaum. Blind Signatures for Untraceable Payments. In Advances inCryptology| CRYPTO '82, pages 199{203, Santa. Barbara, California, 1982.Plemum.
[2] Cheng-Chi Lee, Min-Shiang Hwang, and Wei-Pang Yang.A New BlindSignature Based on the Discrete Logarithm Problem for Untraceability. AppliedMathematics and Computation, 164(3): 837{841, 2005.
[3] Jan L. Camenisch, Jean-Marc Piveteau, and Markus A. Stadler. BlindSignatures Based on the Discrete Logarithm Problem. In Advances inCryptology|EUROCRYPT '94, volume 950 of Lecture Notes in ComputerScience, pages 428-432, 1994.
[4] Morteza Nikooghadam, Ali Zakerolhosseini, An Efficient Blind SignatureScheme Based onthe Elliptic Curve Discrete Logarithm Problem.The ISC Int'lJournal of Information Security, Volume 1, Number 2, pp. 125-131,2009.[5] Lein Harn. Cryptanalysis of the Blind Signatures Based on the Discrete Logarithm Problem. Electronic Letters, 31(14):1136,1995.
[6] Wu Ting and Jin-Rong Wang. Comment: A New Blind Signature Based on the Discrete Logarithm Problem for Untraceability. Applied Mathematics andComputation, 170(2): 999-1005, 2005.
[7] Debasish Jena, Sanjay Kumar Jena, and Banshidhar Majhi. A NovelUntraceable Blind Signature Based on Elliptic Curve Discrete LogarithmProblem. IJCSNS International Journal of Computer Science and NetworkSecurity, 7(6): 269-275, 2007.
[8] Chun-I Fan, D. J. Guan, Chih-I Wang, and Dai-Rui Lin. Cryptanalysis of Lee-Hwang-Yang BlindSignature Scheme. Computer Standards & Interfaces,31(2):319-320, 2009.
[9] S. A. Vanstone, “Elliptic curve cryptosystem-the answer to strong, fast public-key cryptography for securing constrained environments,” Information SecurityTechnical Report, vol. 2,no. 2, pp. 78-87, 1997.
[10] F. Amounas and E.H. El Kinani, Fast Mapping Method based on MatrixApproach For Elliptic Curve Cryptography International Journal of Information & Network Security (IJINS)Vol.1, No.2, pp. 54-59, 2012.
[11] F.Amounas and E.H. El Kinani,Elliptic Construction Efficiency of the Elliptic Curve Cryptosystem using Code Computing for Amazigh Alphabet,InternationalJournal of Information & Network Security (IJINS),Vol.2, No.1,pp. 43-53, 2013.
[12] F.Amounas and E.H. El Kinani, A Novel EncryptionScheme of AmazighAlphabet Based Elliptic Curve using Pauli Spin 1/2 Matrices, InternationalJournal of Information & Network Security (IJINS),Vol.2, No.2, pp. 190-196,2013.
[13] F.Amounas and E.H. El Kinani, Elliptic Curve Digital Signature AlgorithmUsing Boolean Permutation based ECC, InternationalJournal of Information& Network Security (IJINS),Vol.1, No.3, pp. 216-222, 2012.
[14] F. Amounas, H.Sadki and E.H. El Kinani, "An Efficient Signcryption Schemebased on the Elliptic Curve Discrete Logarithm Problem", InternationalJournal of Information & Network Security (IJINS), Vol.2, No.3, pp. 253-259(2013).
[15] L. Uhsadel, A. Poschmann, and C. Paar, "An Efficient General PurposeElliptic Curve Cryptography," In ECRYPT Workshop, SPEED-SoftwarePerformance Enhancement for Encryption and Decryption 2007, pp. 95-104,2007.
[16] ANSI X9.62: “Public Key Cryptography for the Financial Services Industry:The Elliptic Curve Digital Signature Algorithm (ECDSA)”, 1998.
[17] Neal Koblitz, Alfred J. Menezes, and Scott A.Vanstone. The State of EllipticCurve Cryptography. Designs, Codes and Cryptography, 19(2-3):173-193,2000.
[2] Cheng-Chi Lee, Min-Shiang Hwang, and Wei-Pang Yang.A New BlindSignature Based on the Discrete Logarithm Problem for Untraceability. AppliedMathematics and Computation, 164(3): 837{841, 2005.
[3] Jan L. Camenisch, Jean-Marc Piveteau, and Markus A. Stadler. BlindSignatures Based on the Discrete Logarithm Problem. In Advances inCryptology|EUROCRYPT '94, volume 950 of Lecture Notes in ComputerScience, pages 428-432, 1994.
[4] Morteza Nikooghadam, Ali Zakerolhosseini, An Efficient Blind SignatureScheme Based onthe Elliptic Curve Discrete Logarithm Problem.The ISC Int'lJournal of Information Security, Volume 1, Number 2, pp. 125-131,2009.[5] Lein Harn. Cryptanalysis of the Blind Signatures Based on the Discrete Logarithm Problem. Electronic Letters, 31(14):1136,1995.
[6] Wu Ting and Jin-Rong Wang. Comment: A New Blind Signature Based on the Discrete Logarithm Problem for Untraceability. Applied Mathematics andComputation, 170(2): 999-1005, 2005.
[7] Debasish Jena, Sanjay Kumar Jena, and Banshidhar Majhi. A NovelUntraceable Blind Signature Based on Elliptic Curve Discrete LogarithmProblem. IJCSNS International Journal of Computer Science and NetworkSecurity, 7(6): 269-275, 2007.
[8] Chun-I Fan, D. J. Guan, Chih-I Wang, and Dai-Rui Lin. Cryptanalysis of Lee-Hwang-Yang BlindSignature Scheme. Computer Standards & Interfaces,31(2):319-320, 2009.
[9] S. A. Vanstone, “Elliptic curve cryptosystem-the answer to strong, fast public-key cryptography for securing constrained environments,” Information SecurityTechnical Report, vol. 2,no. 2, pp. 78-87, 1997.
[10] F. Amounas and E.H. El Kinani, Fast Mapping Method based on MatrixApproach For Elliptic Curve Cryptography International Journal of Information & Network Security (IJINS)Vol.1, No.2, pp. 54-59, 2012.
[11] F.Amounas and E.H. El Kinani,Elliptic Construction Efficiency of the Elliptic Curve Cryptosystem using Code Computing for Amazigh Alphabet,InternationalJournal of Information & Network Security (IJINS),Vol.2, No.1,pp. 43-53, 2013.
[12] F.Amounas and E.H. El Kinani, A Novel EncryptionScheme of AmazighAlphabet Based Elliptic Curve using Pauli Spin 1/2 Matrices, InternationalJournal of Information & Network Security (IJINS),Vol.2, No.2, pp. 190-196,2013.
[13] F.Amounas and E.H. El Kinani, Elliptic Curve Digital Signature AlgorithmUsing Boolean Permutation based ECC, InternationalJournal of Information& Network Security (IJINS),Vol.1, No.3, pp. 216-222, 2012.
[14] F. Amounas, H.Sadki and E.H. El Kinani, "An Efficient Signcryption Schemebased on the Elliptic Curve Discrete Logarithm Problem", InternationalJournal of Information & Network Security (IJINS), Vol.2, No.3, pp. 253-259(2013).
[15] L. Uhsadel, A. Poschmann, and C. Paar, "An Efficient General PurposeElliptic Curve Cryptography," In ECRYPT Workshop, SPEED-SoftwarePerformance Enhancement for Encryption and Decryption 2007, pp. 95-104,2007.
[16] ANSI X9.62: “Public Key Cryptography for the Financial Services Industry:The Elliptic Curve Digital Signature Algorithm (ECDSA)”, 1998.
[17] Neal Koblitz, Alfred J. Menezes, and Scott A.Vanstone. The State of EllipticCurve Cryptography. Designs, Codes and Cryptography, 19(2-3):173-193,2000.
- Abstract viewed - 1053 times
- PDF downloaded - 821 times
Affiliations
E.H. El Kinani
Mathematical Department
Moulay Ismaïl University,
Faculty of Sciences and Technics, Box 509 Errachidia, Morocco
Fatima Amounas
Mathematical Department
Moulay Ismaïl University,
Faculty of Sciences and Technics, Box 509 Errachidia, Morocco
Proposed Developments of Blind Signature Scheme based on The Elliptic Curve Discrete Logarithm Problem
Abstract
In recent years, Elliptic Curve Cryptography (ECC) has attracted the attention of researchers due to its robust mathematical structure and highest security compared to other existing algorithm like RSA. Our main objective in this work was to provide a novel blind signature scheme based on ECC. The security of the proposed method results from the infeasibility to solve the discrete logarithm over an elliptic curve. In this paper we introduce a proposed to development the blind signature scheme with more complexity as compared to the existing schemes. Keyword: Cryptography, Blind Signature, Elliptic Curve, Blindness, Untraceability.DOI: 10.18495/comengapp.21.151160