Pair Of Operators Research Articles

Cryptanalysis and Improvement of Several Identity-Based Authenticated and Pairing-Free Key Agreement Protocols for IoT Applications.

Internet of Things (IoT) applications have been increasingly developed. Authenticated key agreement (AKA) plays an essential role in secure communication in IoT applications. Without the PKI certificate and high time-complexity bilinear pairing operations, identity-based AKA (ID-AKA) protocols without pairings are more suitable for protecting the keys in IoT applications. In recent years, many pairing-free ID-AKA protocols have been proposed. Moreover, these protocols have some security flaws or relatively extensive computation and communication efficiency. Focusing on these problems, the security analyses of some recently proposed protocols have been provided first. We then proposed a family of eCK secure ID-AKA protocols without pairings to solve these security problems, which can be applied in IoT applications to guarantee communication security. Meanwhile, the security proofs of these proposed ID-AKA protocols are provided, which show they can hold provable eCK security. Some more efficient instantiations have been provided, which show the efficient performance of these proposed ID-AKA protocols. Moreover, comparisons with similar schemes have shown that these protocols have the least computation and communication efficiency at the same time.

CORRECTION OF THE CYLINDRICAL HELICAL-GEAR WHEEL PAIR FOR WEAR DECREASE OF TEETH’ INVOLUTE SURFACES

Purpose. It is to create a method for determination of profile shift coefficients, such that during the operation of a cylindrical helical-gear pair the sum of the wear rates of involute surfaces on the contacting sections at the highest and lowest active points of teeth’ profiles of driving and driven wheels will be a minimum.
 Research methods are based on integrated application of the involute gear theory and tribological laws. The secant method that is known in computational mathematics is used to find a root of nonlinear equation.
 Results. The method is created for determination of rational values of correction parameters for cylindrical helical-gear wheels, which maximize the service life of this gear pair until the maximum sum of worn-layer thicknesses on the contacting sections of the teeth’ active surfaces reaches limiting permissible value. An example of application of this method in design calculation of the cylindrical helical-gear pair is given.
 Scientific novelty. Calculation model is elaborated for determination of the sum of worn-layer thicknesses on the most wearing contacting sections of the teeth’ active surfaces of a cylindrical helical-gear wheel pair. It is derived an equation of the linkage between such values of profile shift coefficients for the driving and driven helical-gear wheels which minimize the greatest sum of wear rates on mentioned sections of teeth’ surfaces. Solution of this equation by numerical method for the helical-gear pair having standard distance between axes allows determination of rational values of correction parameters for these wheels.
 Practical value. Application of the created method for determination of profile shift coefficients is expedient in design of cylindrical helical-gear pairs for machines and equipment, which operate in conditions when it is impossible to protect the engagement region from ingress of abrasive particles.

Kth min Threshold Encryption for Privacy-preserving Data Evaluation

Abstract The $k$th min threshold is to judge whether the $k$th smallest element of an attribute set along with a confidential file is greater than a predefined threshold, which is a fundamental, primitive operation in data evaluation, such as risk evaluation in business investment. However, it will compromise the privacy of the confidential files when proceeding with such a data evaluation because there is often a large amount of sensitive information involved in them, which the organizations/individuals are reluctant to expose due to the risk of losing a competitive advantage. Motivated by the issue how to preserve the privacy of the confidential files during data evaluation, in this research, we first present a new encryption notion called $k$th min threshold encryption (KTE) for serving privacy-preserving data evaluation. In this notion, the confidential file will be encrypted under an attribute set for its privacy protection prior to being sent to a receiver, and a decryption key is generated from a threshold $d$ and a rank $k$ of element, both selected by the receiver. The decryption will be successful if and only if the $k$th smallest element of the attribute set is greater than $d$. We then describe a concrete construction of KTE in the public-key setting. In particular, our construction features optimally short private keys, which only consists of one group element. By virtue of this advantage, it is quite practical because of only two pairing operations for decryption computation.

Mobile Sensoring Data Verification via a Pairing-Free Certificateless Signature Secure Approach against Novel Public Key Replacement Attacks

