Abstract

The security core of blockchain technology relies on digital signature schemes. However, existing schemes face numerous challenges when applied on a large scale, such as complex key management, reliance on certificate infrastructure, potential key escrow risks, and lack of resistance to quantum computing capabilities. To address these issues, this paper proposes a novel enhanced certificateless identity-based digital signature scheme. This scheme ingeniously integrates certificateless cryptosystem and lattice cryptography, aiming to simultaneously achieve identity-friendly public key management, effectively mitigate the key escrow problem, and lay theoretical foundation for post-quantum security. This paper first presents the formal definition and detailed construction of the scheme. Then, under the random oracle model, the security of its existence being unforgeable is reduced to the computational difficulty of the short integer solution problem on the lattice. The performance evaluation of the system shows that, compared with the traditional scheme based on bilinear pairing, this scheme significantly improves security while maintaining reasonable computational overhead. Experimental results show that at the 128-bit security level, the signing time is 4.8 ms and the verification time is 2.1 ms. Finally, this paper elaborates in detail on the application model of this scheme in secure blockchain transactions, demonstrates how it simplifies the transaction process by using human-readable identity identifiers, and through its anti-quantum and decentralized trust characteristics, provides a powerful cryptographic primitive for building the next generation of secure, efficient and user-friendly blockchain systems.

Keywords

References

1. Ajtai, M. 1996. Generating hard instances of lattice problems. STOC96: ACM Symposium on Theory of Computing. Philadelphia, Pennsylvania, USA. May 22 - 24, 1996. pp 99–108.
2. Al-Riyami, S. S. & Paterson, K. G. 2003. Certificateless public key cryptography. In: Laih, C.-S. (Ed). Advances in Cryptology - ASIACRYPT 2003. ASIACRYPT 2003. Lecture Notes in Computer Science, vol 2894. Springer, Berlin, Heidelberg. pp 452–473.
3. Bagchi, P., Bera, B., Das, A. K. & Sikdar, B. 2025. Quantum safe lattice-based single round online collaborative multi-signature scheme for blockchain-enabled IoT applications. ACM Transactions on Sensor Networks, 21(2), Article No 17. pp 1-33.
4. Boneh, D., Lynn, B. & Shacham, H. 2001. Short signatures from the Weil pairing. In: Boyd, C. (Ed). Advances in Cryptology — ASIACRYPT 2001. Lecture Notes in Computer Science, vol 2248. Springer, Berlin, Heidelberg. pp 514–532
5. Buterin, V. 2014. Ethereum: A next-generation smart contract and decentralized application platform. (https://ethereum.org/content/whitepaper/whitepaper-pdf/Ethereum_Whitepaper_-_Buterin_2014.pdf). Last accessed on 4 April 2026.
6. Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G. & Stehlé, D. 2018. Crystals-dilithium: A lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2018(1), 238 - 268.
7. Gharavi, H., Granjal, J. & Monteiro, E. 2024. Post-quantum blockchain security for the Internet of Things: Survey and research directions. IEEE Communications Surveys & Tutorials, 26(3), 1748-1774.
8. Nakamoto, S. 2008. Bitcoin: A peer-to-peer electronic cash system. (https://ssrn.com/abstract=3440802). Last accessed on 4 April 2026.
9. Regev, O. 2005. On lattices, learning with errors, random linear codes, and cryptography. STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. May 22-24, 2005. Baltimore, Maryland, USA. pp. 84–93.
10. Shamir, A. 1985. Identity-based cryptosystems and signature schemes. In: Blakley, G. R. & D. Chaum, D. (Eds.). Advances in cryptology. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. pp. 47–53.
11. Shor, P. W. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484–1509.