Open Access
ARTICLE
Electricity Carbon Quota Trading Scheme based on Certificateless Signature and Blockchain
1 College of Computer Science and Engineering, Northwest Normal University, Lanzhou, 730070, China
2 Institute of China Telecom Wanwei, China Telecom Wanwei Information Technology Co., Ltd., Lanzhou, 730030, China
3 College of Big Data and Internet, Shenzhen Technology University, Shenzhen, 518118, China
4 Key Laboratory of Cryptography and Data Analytics, Northwest Normal University, Lanzhou, 730070, China
* Corresponding Author: Runze Diao. Email:
(This article belongs to the Special Issue: The Bottleneck of Blockchain Techniques: Scalability, Security and Privacy Protection)
Computer Modeling in Engineering & Sciences 2024, 138(2), 1695-1712. https://doi.org/10.32604/cmes.2023.029461
Received 20 February 2023; Accepted 22 May 2023; Issue published 17 November 2023
Abstract
The carbon trading market can promote “carbon peaking” and “carbon neutrality” at low cost, but carbon emission quotas face attacks such as data forgery, tampering, counterfeiting, and replay in the electricity trading market. Certificateless signatures are a new cryptographic technology that can address traditional cryptography’s general essential certificate requirements and avoid the problem of crucial escrow based on identity cryptography. However, most certificateless signatures still suffer from various security flaws. We present a secure and efficient certificateless signing scheme by examining the security of existing certificateless signature schemes. To ensure the integrity and verifiability of electricity carbon quota trading, we propose an electricity carbon quota trading scheme based on a certificateless signature and blockchain. Our scheme utilizes certificateless signatures to ensure the validity and nonrepudiation of transactions and adopts blockchain technology to achieve immutability and traceability in electricity carbon quota transactions. In addition, validating electricity carbon quota transactions does not require time-consuming bilinear pairing operations. The results of the analysis indicate that our scheme meets existential unforgeability under adaptive selective message attacks, offers conditional identity privacy protection, resists replay attacks, and demonstrates high computing and communication performance.Keywords
Cite This Article
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.