International Journal of Mathematical Sciences and Computing (IJMSC)
IJMSC Vol. 7, No. 2, 8 Jun. 2021
Cover page and Table of Contents: PDF (size: 389KB)
A Verifiable Ring Signature Scheme of Anonymous Signcryption Using ECC
Full Text (PDF, 389KB), PP.24-30
Views: 0 Downloads: 0
Author(s)
Pratik Gupta
1,*
Manoj Kumar
2
Index Terms
Elliptic Curve, signcryption, digital signature, authentication, anonymous.
Abstract
The ring signature does hide the member of actually signature in the all possible signer. This technique was introduced by Rivest, Tauman and Shamir in 2001. This paper presents elliptic curve cryptosystem using signcryption algorithm with the anonymity feature. In the present paper, combines ring signature scheme with signcryption method to produce the anonymity feature for the signcryption scheme and discuss the characteristic of the security. Because elliptic curve cryptosystem yields like as small bandwidth requirements, low computation load, and high security and methodology of ring signature gives without revealing the actual signer to all possible signers. Combining the benefits of these two methodology, the result is an efficient anonymous signcryption algorithm and highly secure.
Cite This Paper
Pratik Gupta, Manoj Kumar," A Verifiable Ring Signature Scheme of Anonymous Signcryption Using ECC ", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.7, No.2, pp. 24-30, 2021. DOI: 10.5815/ijmsc.2021.02.03
Reference
[1]Kumar, Manoj and Gupta, Pratik, “Cryptographic schemes based on Elliptic Curve over the Ring Zp[i]”, Applied Mathematics, vol. 7, no. 3, pp. 304-312, 2016.
[2]Chaum, David, “Group signatures”, Davies D W, ed. In: Proceedings of EUROCRYPT’91, Lecture Notes in Computer Science, Berlin: Springer-Verlag, Vol. 547, pp. 257–265, 1991.
[3]Rivest, Ronald and Shamir, Adi and Tauman, Yael “How to leak a secret”, In: Proceedings of ASIACRYPT’01, Lecture Notes in Computer Science, Berlin: Springer-Verlag, vol. 2248, pp. 552–565, 2001.
[4]Zheng, Yuliang, “Signcryption and Its Applications in Efficient Public Key Solutions”, Proceedings of 1997, Information Security Workshop (ISW'97), 1997. (http://www.sis.uncc.edu/~yzheng/papers/).
[5]Rivest, Ronald and Shamir, Adi and Adleman, Leonard, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Comm. ACM, vol. 21, no. 2, pp. 120-126, 1978.
[6]Gupta, Pratik and Kumar, Manoj and Kumar, Ajay, “A Novel and Secure Multi-party Key Exchange Scheme Using Trilinear Pairing Map Based on Elliptic Curve Cryptography”, International Journal of Pure and Applied Mathematics. Vol. 116, no. 1, 2017.
[7]Hankerson, Darrel and Menezes, Alfred and Vanstone, Scott, “Guide to Elliptic Curve Cryptography”, Springer-Verlag, Germany, 2004.
[8]Silverman, Joseph, “The Arithmetic of Elliptic Curves”, Springer, New York, 1986. (http://dx.doi.org/10.1007/978-1-4757-1920-8).
[9]Stinson, Douglas, “Cryptography Theory and Practice”, Chapman and Hall/CRC, United Kingdom, 2006.
[10]Washington, Lawrence, “Elliptic Curves Number Theory and Cryptography”, Chapman and Hall/CRC, United Kingdom, 2008. (http://dx.doi.org/10.1201/9781420071474). (1971).
[11]Boneh, Dan and Lipton, Richard, “Algorithms for black-box fields and their application to cryptography”, In: Advances in Cryptography, pp. 283-297, 1996.
[12]Johnson, Don and Menezes, Alfred and Vanstone, Scott, “The elliptic curve digital signature algorithm (ECDSA)”, International Journal of Information Security. Vo. 1, no. 1, pp. 36-63, 2001.
[13]Rosalina, Nur Hadisukmana," An Approach of Securing Data using Combined Cryptography and Steganography ", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.6, No.1, pp.1-9, 2020. DOI: 10.5815/ijmsc.2020.01.01