Bilinear Pairings Research Articles

Multi-sensor network tracking research utilizing searchable encryption algorithm in the cloud computing environment.

Presently, the focus of target detection is shifting towards the integration of information acquired from multiple sensors. When faced with a vast amount of data from various sensors, ensuring data security during transmission and storage in the cloud becomes a primary concern. Data files can be encrypted and stored in the cloud. When using data, the required data files can be returned through ciphertext retrieval, and then searchable encryption technology can be developed. However, the existing searchable encryption algorithms mainly ignore the data explosion problem in a cloud computing environment. The issue of authorised access under cloud computing has yet to be solved uniformly, resulting in a waste of computing power by data users when processing more and more data. Furthermore, to save computing resources, ECS (encrypted cloud storage) may only return a fragment of results in response to a search query, lacking a practical and universal verification mechanism. Therefore, this article proposes a lightweight, fine-grained searchable encryption scheme tailored to the cloud edge computing environment. We generate ciphertext and search trap gates for terminal devices based on bilinear pairs and introduce access policies to restrict ciphertext search permissions, which improves the efficiency of ciphertext generation and retrieval. This scheme allows for encryption and trapdoor calculation generation on auxiliary terminal devices, with complex calculations carried out on edge devices. The resulting method ensures secure data access, fast search in multi-sensor network tracking, and accelerates computing speed while maintaining data security. Ultimately, experimental comparisons and analyses demonstrate that the proposed method improves data retrieval efficiency by approximately 62%, reduces the storage overhead of the public key, ciphertext index, and verifiable searchable ciphertext by half, and effectively mitigates delays in data transmission and computation processes.

Efficient Algorithms for Large Prime Characteristic Fields and Their Application to Bilinear Pairings

We propose a novel approach that generalizes interleaved modular multiplication algorithms for the computation of sums of products over large prime fields. This operation has widespread use and is at the core of many cryptographic applications. The method reformulates the widely used lazy reduction technique, crucially avoiding the need for storage and computation of “double-precision” operations. Moreover, it can be easily adapted to the different methods that exist to compute modular multiplication, producing algorithms that are significantly more efficient and memory-friendly. We showcase the performance of the proposed approach in the computation of multiplication over an extension field Fpk , and demonstrate its impact with record-breaking implementations of bilinear pairings. Specifically, we accomplish a full optimal ate pairing computation over the popular BLS12-381 curve, designed for the 128-bit security level, in under half a millisecond on a 3.2GHz Intel Coffee Lake processor, which is about 1.40× faster than the state-of-the-art. Similarly, we perform the same computation over the BLS24-509 curve, targeting the 192-bit security level, in ~ 2.6 milliseconds, achieving a speedup of more than 1.30x. We also report a significant impact on other applications, including protocols based on supersingular isogenies.

A Smart Card-Based Two-Factor Mutual Authentication Scheme for Efficient Deployment of an IoT-Based Telecare Medical Information System

The integration of the Internet of Things (IoT) and the telecare medical information system (TMIS) enables patients to receive timely and convenient healthcare services regardless of their location or time zone. Since the Internet serves as the key hub for connection and data sharing, its open nature presents security and privacy concerns and should be considered when integrating this technology into the current global healthcare system. Cybercriminals target the TMIS because it holds a lot of sensitive patient data, including medical records, personal information, and financial information. As a result, when developing a trustworthy TMIS, strict security procedures are required to deal with these concerns. Several researchers have proposed smart card-based mutual authentication methods to prevent such security attacks, indicating that this will be the preferred method for TMIS security with the IoT. In the existing literature, such methods are typically developed using computationally expensive procedures, such as bilinear pairing, elliptic curve operations, etc., which are unsuitable for biomedical devices with limited resources. Using the concept of hyperelliptic curve cryptography (HECC), we propose a new solution: a smart card-based two-factor mutual authentication scheme. In this new scheme, HECC’s finest properties, such as compact parameters and key sizes, are utilized to enhance the real-time performance of an IoT-based TMIS system. The results of a security analysis indicate that the newly contributed scheme is resistant to a wide variety of cryptographic attacks. A comparison of computation and communication costs demonstrates that the proposed scheme is more cost-effective than existing schemes.

