Electricity Carbon Quota Trading Scheme based on Certificateless Signature and Blockchain

The carbon tradingmarket 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 escrowbased on identity cryptography.However,most certificateless signatures still suffer fromvarious 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.

CERTIFICATELESS SIGNATURE AND BLIND SIGNATURE

Certificateless public key cryptography is a new paradigm introduced by Al-Riyami and Paterson.It eliminates the need of the certificates in traditional public key cryptosystems and the key escrow problem in IDentity-based Public Key Cryptography(ID-PKC).Due to the advantages of the certificateless public key cryptography,a new efficient certificateless pairing-based signature scheme is presented,which has some advantages over previous constructions in computational cost.Based on this new signature scheme,a certificateless blind signature scheme is proposed.The security of our schemes is proven based on the hardness of computational Diffie-Hellman problem.

On Constructing Certificateless Proxy Signature from Certificateless Signature

In proxy signature schemes, an original signer A delegates its signing capability to a proxy signer B, in such a way that B can sign message on behalf of A.The recipient of the final message verifies at the same time that B computes the signature and that A has delegated its signing capability to B.Recently many identity-based(ID-based) proxy signature schemes have been proposed, however, the problem of key escrow is inherent in this setting.Certificateless cryptography can overcome the key escrow problem.In this paper, we present a general security model for certificateless proxy signature scheme.Then, we give a method to construct a secure certificateless proxy scheme from a secure certificateless signature scheme, and prove that the security of the construction can be reduced to the security of the original certificateless signature scheme.

An Efficient Certificateless Ring Signature Scheme

To overcome the drawbacks such as high computational cost, unreasonable security model and long signature length in existing certificateless ring signature schemes, we propose an efficient certificateless ring signature scheme in this paper. Our construction is inspired by some efficient ID-based ring signature schemes, and uses bilinear pairings as a basic tool. Using a reasonable security model, the unforgeability of the proposed scheme is proven based on the intractability of the computational Diffie-Hellman （CDH） problem. The signature length of the new scheme is only ｜G2｜＋n｜G1｜ （｜Gi｜ is the bit length of an element in group Gi, i =1, 2）. Compared with other existing certificateless ring signature schemes, the newly proposed scheme has a shorter signature length and is more efficient and practical.

Blockchain-Based Data Acquisition with Privacy Protection in UAV Cluster Network

The unmanned aerial vehicle(UAV)self-organizing network is composed of multiple UAVs with autonomous capabilities according to a certain structure and scale,which can quickly and accurately complete complex tasks such as path planning,situational awareness,and information transmission.Due to the openness of the network,the UAV cluster is more vulnerable to passive eavesdropping,active interference,and other attacks,which makes the system face serious security threats.This paper proposes a Blockchain-Based Data Acquisition(BDA)scheme with privacy protection to address the data privacy and identity authentication problems in the UAV-assisted data acquisition scenario.Each UAV cluster has an aggregate unmanned aerial vehicle(AGV)that can batch-verify the acquisition reports within its administrative domain.After successful verification,AGV adds its signcrypted ciphertext to the aggregation and uploads it to the blockchain for storage.There are two chains in the blockchain that store the public key information of registered entities and the aggregated reports,respectively.The security analysis shows that theBDAconstruction can protect the privacy and authenticity of acquisition data,and effectively resist a malicious key generation center and the public-key substitution attack.It also provides unforgeability to acquisition reports under the Elliptic Curve Discrete Logarithm Problem(ECDLP)assumption.The performance analysis demonstrates that compared with other schemes,the proposed BDA construction has lower computational complexity and is more suitable for the UAV cluster network with limited computing power and storage capacity.

An Efficient Certificateless Aggregate Signature Scheme

Aggregate signature can aggregate n signatures on n messages from n signers into a single signature that convinces any verifier that n signers sign the n messages, respectively. In this paper, by combining certificateless public key cryptography and aggregate signatures, we propose an efficient certificateless aggregate signature scheme and prove its security. The new scheme is proved secure against the two representative types adversaries in certificateless aggregate signature under the assumption that computational Diffie-Hellman problem is hard. Furthermore, from the comparison of the computation cost of the new scheme with some existing certificateless aggregate signature schemes in group sum computation, scalar multiplication computation, Hash computation and abilinear pairings computation, it concludes that the new scheme reduces the computation cost in scalar multiplication computation in half and maintains the same in the other computation costs.