Search

To address the issue of message confidentiality in certificateless signature schemes and the shortcomings of most signcryption schemes, such as incomplete security functions and low efficiency, a certificateless aggregate signcryption scheme based on elliptic curve encryption technology was proposed for vehicle-to-grid (V2G) networks. Part of the vehicle's public and private keys were generated by the vehicle itself, avoiding the problem of key escrow. Verification efficiency was improved by the local aggregator through aggregate unsigncryption. Conditional privacy protection was provided by a pseudonym mechanism, ensuring the anonymity of legitimate vehicles and the traceability and revocation of malicious vehicles. Binary polynomials were used to achieve autonomous updating of vehicle pseudonyms. In the random oracle model, the scheme was proven to meet indistinguishability under adaptive chosen ciphertext attacks (INDCCA2) and existential unforgeability under adaptive chosen message attacks (EUF-CMA). The security of the scheme was verified by the Scyther formal analysis tool. Performance analysis shows that, compared to recent signcryption schemes, the proposed scheme achieves an average reduction of approximately 12.9% in communication overhead and 84.4% in aggregate unsigncryption computation costs, while also meeting higher security requirements. [ABSTRACT FROM AUTHOR]

With the rapid increase in smart grid users and the increasing cost of user data transmission, proposing an encryption method that does not increase the construction cost while increasing the user ceiling has become the focus of many scholars. At the same time, the increase in users will also lead to more security problems, and it is also necessary to solve the privacy protection for users during information transmission. In order to solve the above problems, this paper proposes an aggregated ring encryption scheme based on the SM2 algorithm with special features, referred to as SM2-CLARSC, based on the certificateless ring signcryption mechanism and combining with the aggregate signcryption. SM2-CLARSC is designed to satisfy the basic needs of the smart grid, and it can be resistant to replay attacks, forward security and backward security, etc. It has better security and higher efficiency than existing solutions. Comparing SM2-CLARSC with existing typical solutions through simulation, the result proves that this solution has more comprehensive functions, higher security, and significant computational efficiency improvement. [ABSTRACT FROM AUTHOR]

Unmanned aerial vehicles (UAVs) have gained significant attention in robotics research during the past decade, despite their presence dating back to 1915. Unmanned Aerial Vehicles (UAVs) are capable of efficiently and successfully carrying out a range of tasks. As a result, the use of many UAVs to fulfill a specific mission has grown into a popular area of research. Researchers have conducted investigations on the use of numerous UAVs in various fields such as remote sensing, disaster relief, force protection, military warfare, and surveillance. Efficiency and robustness are crucial factors for carrying out key operations. Multiple groups of UAVs, through appropriate interaction and concerted procedures, can achieve these objectives. The unpredictable features of UAVs and their reliance on unprotected and widely available wireless networks create challenges in establishing secure communication between a private edge cloud and a UAV. Consequently, secret UAV networks that utilize edge computing necessitate supplementary precautions to safeguard their networks. This research paper talks about a simple, lightweight, certificate-free, heterogeneous online/offline aggregate signing scheme called CL-PFASC. It comes from the discrete logarithm problem. The concert scheme enables UAVs to communicate with a GS without the need for a bilinear coupling operation. We classify the UAVs as identity-based cryptography (IBC) and the ground station GS as public-key infrastructure (PKI). We verify the security features of the suggested scheme using a formal security evaluation method, the random oracle model, under confidentiality and unforgeability. We also evaluate its communication and computation costs and compare them to those of similar existing schemes. The performance and security study indicate that the suggested approach improves both efficiency and security.

The vehicular sensor network (VSN) is an important part of intelligent transportation, which is used for real-time detection and operation control of vehicles and real-time transmission of data and information. In the environment ofVSN, massive private data generated by vehicles are transmitted in open channels and used by other vehicle users, so it is crucial to maintain high transmission efficiency and high confidentiality of data. To deal with this problem, in this paper, we propose a heterogeneous fault-tolerant aggregate signcryption scheme with an equality test (HFTASET). The scheme combines fault-tolerant and aggregate signcryption, whichnot onlymakes up for the deficiency of low security of aggregate signature, but alsomakes up for the deficiency that aggregate signcryption cannot tolerate invalid signature. The scheme supports one verification pass when all signcryptions are valid, and it supports unbounded aggregation when the total number of signcryptions grows dynamically. In addition, this scheme supports heterogeneous equality test, and realizes the access control of private data in different cryptographic environments, so as to achieve flexibility in the application of our scheme and realize the function of quick search of plaintext or ciphertext. Then, the security of HFTAS-ET is demonstrated by strict theoretical analysis. Finally, we conduct strict and standardized experimental operation and performance evaluation, which shows that the scheme has better performance. [ABSTRACT FROM AUTHOR]

