Abstract
A new signcryption scheme is proposed that performs efficient and secure encryption along with signature for verification. Encryption is done with Paillier Cryptosystem and ECDSA is used for signature verification. Elliptic curve digital signature is used for digital signature generation and verificatation where the security of the algorithm is dependent on elliptic curve discrete logarithm problem. A new Elliptic curve digital signature with Paillier cryptosystem is proposed. The Paillier cryptosystem is asymmetric key algorithm where the security of the algorithm lies in the computationally difficulty involved in solving \(n^{th}\) residue classes. The security of the scheme is based on both composite residuosity and elliptic curve discrete logarithm problem. Correctness of the scheme is verified for real time implementation and security of the scheme is verified semantically.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kalbhor, S., Gaikwad, A., Bhise, K., Salunke, D., Bangar, V.: A survey on digital signature
Kumar, M.H., Singh, D.A.: An efficient implementation of digital signature algorithm with SRNN public key cryptography. IJRREST Int. J. Res. Rev. Eng. Sci. Technol. (2012)
Lauter, K.E., Stange, K.E.: The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences. In: International Workshop on Selected Areas in Cryptography. Springer (2008)
McCurley, K.S.: The discrete logarithm problem. In: Cryptology and Computational Number Theory (1990)
Adachi, T.: Composite residuosity and its application to cryptography (2012)
ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31, 469–472 (1985). A public key cryptosystem and a signature scheme based on discrete logarithms
Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22, 644–654 (1976)
Patarin, J., Goubin, L.: Trapdoor one-way permutations and multivariate polynomials. In: International Conference on Information and Communications Security. Springer (1997)
Feigenbaum, J.: Locally random reductions in interactive complexity theory. In: Advances in Computational Complexity Theory (1990)
Johnson, D., Menezes, A., Vanstone, S.: The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Secur. 1, 36–63 (2001)
Khalique, A., Singh, K., Sood, S.: Implementation of elliptic curve digital signature algorithm. Int. J. Comput. Appl. 2, 21–27 (2010). 244 5 th Avenue,# 1526, New York, NY 10001, USA India
Paillier, P., et al.: Public-key cryptosystems based on composite degree residuosity classes. Springer (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Subrahmanyam, R., Rao, Y.V.S., Rekha, N.R. (2020). Signcryption Using ECDSA and Paillier Cryptosystem. In: Gunjan, V., Garcia Diaz, V., Cardona, M., Solanki, V., Sunitha, K. (eds) ICICCT 2019 – System Reliability, Quality Control, Safety, Maintenance and Management. ICICCT 2019. Springer, Singapore. https://doi.org/10.1007/978-981-13-8461-5_70
Download citation
DOI: https://doi.org/10.1007/978-981-13-8461-5_70
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-8460-8
Online ISBN: 978-981-13-8461-5
eBook Packages: EngineeringEngineering (R0)