To achieve flexible sensing coverage with low deployment costs, mobile users need to contribute their equipment as sensors. Data integrity is one of the most fundamental security requirements and can be verified by digital signature techniques. In the mobile crowdsensing (MCS) environment, most sensors, such as smartphones, are resource-limited. Therefore, many traditional cryptographic algorithms that require complex computations cannot be efficiently implemented on these sensors. In this paper, we study the security of certificateless signatures, in particular, some constructions without pairing. We notice that there is no secure pairing-free certificateless signature scheme against the super adversary. We also find a potential attack that has not been fully addressed in previous studies. To handle these two issues, we propose a concrete secure construction that can withstand this attack. Our scheme does not rely on pairing operations and can be applied in scenarios where the devices’ resources are limited.

DNA logic programming: From concept to construction

AbstractDNA programming, which is based on the principle of base complementary pairing and Boolean operations, exhibits organizational structures and algorithms similar to those observed in machine language. Consequently, the practical implementation of DNA logic programming can be achieved through the utilization of programming techniques, enabling the discrimination and output generation. In recent years, DNA programming has witnessed a convergence with disciplines, such as life sciences, medicine, and other interdisciplinary areas, thereby giving rise to an advanced research system that yields valuable insights. This development has paved the way for multidisciplinary cutting‐edge research. Furthermore, the successful transition from conceptualization to the practical implementation of DNA programming has been accomplished. This review summarizes the recent advances in DNA logic programming within the biomedical fields, specifically emphasizing the conceptualization and execution of DNA logic programming constructs. The benefits and obstacles associated with the adoption of DNA programming in cutting‐edge research areas are also highlighted.

Improving Throughput of Mobile Sensors via Certificateless Signature Supporting Batch Verification

Mobile sensors enjoy the advantages of easy installation and low consumption, which have been widely adopted in many information systems. In those systems where data are generated rapidly, the throughput of the sensors is one of the most fundamental factors that determine the system functionality. For example, to guarantee data integrity, digital signature techniques can be applied. In many practical scenarios, such as the smart grid system, data are generated rapidly and, hence, the signature together with the data must also be transmitted and verified in time. This requires the mobile sensors to support a high-throughput data processing ability. In this setting, how to achieve efficient signature schemes supporting batch verification must be considered. Many signatures, such as the original national cryptographic standard, namely, the SM2 algorithm, do not support batch verification and are in a public-key infrastructure setting. In this paper, we propose a SM2-based certificateless signature scheme with batch verification, which is suitable for the aforementioned environment. The scheme extends the Chinese cryptographic standard SM2 algorithm to the certificateless setting and multiple signatures can be verified simultaneously. Another advantage of this scheme is that its signing phase does not involve any pairing operation. The verification phase only requires a constant pairing operation, which is not related to the number of signatures to be verified. The construction is generic and can be instantiated using any traditional signature scheme.

МЕТОДИКА ПРОГНОЗИРОВАНИЯ РЕСУРСА УЗЛОВ И ДЕТАЛЕЙ ЖЕЛЕЗНОДОРОЖНОГО ПОДВИЖНОГО СОСТАВА ПРИ ПОМОЩИ МАШИННОГО ОБУЧЕНИЯ

The study objective is to develop a system for forecasting the service life of components and parts of railway rolling stock.
 The task to which the paper is devoted is to determine the service life of wheel pairs of railway rolling stock before their next turning.
 Research methods include a technique for forecasting the resource of components and parts of railway wheel pairs using a system for estimating expected parameters, including wheel run. The study includes the use of three different machine learning algorithms: linear regression, random forest and gradient boosting. The trained models of each algorithm are shown, as well as the convergence of MSE, MAPE an d R-squared metrics at each iteration of learning. 
 The novelty of the work: the study results make it possible to predict the period of wheel pairs operation with high accuracy and include a feedback mechanism for automating and updating the model, which increases the accuracy of forecasting.
 Research results: on the basis of the proposed method, a system is developed that allows determining the time interval of operation of rolling stock wheel pairs before their next turning.
 Conclusions: the proposed method will make it possible to predict the period of operation of certain components and parts under the conditions of a given proving ground until their working condition is restored, based on a system for evaluating expected parameters using machine learning.