Public key encryption with public-verifiable decryption delegation and its application

We introduce a new cryptographic primitive called public key encryption with public-verifiable decryption delegation (PKE-PV D2), that enables the original decryptor to transmit the decryption key for a specific ciphertext to a designated recipient in a way that is both public-verifiable and privacy-preserving. Because of its ability to delegate public-verifiable and ciphertext-level decryption, it is useful in scenarios that require special decryption delegation, such as when the court needs to retrieve a specific message from the ciphertext as significant judgment evidence. Moreover, we present the first PKE-PV D2 scheme and its corresponding security proof in the random oracle model, using bilinear pairing. Additionally, we provide a prototype of our proposal, and our extensive experimental results demonstrate its effectiveness and efficiency.

Antiquantum Privacy Protection Scheme in Advanced Metering Infrastructure of Smart Grid Based on Consortium Blockchain and RLWE

Smart meters in advanced metering infrastructure (AMI) collect fine-grained, real-time power consumption data may result in user privacy leakage. Aiming at the problem that existing privacy protection schemes cannot resist quantum attacks, an antiquantum privacy protection scheme in AMI of smart grid based on consortium blockchain and ring learning with errors (RLWE) is proposed. The scheme has the following contributions. First, the RLWE-based secure communication scheme is designed in this article, which ensures the resistance of the scheme to quantum attacks. Second, all smart meters in AMI use anonymous identity to communicate with the control center, and the fine-grained power consumption data is also encrypted and digitally signed to prevent user privacy leakage and tampering of power consumption data. And the scheme does not use bilinear pairings and exponential operations and has efficient computational performance. Third, a two-tier consortium blockchain storage system consisted of regional gateways and data aggregators are designed to eliminate the single point of failure problems of the data aggregators. The practical byzantine fault tolerance consensus mechanism is improved to reduce the communication cost in the consensus process. The scheme's security is proven theoretically, and the experimental results show that the scheme has a low computational cost.

A Novel Multi-Party Authentication Scheme for FCN-based MIoT Systems in Natural Language Processing Environment

Natural language processing(NLP) assists to increase the efficiency of human andMultimedia Internet of Things(MIoT) interaction. Notably, large-scale NLP tasks can be offloaded from a cloud server to fog nodes closer to a mobile terminal device for lower response latency. But communication security is ongoing issues that need to be addressed. Effective mutual authentication among multiple entities is essential to ensure the security of MIoT systems based on a dynamicFog Computing Network(FCN). However, the existing schemes are unsuitable for the dynamic FCN due to the security vulnerabilities such as the linkable sessions. To solve this problem, anAnonymous Multi-Party Authentication(AMPA) scheme is proposed to address the challenges of secure FCN-based MIoT communications in this paper. The proposed scheme uses a bilinear pairing operation to realize the authentication between the fog nodes and cloud server and to establish the group key. Besides, the scheme allows cloud-authenticated terminal devices to be added to the FCN and reduces the need for the resource-limited terminal device to perform many authentication protocols. The security analysis is carried out to demonstrate that AMPA scheme can meet various safety requirements. Performance evaluations shown that the proposed AMPA scheme achieves satisfactory performance.

Efficient and Secure Certificateless Signcryption Without Pairing for Edge Computing-Based Internet of Vehicles

The emergence of the vehicular ad-hoc network (VANETs) could meet the need for an efficient and safe transportation. Vehicles wirelessly interact with nearby road-side units (RSUs) and send the data to the cloud servers (CS), but this approach has limitations (i.e. network congestion and privacy leakage). Edge computing can effectively solve problems of network congestion, feedback delay and privacy leakage during transmission caused by CS. Thus, this paper proposes a certificateless aggregate signcryption with online/offline encryption (CLOASC) based on edge computing (EDC). Correspondingly, certificateless signcryption (CLSC), online/offline encryption (OOE) and aggregate signcryption technology solve the key escrow problem, shorten the encryption time and realize the quick verification of multiple users, respectively. Furthermore, it is worth mentioning that the scheme we propose does not have any bilinear pairings or scalar multiplications in the online encryption stage, which greatly reduces the computational cost in the online stage. In the random oracle model, our scheme was proved to be existential unforgeability under adaptive chosen message attacks (EUF-ACM) and adaptive indistinguishability under chosen-ciphertext attack (IND-CCA2) security. Simulation results show that our scheme is computationally and communication based lightweight as compared to the related.