With the rapid increase in smart grid users and the increasing cost of user data transmission, proposing an encryption method that does not increase the construction cost while increasing the user ceiling has become the focus of many scholars. At the same time, the increase in users will also lead to more security problems, and it is also necessary to solve the privacy protection for users during information transmission. In order to solve the above problems, this paper proposes an aggregated ring encryption scheme based on the SM2 algorithm with special features, referred to as SM2-CLARSC, based on the certificateless ring signcryption mechanism and combining with the aggregate signcryption. SM2-CLARSC is designed to satisfy the basic needs of the smart grid, and it can be resistant to replay attacks, forward security and backward security, etc. It has better security and higher efficiency than existing solutions. Comparing SM2-CLARSC with existing typical solutions through simulation, the result proves that this solution has more comprehensive functions, higher security, and significant computational efficiency improvement.

Fog-based smart grids have been a hit research field in recent years, providing low latency, location-sensitive and latency-aware local data management by connecting the cloud and edge devices. Traditional data aggregation schemes adopt encryption-then-signature paradigm in smart grids, which requires encryption and signature algorithms to be performed separately or in sequence. Additionally, the privacy of users is still at risk of disclosure and the proliferation of pseudonyms is prominent. In order to solve the above problems, in this paper we propose a novel privacy-preserving aggregate signcryption and user query scheme with allowing dynamic updating of pseudonyms for fog-based smart grids. Firstly, a privacy-preserving data aggregation method based on certificateless signcryption is proposed. In order to solve the problem of complex pseudonym update and potential risk caused by not updating for too long, we specially design a dynamic update rule according to the use characteristics of pseudonym. Secondly, when the user's pseudonym is dynamically updated, the user query function is designed according to the time series data of each user. This method has been applied to the fog-based smart grids scenario creatively and introduces dynamic updating pseudonym into fog-based smart grids. Finally, theoretical analysis and extensive simulation experiments are designed to evaluate the performance of the scheme. Experimental results show that our scheme has better performance than existing schemes. [ABSTRACT FROM AUTHOR]

The heterogeneous aggregation signcryption technology not only solves the problem of communication under different cryptosystems, but also performs aggregate signature verification on mutiple messages. This paper analyzes the heterogeneous signcryption scheme proposed by Niuetal that ensures data privacy, and points out that both single signcryption and aggregation signcryption ca n be forged in this scheme, and there are passive attacks in the key generation center. Firstly, we detail a specific attack process, which illustrates that the Niuscheme generates passive attacks. Secondly, we improve the Niuscheme and prove that the improved scheme has no security holes through security analysis. Finally, performance analysis and simulation show that the improved scheme has the equivalent efficiency to the original scheme. [ABSTRACT FROM AUTHOR]

Taking into account the secure communication and privacy protection in heterogeneous cryptography systems, we propose a heterogeneous aggregate signcryption scheme from certificateless cryptosystems to identity-based cryptography systems, which allows multiple senders to communicate securely with multiple recipients. The scheme makes the senders anonymous in the system, and only trust agencies can track the senders' real information. For the receivers, the disclosure of the legitimate recipients' user information to unauthorized users is prevented by applying the Lagrange interpolation formula. In the random oracle model, it is proved that the scheme possesses indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen-message attacks. Experimental results show that the scheme effectively improves the computational efficiency of the system. [ABSTRACT FROM AUTHOR]

The concept of aggregate signcryption was first introduced in 2009 by Selvi et al. [Identity based aggregate signcryption schemes, Lecture Notes in Computer Science 5922 LNCS, 2009, pp. 378–397]. The aggregation process of these schemes reduces the amount of exchanged information and is particularly useful in low-bandwidth communication networks and computationally-restricted environments such as wireless sensor networks. Selvi et al.’s scheme is in the identity-based setting and suffers from the key escrow problem. The goal of this paper is to overcome this problem and propose a suitable security model for aggregate signcryption in the certificateless setting. We further propose a concrete certificateless aggregate signcryption scheme which is based on Barbosa and Farshim’s certificateless signcryption scheme [Certificateless signcryption. In: M. Abe, V. Gligor (Eds.), Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security (ASIACCS-08), ACM, New York. pp. 369–372]. We then prove the security of the proposed scheme in the random oracle model under the gap Bilinear Diffie–Hellman and computational Diffie–Hellman intractability assumptions.