BE-TRDSS: Blockchain-Enabled Secure and Efficient Traceable-Revocable Data-Sharing Scheme in Industrial Internet of Things

As an important component of the industrial Internet of Things (IIoT), the smart factory uses IIoT and equipment-monitoring technology to collect data to reasonably arrange production. A large number of data is collected and uploaded to the IIoT cloud platform. However, the IIoT cloud platform is semi-trusted and has structural limitations and vulnerability, which makes it necessary to realize data dynamic security sharing and malicious users tracking. In this paper, we show that most recent work on this issue is still vulnerable to security threats at first. Then a blockchain-enabled dynamic and traceable data-sharing scheme for a smart factory is proposed. Blockchain performs the user authentication and stores the ciphertext index and public keys to avoid tampering with shared data. The tracking algorithm tracks malicious users and adds them to a revocation list embedded in the ciphertext. And the authority can flexibly select domain or user revocation as required. The LSSS access policy is hidden to protect user privacy, and the cloud server uses match test algorithm to detect whether users meet hidden access policy. Additionally, online-offline encryption and outsourced decryption improve the efficiency of the scheme where the ciphertext and the pairing operations required for decryption achieve constant size. A performance analysis shows that the scheme can resist a variety of collusion attacks, and simulations show that it outperforms current schemes.

Certificateless Anonymous Signcryption Scheme With Provable Security in the Standard Model Suitable for Healthcare Wireless Sensor Networks

In healthcare wireless sensor networks(HWSNs), wireless sensors are placed on the patient, which collect the patient’s vital signs parameters and various environmental information, and send these data to the doctor, so that the doctor is able to perform real-time remote monitoring for the patient. The patient’s vital signs parameters contain a lot of private information. It is very likely to cause the leakage of patient’s private information if these parameters are transmitted through the public channel. In addition, many patients don’t want doctors to know their true identity. We designed a certificateless anonymous signcryption (CL-ASC) scheme for HWSNs in this paper. It encrypts the patient’s vital signs parameters, authenticates the legitimacy of the sensor, and realizes the anonymity of the sensor. We then showed the security proofs of new scheme in the standard model. Finally, we compared the performance of the six schemes. Since only three pairing operations are used, the new scheme enjoys higher computation efficiency and is suitable for HWSNs.

Scaling dimension of Cooper pair operator from the black hole interior

We have shown that in holographic superconductivity theory for 3+1 dimensional system, the scaling dimension of Cooper pair operator can be obtained as a quantized value if we request that the the scalar function describing the order parameter is finite inside the black hole as well as outside. This should be contrasted to the usual situation where we set the mass squared of the scalar by hand. Our method can be applied to any order parameters.

LMCLAEKS: LWE-assisted multi-recipient certificateless authenticated encryption with keyword search

In Industrial Internet of Things (IIoT) environments, interconnected gadgets and sensors produce large-scale, dynamic, and private data by the arrival of the fourth industrial revolution. Such data must be stored by cloud service providers (CSP) and is capable of accessed by consumers. To guarantee data privacy, Public-key Encryption with Keyword Search (PEKS) is a cryptographic primitive designed to resolve this challenge, which is troubled by costly certificate management and key escrow problem. The majority of current PEKS schemes rely on expensive bilinear paring and single-receiver, which are highly vulnerable to keyword guessing attacks (KGA) and have low computational efficiency. Consequently, we propose an Multi-recipient Certificateless Authenticated Encryption with Keyword Search (MCLAEKS) scheme, which has the following advantages: 1) hiding search pattern; 2) data allows multiple consumers; 3) involving no costly bilinear pairing operations; 4) resisting Inside Keyword Guessing Attacks (IKGA). The comparison and analysis of performance indicate that the proposed scheme is more efficient than existing PEKS schemes and is suitable for the IIoT environment.

IoT-friendly, pre-computed and outsourced attribute based encryption