A pairing-free certificateless searchable public key encryption scheme for IoMT

To ensure confidentiality, medical information is usually encrypted before it is sent to a third party for processing. Encryption technology can protect the privacy of data, but it limits the ability to search for data. The problem is usually solved by using public key encryption with keyword search (PEKS). Recently, some certificateless PEKS (CPEKS) schemes have been proposed. Not only do they allow users to search encrypted data, but they do not have the problems of certificate management and key escrow. However, they rely on the high-consumption bilinear pairing, and some of them are vulnerable to Inside Keyword Guessing Attacks (IKGA). To address these issues, we design a lightweight CPEKS scheme for the Medical Internet of Things (IoMT) that does not include bilinear pairing. In the random oracle model, our scheme is proved to be secure. The analysis results show that the proposed scheme has better overall performance than the existing schemes according to the security property, computation cost, and communication cost. Finally, an IoMT application scenario of our scheme is given.

A Novel Identity-Based Privacy-Preserving Anonymous Authentication Scheme for Vehicle-to-Vehicle Communication

This paper proposes a novel bilinear pairing-free identity-based privacy-preserving anonymous authentication scheme for vehicle-to-vehicle (V2V) communication, called “NIBPA”. Today, vehicular ad hoc networks (VANETs) offer important solutions for traffic safety and efficiency. However, VANETs are vulnerable to cyberattacks due to their use of wireless communication. Therefore, authentication schemes are used to solve security and privacy issues in VANETs. The NIBPA satisfies the security and privacy requirements and is robust to cyberattacks. It is also a pairing-free elliptic curve cryptography (ECC)-based lightweight authentication scheme. The bilinear pairing operation and the map-to-point hash function in cryptography have not been used because of their high computational costs. Moreover, it provides batch message verification to improve VANETs performance. The NIBPA is compared to existing schemes in terms of computational cost and communication cost. It is also a test for security in the random oracle model (ROM). As a result of security and performance analysis, NIBPA gives better results compared to existing schemes.

A secure access control scheme with batch verification for VANETs

When an onboard unit (OBU) moves into the area of a roadside unit (RSU), authentication occurs. In areas with heavy traffic, e.g., intersections, an RSU may receive thousands of requests in a short period . Verifying each request separately can lead to wasted resources and cause RSU service bottlenecks. Because these requests have stringent real-time requirements, if they are not processed in time, vehicles may not be able to change their driving status and could encounter large-scale congestion or even dangerous areas. To improve efficiency, this study investigated a secure access control scheme with batch verification for vehicular ad hoc networks . The proposed method requires only two bilinear pairing operations to verify n requests, which is the same number for a single verification. Through a performance analysis, it was confirmed that the proposed scheme has a lower computation cost and the least communication overhead among existing schemes. Furthermore, extensive simulations demonstrated that the scheme has the lowest processing delay, and as the number of batch verifications increases, its processing delay growth range also diminishes. A detailed security analysis shows that the scheme achieves collusion resistance, signature unforgeability, and replaying resistance.

A Novel High-Efficiency Password Authentication and Key Agreement Protocol for Mobile Client-Server

With the development of wireless technology, people increasingly rely on mobile devices. Since most mobile devices transmit sensitive information via insecure public channels, it is important to design multiauthentication key agreement protocols for security protection. Traditional scholars tend to use traditional public-key cryptosystems (PKCs) in their protocols to improve security. High-cost operations (e.g., elliptic curve point multiplication and bilinear pairing) were widely used in their scheme but were not suitable for mobile devices because of limited computing resources. In this study, we designed a novel high-efficiency multiauthentication and key agreement protocol and demonstrate its security in the random oracle model. Compared with other protocols, our proposed scheme only uses string concatenation operations, one-way hash functions, and XOR operations. In addition, our protocol requires much fewer computing resources to achieve the same level of security.

