Efficient Certificateless Multi-Signcryption Scheme using Elliptic curves
Keywords:
Multi-Signcryption, Certificateless Signcryption, Public Verifiability, Bilinear Pairings, Elliptic Curve, Computational Diffie-Helmann Problem, Computational Bilinear Diffie-Helmann Problem.Abstract
Providing together confidentiality and unforgeability with public verifiability are essential components of secure communication in multi-user settings in real-world applications., especially in scenarios where the generation of digital signatures of multiple users on a single message to the single receiver such as blockchain applications like decentralized finance, transaction signing, and private transactions to ensure secure e commerce transactions and also provide security in cloud, web, and healthcare applications.
References
Y. Zheng, “Digital signcryption or how to achieve cost(signature encryption,” in Proceedings of the cost(signature) + cost(encryption), in Advances in Cryptology - CRYPTO 97, 17th Annual International Cryptology Conference, pp. 165–179, Santa Barbara, California, USA, 1997.
J Baek, J Newmarch, R Safavi-Naini, and W. Susilo, A Survey of Identity-Based Cryptography, In Proc. of the 10th Annual Conference for Australian Unix User's Group pp 95-102, 2004.