The concept of aggregate signcryption was first introduced in 2009 by Selvi et al. [Identity based aggregate signcryption schemes, Lecture Notes in Computer Science 5922 LNCS, 2009, pp. 378–397]. The aggregation process of these schemes reduces the amount of exchanged information and is particularly useful in low-bandwidth communication networks and computationally-restricted environments such as wireless sensor networks. Selvi et al.’s scheme is in the identity-based setting and suffers from the key escrow problem. The goal of this paper is to overcome this problem and propose a suitable security model for aggregate signcryption in the certificateless setting. We further propose a concrete certificateless aggregate signcryption scheme which is based on Barbosa and Farshim’s certificateless signcryption scheme [Certificateless signcryption. In: M. Abe, V. Gligor (Eds.), Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security (ASIACCS-08), ACM, New York. pp. 369–372]. We then prove the security of the proposed scheme in the random oracle model under the gap Bilinear Diffie–Hellman and computational Diffie–Hellman intractability assumptions. [ABSTRACT FROM AUTHOR]

In this study, we propose an efficient aggregate signcryption scheme to maximize the security of data in a kind of wireless medical network named the disconnected or unattended wireless sensor network (applied in medical systems). These networks address patients who need to be monitored for a long time. The main challenge of these networks that are usually implanted on the patient's clothing and established in sensitive conditions is that the server (station) visits sensors continuously. Moreover, the sensors must retain data for long enough time to off-load to the station as they have limited capacity and batteries. This disconnected nature gives adversaries the power to read and modify target data without being detected or disclose private medical data related to a patient. In this paper, we address these security problems and improve the first study of identity-based aggregate signcryption in UWSNs to achieve both key privacy and invisibility. Our improved approach is at the same time efficient in terms of space and communication overload. Moreover, the proposed scheme allows servers to efficiently verify and unsigncrypt all the related data accumulated by sensors. We further show that the proposed scheme has resistance against reading and modifying attacks. We compare our scheme with the best alternative works in the literature. [ABSTRACT FROM AUTHOR]

With the vigorous development of edge computing, edge devices are more and more powerful and widely deployed. Mobile fog computing-based Smart Grid emerges as the times require and attracts much attention, by combining Smart Grid and mobile fog computing. Nonetheless, user privacy is also facing new challenges, which are caused by mobility. Particularly the key management problem when multiple users apply for key frequently. For the purpose of solving this problem, this paper proposes a novel privacy-preserving multi-level aggregate signcryption and query scheme for Smart Grid with mobile fog computing and quantum key pool. Firstly, we develop a multi-level and dynamic privacy-preserving aggregate signcryption method without trusted authority, including space-based data aggregation and time-based data aggregation. To enhance the security of key management, we introduce quantum key pool to fast distribute the keys. Secondly, we implement a data query and share method based on proxy re-encryption. It not only supports users to query historical data and bills, but also realizes secure data sharing with other third parties. Ultimately, we design formal security analysis and digital simulation experiments. The analysis results show that the proposed scheme can achieve the characteristics of secure, high efficiency, lightweight and robustness. In the background of the increasingly wide application of quantum technology, we hope this work is a trigger for other scholars and institutions in the hybrid application of quantum and classical technology. [ABSTRACT FROM AUTHOR]

In this paper, we propose aggregate signcryption for achieving data security in UWSNs. The main challenge of these networks established in sensitive environments is offline sink visiting. Moreover, the sensors must retain collected data for long enough time to offload them onto the itinerant sink. Thus, the unattended nature of data collection intervals might offer the adversary the opportunity to apply various attacks without detection. In this paper, employing low order operations (in time and space), we propose a new secure scheme in which various security goals such as confidentiality (through encrypting), authentication and integrity (through signing) are achieved. In addition, the aggregation process of our scheme reduces the space and communication overheads both for sensors and sink, i.e. the proposed technique efficiently enables the sensors and sink to protect, verify and recover all the related data. We further compare our scheme with the best alternative work in the literature. [ABSTRACT FROM AUTHOR]

Aggregate signcryption could provide shortened ciphertext and the batch verification, which could reduce the overhead greatly and was useful in the many to one communication. But the traditional schemes of aggregate signcryption only could provide part aggregation, which could not play the best of aggregation. This paper proposed an aggregate signcryption scheme with full aggregation and constant ciphertext, which could provide constant ciphertext and the receiver could recover the plaintexts successively through given operations. It proved the proposal to be more efficient, the length of ciphertext was only | G |. What is more, the scheme is proved to be confidential and unforgettable and can provide with public verifiability at the same time, which is suited to use in the networks with constrained bandwidth. [ABSTRACT FROM AUTHOR]