The Internet of Things (IoT) and its applications are growing at an unprecedented rate. In such a complex network with an enormous number of nodes, an important challenge is how to securely handle the access control problem. Attribute Based Encryption (ABE) is a powerful and flexible cryptographic primitive to address the challenge of realizing fine-grained access control in many systems. However, using ABE in IoT systems is often problematic due to the heavy computational overhead originating from the bilinear pairing operations and the relatively large key sizes of ABE schemes.This paper deals with this challenge by proposing some solutions to overcome the limitations of using ABE in IoT systems. The contributions of this paper are divided into three parts. In the first part, we propose modified fuzzy identity-based encryption (FIBE) schemes that use fewer optimal ate pairing operations compared to the original FIBE. FIBE is a special case of ABE, in which the access structure simplifies to a threshold gate. We also introduce a new security notion named the Conditional Chosen Ciphertext Attack-2 (Conditional CCA-2) selective security which is stronger than the CPA selective security notion. We prove that the proposed FIBE schemes have Conditional CCA-2 selective security, under the Asymmetric Decisional Modified Bilinear Diffie–Hellman (ADMBDH) assumption. In the second part, we proposed Key Policy Attribute Based Encryption (KP-ABE) schemes that use fewer pairing operations compared to the previous KP-ABE schemes. Our FIBE and KP-ABE schemes use elliptic curve groups which ensure shorter keys. In the third part of our contribution, we propose secure methods to outsource the heavy operations in FIBE and KP-ABE schemes (i.e. scalar multiplication by a curve point, exponentiation, and pairing) such that IoT devices can cope with the complexity.

Blockchain-assisted certificateless signcryption for vehicle-to-vehicle communication in VANETs

In vehicular ad-hoc networks (VANETs), real-time messages are used to guarantee transportation efficiency and passenger safety through the exchange among vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I). Therefore, the timely acceptance of safety messages is critical to establishing efficient and reliable communication in VANETs, which hinges on an efficient privacy-preserving authentication mechanism. However, these mechanisms face either security or performance problems. Although some state-of-the-art signcryption schemes meet the needs of security requirements of authentication, performance is not efficient in computational overhead for an increase of the bilinear pairing operations in batch unsigncryption verification. Therefore, we have designed an efficient and provably secure blockchain-assisted certificateless signcryption (BACLS) that provides a feasible security communication in theoretical analysis and experiments. The BACLS scheme ensures security against type-I and type-II attackers in regard to existential unforgeability against adaptively chosen message attacks (EUF-CMA) under the hardness assumption of the gap bilinear Diffie–Hellman problem and indistinguishability against adaptive chosen ciphertext attack (IND-CCA2) under the hardness assumption of the elliptic curve discrete logarithm problem in the random oracle model (ROM). The experiments demonstrate that the BACLS scheme significantly reduces unsigncryption computational costs and power consumption in contrast to state-of-the-art schemes, and promotes the development of a decentralized authentication system in VANETs.

Efficient and Flexible Multiauthority Attribute-Based Authentication for IoT Devices

The correctness and reliability of data sources are the keys to the practicality of data collected by IoT devices. Attribute-based signature(ABS) is a cryptographic primitive for users to sign with their own attributes, which can be applied to the authentication process in IoT scenarios. The attribute authority is responsible for issuing the attribute key to the user in ABS. Multiple authorities can complete attribute management tasks to avoid the threat of a single authority. However, attribute authorities need to execute multiple interactions to collaborate to generate attribute keys for users, which brings a large transmission burden. In addition, a lot of resource-constrained terminals in the IoT mostly play the role of signer or verifier in authentication protocols. The signature generation and verification algorithms often have heavy pairing and exponentiation operations. Currently, no ABS scheme takes into account the efficiency of all participating entities simultaneously. In this paper, we present an aggregated anonymous key issue (AAKI) protocol to reduce the transmission burden between multiple authorities. Meanwhile, the non-interactive zero-knowledge proof aggregate exponentiation (NI-ZKPoKAE) protocol is designed to aggregate the transmitted secret values in AAKI. To reduce the computational burden of signers and verifiers, Blakley secret sharing, where the Hadamard matrix is used more efficiently to handle the (n,n)-threshold, is used to construct an efficient and fine-grained multi-authority ABS (EFMA-ABS) scheme. This brings high efficiency to all three types of parties involved in IoT authentication. Our above-mentioned protocols have been proven to be feasible and effective.