VR-PEKS: A Verifiable and Resistant to Keyword Guess Attack Public Key Encryption with Keyword Search Scheme

Public key encryption with keyword search (PEKS) allows users to perform keyword searches of ciphertext on untrusted cloud storage servers, protecting data privacy while sharing data. However, it faces several security problems in practical applications. First, an attacker can launch a keyword guessing attack to obtain keywords of interest to users, causing the leakage of their sensitive information. Second, untrusted cloud servers may return incorrect or incomplete results. In addition, with the continuous development of quantum computers, existing PEKS schemes face the problem of quantum attacks. Since cloud servers are mostly untrusted, verifiable search has become a hot research topic among scholars. However, most of the current schemes are based on bilinear pairing constructions, which are vulnerable to quantum attacks. To solve these problems, we propose a new ciphertext retrieval scheme based on fully homomorphic encryption (FHE), called VR-PEKS. This scheme implements verifiable search and is able to solve the problems of keyword guessing attacks and quantum attacks. We propose to improve the security of the scheme by using the oblivious pseudorandom function to randomize keywords and then encrypt them using FHE. An encrypted verified index structure is constructed and exposed by the data owner, enabling the data recipient to achieve verification of the correctness and integrity of the retrieved results without relying on a trusted third party. We demonstrate the security of the proposed scheme in a stochastic prediction model, and prove that our scheme satisfies keyword ciphertext indistinguishability and keyword trapdoor indistinguishability under adaptive keyword selection attacks. The comparison shows that our scheme is secure and feasible.

A Novel Revocable Lightweight Authentication Scheme for Resource-Constrained Devices in Cyber–Physical Power Systems

The existing identity security schemes (e.g., based on bilinear pairing) have high computational complexity and large bytes of variables, which results in high computation and communication costs. It is difficult to apply the schemes to resource-constrained (i.e., computation and communication) devices. Moreover, most of these schemes adopt a fixed cycle key update strategy compromising the security of authentication schemes or dynamic (real-time) key update strategy with high computational cost. To solve these issues, this article explores a novel revocable lightweight authentication scheme for resource-constrained devices in cyber–physical power systems (CPPSs). First, a lightweight authentication scheme combined elliptic-curve cryptography (ECC) and certificateless cryptography (CLC) is proposed to negotiate a secure session key, which can achieve mutual authentication with low computation and communication costs. Second, aiming at security problem caused by key leakage, a real-time key update strategy with low computational cost is designed to improve the security of identity authentication. Third, according to a hardness assumption of the elliptic-curve discrete logarithm problem (ECDLP), theoretical analysis rigorously proves that the proposed authentication scheme ensures the security with respect to existential unforgeability against adaptively chosen message attacks (EUF-CMAs). Finally, experimental results confirm the feasibility and effectiveness of the proposed authentication scheme.

PCAS: Cryptanalysis and improvement of pairing-free certificateless aggregate signature scheme with conditional privacy-preserving for VANETs

Certificateless aggregate signature (CLAS) is an effective approach for the multiple authentications in multi-users and multi-information environments like the vehicular ad hoc networks (VANETs), which can address the certificate management issue in the traditional public key cryptography (PKC) and solve the key escrow problem in identity-based cryptography (IBC). In recent years, a new CLAS mechanism (LICLAS) is presented for the authentication of sensors in healthcare wireless medical sensor networks (HWMSNs). In this paper, we make an analysis and prove that LICLAS is not able to against forgery attacks. Thus, we present an improved CLAS scheme (PCAS) for vehicle authentication in VANETs, which satisfies the privacy and security requirements. PCAS constructs the signature algorithm based on Elliptic Curve Cryptography (ECC) to avoid bilinear pairing and Map-to-Hash function operations. In order to further improve security and efficiency of PCAS, the vehicle key generation and signature algorithm is revised. The pseudonym mechanism is also adopted to achieve conditional privacy preservation. Besides, PCAS allows to execute a batch verification of messages, where RSUs may verify the aggregated signatures from vehicles to reduce time overhead. Under the assumption that the elliptic curve discrete logarithm problem (ECDLP) is hard, PCAS is proved to be existentially unforgeable against adaptive chosen message attacks in the random oracle model. Through the performance analysis, under the same time complexity, PCAS is shown to more effective. Compared with LICLAS, for a single message and 2000 messages, the transmission overhead of PCAS is reduced by 25% and 25% respectively, and the computation overhead is reduced by 16.56% and 25.34% respectively.

