computing power network (CPN) can possess powerful data computing capabilities and storage resources by equipping a host of computing nodes. However, data sharing in the CPN faces significant challenges, particularly in data security and access control. attribute-based searchable encryption (ABSE) is a feasible technology to tackle this problem. Nevertheless, CPNs typically contain a vast amount of sensitive data that requires strict fine-grained retrieval permissions. Hence, we construct a decentralized and anonymous ABSE scheme with policy update and batch revocation for CPN, highlighting the generation of keyword indexes based on access structure. Meanwhile, considering the limited computing power of users, we transfer the time-consuming calculation to the edge computing node. Besides, security analysis indicates that our scheme can achieve the security of chosen plaintext attack and chosen keyword attack, collusion resistance, forward and backward security. Experimental evaluations demonstrate that our scheme is trustworthy and applicable to CPNs.

Abstract Linear codes play a crucial role in various fields of engineering and mathematics, including data storage, communication, cryptography, and combinatorics. Minimal linear codes, a subset of linear codes, are particularly essential for designing effective secret sharing schemes. In this paper, we introduce several classes of minimal binary linear codes by carefully selecting appropriate Boolean functions. These functions belong to a renowned class of Boolean functions, namely, the general Maiorana–McFarland class. We employ a method first proposed by Ding et al. (IEEE Trans Inf Theory 64(10):6536–6545, 2018) to construct minimal codes violating the Ashikhmin–Barg bound (wide minimal codes) by using Krawtchouk polynomials. The lengths, dimensions, and weight distributions of the obtained codes are determined using the Walsh spectrum distribution of the chosen Boolean functions. Our findings demonstrate that a vast majority of the newly constructed codes are wide minimal. Furthermore, our proposed codes exhibit a significantly larger minimum distance, in some cases, compared to some existing similar constructions. Finally, we address this method, based on Krawtchouk polynomials, more generally, and highlight certain generic properties related to it. These general results offer insights into the scope of this approach.

With the arrival of the era of self-driving technology, 5G, and IoT technology, self-driving car Internet technology is gradually changing the way people travel. The existing signcryption scheme test scheme with equality can only compare two ciphertexts, which is not suitable for the complex network of Internet of vehicles. To address this challenge, we propose the heterogeneous signcryption scheme from public key infrastructure (PKI) to identity-based cryptosystem (IBC) with multi-ciphertext equality test in the Internet of vehicles (HSCPI-MET). This scheme enables to communicate from PKI cryptosystem to IBC cryptosystem in Internet of vehicles, at the same time excuting the equality test of multi-ciphertext. Our scheme protects inter-vehicle communication data from being illegally accessed, tampered, or forged by malicious vehicles. The proposed scheme satisfies confidentiality and unforgeability under the stochastic predictor model for the computational Diffie–Hellman assumption and the IDH assumption. In addition, we conduct a rigorous experimental evaluation of the scheme to prove that it is secure and effective in practical applications.

Vehicular ad-hoc networks (VANETs) are integral to the evolution of intelligent transportation systems, offering substantial benefits in managing traffic flow, issuing warnings for potential accidents, and delivering information services to drivers. To ensure the authenticity and integrity of data exchanged within VANETs, numerous authentication schemes based on certificateless aggregate signature (CLAS) have been developed. However, state-of-the-art solutions often fail to be applicable in real-world VANETs due to security weaknesses and operational inefficiencies. Recently, Zhu et al. proposed an efficient CLAS-based authentication scheme with conditional privacy preservation (CPP) for VANETs (IEEE Transactions on Intelligent Transportation Systems, DOI: 10.1109/TITS.2023.3275077). Unfortunately, our analysis reveals that Zhu et al.’s scheme is incapable of withstanding coalition attacks from malicious RSUs and vehicles as well as public-key replacement attacks from dishonest vehicles. To facilitate secure communication in VANETs, we present a security-enhanced, pairing-free and energy-efficient CLAS-based authentication scheme with CPP for VANETs. This scheme has been rigorously proven to be secure against Type I, Type II and Type III attackers. Distinguished from other comparable schemes, our construction significantly reduces communication overhead and energy consumption while simultaneously fortifying security.

Recently, Zhan et al. presented a pairing-free certificateless aggregation signature scheme (ZH-CLAS) to address security issues in healthcare wireless medical sensor networks (HWMSNs) and proved that their scheme is secure against adaptive chosen message attacks. In this article, we analyze the security of the ZH-CLAS scheme by utilizing two types of concrete attacks. Unfortunately, we demonstrate that their scheme cannot withstand public key replacement attacks and is not secure against coalition attacks from malicious sensor nodes. To solve these security challenges, we further improve the security of the ZH-CLAS scheme. Our enhanced scheme has a fixed-length aggregate signature, which efficiently minimizes the transmission bandwidth. Additionally, our scheme outperforms related pairing-free certificateless aggregate signature schemes in terms of security and communication performance.

It is well known that the computation of bilinear pairing is the most expensive operation in pairing-based cryptography. In this paper, we propose a noninteractive verifiable outsourcing algorithm of bilinear pairing based on two servers in the one-malicious model. The outsourcer need not execute any expensive operation, such as scalar multiplication and modular exponentiation. Moreover, the outsourcer could detect any failure with a probability close to 1 if one of the servers misbehaves. Therefore, the proposed algorithm improves checkability and decreases communication cost compared with the previous ones. Finally, we utilize the proposed algorithm as a subroutine to achieve an anonymous identity-based encryption (AIBE) scheme with outsourced decryption and an identity-based signature (IBS) scheme with outsourced verification.

Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding algorithms. Bose-Ray-Chaudhuri-Hocquenghem (BCH) codes form a subclass of cyclic codes and are very important in both theory and practice as they have good error-correcting capability and are widely used in communication systems, storage devices, and consumer electronics. However, the dimension and minimum distance of BCH codes are not known in general. The objective of this paper is to determine the Bose and minimum distances of a class of narrow-sense primitive BCH codes.

Two constructions of binary sequences with optimal autocorrelation of period N ≡ 0 (mod 4) are investigated. These two constructions are powerful and generic in the sense that many classes of binary sequences could be obtained from binary sequences with ideal autocorrelation. Both the linear complexity and the minimal polynomial of all the classes of binary sequences are determined.

Binary sequences with optimal autocorrelation are needed in many applications. Two constructions of binary sequences with optimal autocorrelation of period N ≡ 0 (mod 4) are investigated. The two constructions are powerful and generic in the sense that many classes of binary sequences with optimal autocorrelation could be obtained from binary sequences with ideal autocorrelation. General results on the minimal polynomials of these binary sequences are derived. Based on the results, both the linear complexities and the minimal polynomials are determined.