User-Friendly Public-Key Authenticated Encryption With Keyword Search for Industrial Internet of Things

The Industrial Internet of Things (IIoT) incorporates massive physical devices to collect ambient data. Due to the limited types of equipment in IIoT, most of the data has to be saved on a cloud server before it can be processed and analyzed. The ciphertext generated by traditional encryption techniques is difficult to search in subsequent use. Public-key Encryption with Keyword Search (PEKS) can provide data encryption as well as confidential searching, but traditional PEKS schemes are susceptible to internal keyword guessing attacks (IKGA) caused by the limited space of commonly-used keywords. To address this issue, the cryptographic primitive of Public-key Authenticated Encryption with Keyword Search (PAEKS) was proposed, while most of the existing schemes are not appropriately applied to IIoT for involving time-consuming bilinear pairing operations. In this paper, we first propose a user-friendly PAEKS scheme that totally circumvents bilinear pairing operations during generating keyword ciphertext and trapdoor. Then we prove its multi-ciphertext indistinguishability and trapdoor privacy based on decisional q-ABDHE and CDH assumptions in the random oracle model together with conducting the theoretical and experimental comparisons. The results show that the computational overhead of our proposal is significantly reduced comparing with most existing classical PAEKS schemes without causing other communication costs or security loss. Due to its better performance and security, our scheme is better suited for lightweight devices in the IIoT.

Authentication and encryption protocol with revocation and reputation management for enhancing 5G-V2X security

This paper presents a novel robust solution for key management, message encryption, and authentication, offering enhanced security for 5G-V2X communication. By incorporating bilinear pairing, and AES encryption, the protocol achieves a high level of security. The protocol consists of two key phases: key management and distribution, and message authentication and encryption. In the key management phase, secret sharing and polynomial interpolation techniques are used to generate and distribute the master secret key. The message authentication and encryption utilize bilinear pairing for integrity and origin authentication and symmetric encryption for confidentiality. To address the real-time update limitations of traditional revoking approaches, a reputation-based vehicle revocation mechanism is proposed. This mechanism allows fair revoking based on reputation scores and authenticated feedback, ensuring effective resource management. The proposed protocol utilizes the MIRACL library to implement the bilinear pairing operations. Comparative analysis demonstrates the superior performance of the protocol compared to other bilinear pairing protocols. The results show that the proposed protocol enhances authentication and encryption while incurring short times for message signing and verification (1.925 ms and 7.115 ms, respectively). Furthermore, the protocol supports signature aggregation using bilinear properties, resulting in constant verification time regardless of the number of signatures.

A Lightweight CP-ABE Scheme with Direct Attribute Revocation for Vehicular Ad Hoc Network.

Ciphertext-Policy Attribute-Based Encryption (CP-ABE) technology provides a new solution to address the security and fine-grained access control of traffic information in vehicular ad hoc networks (VANETs). However, in most CP-ABE schemes for VANETs, attribute revocation suffers from high system consumption and complex revocation operations, as well as from high computational overhead and low efficiency due to the use of bilinear pairwise operations. Based on this, this paper proposes a lightweight CP-ABE scheme that supports direct attribute revocation in VANETs. The scheme implements an agent-based direct attribute revocation mechanism by separating dynamic and static attributes of vehicle terminals, which reduces system consumption and simplifies the revocation operation process. The scheme uses scalar multiplication on elliptic curves instead of bilinear pairing operations and uses computational outsourcing techniques to reduce the terminal decryption cost and improve the efficiency of the scheme. The security and performance analysis shows that the overall efficiency of our scheme is better than the existing schemes under the premise of ensuring data confidentiality and integrity.

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.

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.