Anonymous Certificateless Multireceiver Encryption Scheme for Mobile Communication Devices

With the rapid development of wireless communication technologies and the popularity of mobile communication devices, people can easily access the Internet through their mobile communication devices. Compared with the traditional wired communication, this brings great convenience to people’s lives, but at the same time, it also brings greater challenges in terms of security and privacy. In order to protect the confidentiality of the transmitted message and prevent the identity information of message recipients from being leaked, some certificateless multireceiver encryption (CLMRE) schemes that could realize the anonymity of the receivers have been proposed. But most of the proposed schemes are either under the random oracle model (ROM), or based on bilinear pairings and hash-to-point (HTP) operations, which lead to expensive operation costs in encryption or decryption. In the ROM, in order to gain the value of the hash function, the adversary makes a query to the challenger, but in the standard model (SM), the adversary can compute the hash function directly. The cryptographic scheme based on the SM has higher security than the cryptographic scheme based on the ROM. Therefore, it is very meaningful and necessary to design an efficient CLMRE scheme without bilinear pairings and HTP operations under the SM, which is suitable for mobile communication devices. In this article, we propose the first CLMRE scheme without bilinear parings and HTP operations in the SM, and we prove that this scheme is indistinguishable and anonymous against Type-I adversary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {A}_\text{I}$</tex-math></inline-formula> and Type-II adversary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {A}_{\text{II}}$</tex-math></inline-formula> . Additionally, we compare our scheme’s performance in calculation and communication with several previous schemes. The analysis shows that our novel scheme based on the SM is efficient in terms of calculation, communication, and it is suitable for mobile communication devices.

An Efficient Certificate-Based Aggregate Signature Scheme With Provable Security for Industrial Internet of Things

In Industrial Internet of Things (IIoT), the certificate-based aggregate signature (CBAS) scheme was used to ensure privacy and security of IIoT, thus, the concrete construction of CBAS scheme without bilinear pairing has proposed, which was employed as an underlying building block to create an efficient data aggregation protocol. In this article, we first point out that the previous CBAS scheme cannot keep its claimed security. Particularly, a malicious KGC can compute a valid forgery signature, because it has the knowledge of the master secret key. After that, we discussed how specific forgery attacks could be made to against the existing CBAS schemes, which demonstrates that the previous related constructions cannot achieve its claimed security. In order to further provide a secure CBAS scheme for IIoT, we suggest a method to improve the CBAS scheme and propose a concrete construction of it. In the random oracle model, based on the hardness of discrete logarithm problem, the security of our new proposal can be proved. Compared with the previous CBAS schemes, our construction has better security, which is efficient with respect to computation and communication.

Lightweight and Privacy-Preserving Multi-Keyword Search over Outsourced Data

In cloud computing, documents can be outsourced to the cloud server to achieve flexible access control and efficient sharing among multiple users. The outsourced documents can be intelligently searched according to some keywords with the help of cloud server. During the search process, some private information of outsourced documents may be leaked since the keywords may contain sensitive information of users. However, existing privacy-preserving keyword search schemes have high computation complexity, which are not suitable for resource-constrained end devices—that is, the data processing and search trapdoor generation procedures require users to take resource-intensive computations, e.g., high-dimensional matrix operations, exponentiations and bilinear pairings, which are unaffordable by resource-constrained devices. To address the issues of efficiency and privacy for realizing sorted multi-keyword search over outsourced data in clouds, this paper proposes a lightweight privacy-preserving ranked multi-keyword search (PRMS) scheme, which is further extended to allow each outsourced document to be associated with multiple types of keywords. The searched documents can be sorted according to their similarity scores between the search query and the keyword index of documents, so that only when the similarity score exceeds a given threshold, the corresponding searched document will be returned. The security analysis demonstrates that the proposed PRMS schemes can guarantee the privacy of outsourced documents and keywords, and provides unlinkability for search trapdoors. Performance analysis and comparison show the practicality of the proposed PRMS schemes.

A novel and lightweight wireless communication scheme for Vehicular Ad hoc Networks

Vehicular Ad hoc Network (VANET) has attracted more and more attention from academia and industry because of its self-organization, dynamics, and scalability. However, since the overwhelming majority of communication in VANET adopt wireless communication, which is vulnerable to attack, coupled with the high requirements of communication efficiency for dynamic VANET, the wide application of VANET still faces great challenges. In this paper, we propose a lightweight communication scheme (LWCS) suitable for VANET. The proposed scheme includes a lightweight authentication scheme and a one-to-many wireless communication scheme. The authentication model is based on ECDLP and message authentication code (MAC), which realizes mutual authentication and improves efficiency. The one-to-many communication model is different from the existing scheme using bilinear pairing. Instead, we take advantage of Chinese remainder theorem (CRT), so that the receiver can quickly reconstruct the key. Besides, the length of the ciphertext is not affected by the number of receivers. Security analysis shows that our scheme is secure under the assumptions that the IFP and ECDLP are intractable. Meanwhile, the proposed scheme satisfies multiple security requirements such as forward security, backward security and common attacks resistance. The performance analysis demonstrates theoretically and experimentally that our scheme is efficient compared with related schemes.

Efficient Equality Test on Identity-Based Ciphertexts Supporting Flexible Authorization

In the cloud, uploading encrypted data is the most effective way to ensure that the data are not leaked. However, data access control is still an open problem in cloud storage systems. To provide an authorization mechanism to limit the comparison of a user's ciphertexts with those of another, public key encryption supporting the equality test with four flexible authorizations (PKEET-FA) is presented. Subsequently, more functional identity-based encryption supporting the equality test (IBEET-FA) further combines identity-based encryption with flexible authorization. The bilinear pairing has always been intended to be replaced due to the high computational cost. Hence, in this paper, we use general trapdoor discrete log groups to construct a new and secure IBEET-FA scheme, which is more efficient. The computational cost for the encryption algorithm in our scheme was reduced to 43% of that of the scheme of Li et al. In Type 2 and 3 authorization algorithms, the computational cost of both was reduced to 40% of that of the scheme of Li et al. Furthermore, we give proof that our scheme is secure against one-wayness under the chosen identity and chosen ciphertext attacks (OW-ID-CCA), and indistinguishable against chosen identity and chosen ciphertext attacks (IND-ID-CCA).

Chebyshev Polynomial-Based Fog Computing Scheme Supporting Pseudonym Revocation for 5G-Enabled Vehicular Networks

The privacy and security of the information exchanged between automobiles in 5G-enabled vehicular networks is at risk. Several academics have offered a solution to these problems in the form of an authentication technique that uses an elliptic curve or bilinear pair to sign messages and verify the signature. The problem is that these tasks are lengthy and difficult to execute effectively. Further, the needs for revoking a pseudonym in a vehicular network are not met by these approaches. Thus, this research offers a fog computing strategy for 5G-enabled automotive networks that is based on the Chebyshev polynomial and allows for the revocation of pseudonyms. Our solution eliminates the threat of an insider attack by making use of fog computing. In particular, the fog server does not renew the signature key when the validity period of a pseudonym-ID is about to end. In addition to meeting privacy and security requirements, our proposal is also resistant to a wide range of potential security breaches. Finally, the Chebyshev polynomial is used in our work to sign the message and verify the signature, resulting in a greater performance cost efficiency than would otherwise be possible if an elliptic curve or bilinear pair operation had been employed.