Key Update Phase Research Articles

Dynamic identity‐based broadcast proxy re‐encryption for data sharing in autonomous vehicles

SummaryAutonomous vehicles (AVs), as the essential part of intelligent autonomous transportation system, improves vehicle communication efficiency and supports diverse kinds of social services. However, with the development of AVs, more data has been generated by the sensors about the road, traffic, street light, and weather conditions. This also inevitably bringing new security problems, such as secure data sharing. Although the identity‐based broadcast proxy re‐encryption (IBBPRE) can be used to realize one‐to‐many data sharing, most existing schemes require access to the data owner for the group shared key update phases since the data owner's private key is mandatory for the group shared key generation. Therefore, frequent interaction with the data owner increases the operational burden and risks leaking the data owner's private key. Thus, we design a dynamic identity‐based broadcast proxy re‐encryption (DIB‐BPRE) to solve the problem of re‐encryption update. In the proposed scheme, a vehicle cloud server directly revokes or adds a group of data receivers, designated by the data owner, from the re‐encryption key. Finally, the theoretical and experimental analyses demonstrate that the DIB‐BPRE scheme is efficient, and it is suitable for data sharing in AVs.

Providing Membership Privacy to the Asynchronous Ratcheting Trees Protocol without losing Scalability

A secure messaging protocol, such as the Signal protocol, provides end-to-end encrypted asynchronous communication. This paper focuses on a secure group messaging (SGM) protocol, and proposes a method capable of hiding membership information from the viewpoint of non group members, which we call “membership privacy”. In this work, we add membership privacy to the Asynchronous Ratcheting Trees (ART) protocol (proposed by Cohn-Gordon et al., (ACM CCS 2018)). For hiding membership-related values in the setup phase, we employ a key-private and robust publickey encryption (Abdalla et al., TCC2010/JoC2018). Moreover, we introduce a group common key to encrypt membership information in the key update phase. Our modification achieves asymptotically the same efficiency of the ART protocol in the setup phase. Any additional cost for key update does not depend on the number of group members. Therefore, the proposed protocol can add membership privacy to the ART protocol with a quite small overhead. Specifically, one encryption and decryption of a symmetric-key encryption scheme and one execution of a key-derivation function for each key update are employed. Finally, we discuss how to extend our protocol to provide sender-specific authentication, dynamic groups, group-size hiding, and how to adopt our technique to the Messaging Layer Security (MLS) protocol. We note that, although Chase et al. (ACM CCS 2020) have considered the same notion, their proposal is an extension of Signal so called “Pairwise Signal” where a group message is repeatedly sent over individual Signal channels. Thus their protocol is not scalable.

A quantum deniable authentication protocol based on two-mode squeezed quantum states

A quantum deniable authentication protocol based on the theory of continuous quantum by using two-mode squeezed quantum states is proposed. By introducing the key agreement mechanism, the message sender and the specified receiver will first agree a new shared secret key by key update phases without the help of a third center and without their interaction by utilizing the amplitude and the phase properties of the entangled optical modes, and then the sender generates the message authentication code by using the new shared secret key. Security analysis results show that the protocol satisfies the basic security requirements of deniable authentication protocol such as completeness and deniability, and can withstand forgery attack, impersonation attack, inter-resend attack and beam splitter attack.

SEEMAKA: Secured Energy-Efficient Mutual Authentication and Key Agreement Scheme for Wireless Body Area Networks

With the empowerment of wireless networking technologies and medical sensors, WBAN is playing a major part in modern medical systems. As a key application of IoT, WBAN has shown swift growth and adoption in recent years because of its capabilities such as continuous and seamless monitoring of patients and collection of their biomedical data in real-time which is further used by doctors for clinical diagnosis and treatment. Despite numerous benefits, WBAN lacks a clear in-depth defense line because of the vulnerability caused by its openness and mobility raising issues like privacy leakage, complicated requirements and security concerns from unauthenticated or malicious adversaries. To alleviate the aforementioned issues and prevent adversaries from intimidating legitimate users or exploiting WBAN services, a secured energy-efficient mutual authentication, and key agreement scheme (SEEMAKA) for two-tier WBAN is propounded. In particular, SEEMAKA achieves desirable security features and thwarts different security attacks using fewer hash invocations and bitwise XOR operations, nicely meeting the need for sensor nodes equipped with limited capability. More importantly, the security of SEEMAKA is assessed through sound informal analysis as well as using Automated Validation of Internet Security Protocols and Applications (AVISPA). For verifying the correctness of SEEMAKA, widely-accepted Burrows–Abadi–Needham (BAN) Logic is used. For a better understanding, SEEMAKA is evaluated over NS2 along with counterpart schemes for End-to-End Delay and Throughput. Finally, a set of thorough relative analyses between SEEMAKA and other relevant schemes are performed and the outcomes manifest that SEEMAKA attains superior efficiency concerning processing overhead, energy dissipation, and security features. Relative to Li et al.’s scheme, SEEMAKA outperforms with a reduction of 2 XOR operations in processing cost at master node, includes master key update phase (to make the system safe from master node spoofing attack) and counters sensor node spoofing attack.

Comment on “A novel quantum deniable authentication protocol without entanglement”

Shi et al. (Quantum Inf Process 14(6):2183–2193, 2015) proposed a novel quantum deniable authentication protocol in which new shared secret keys can be updated timely with the help of a trusted party, and the fact that only the specified receiver could identify the true source of a given message is guaranteed by the new shared secret keys generated in the key update phase. Hence, the core of Shi et al.’s protocol is the key update phase . However, the analysis in this paper shows that there is a bug in the key update phase, which can lead to the failure of updating the shared key. Furthermore, an improved simple method is proposed to mitigate the security weakness.

Efficient Anonymous Authenticated Key Agreement Scheme for Wireless Body Area Networks

Wireless body area networks (WBANs) are widely used in telemedicine, which can be utilized for real-time patients monitoring and home health-care. The sensor nodes in WBANs collect the client’s physiological data and transmit it to the medical center. However, the clients’ personal information is sensitive and there are many security threats in the extra-body communication. Therefore, the security and privacy of client’s physiological data need to be ensured. Many authentication protocols for WBANs have been proposed in recent years. However, the existing protocols fail to consider the key update phase. In this paper, we propose an efficient authenticated key agreement scheme for WBANs and add the key update phase to enhance the security of the proposed scheme. In addition, session keys are generated during the registration phase and kept secretly, thus reducing computation cost in the authentication phase. The performance analysis demonstrates that our scheme is more efficient than the currently popular related schemes.

Revocable Identity-Based Access Control for Big Data with Verifiable Outsourced Computing

To be able to leverage big data to achieve enhanced strategic insight, process optimization and make informed decision, we need to be an efficient access control mechanism for ensuring end-to-end security of such information asset. Signcryption is one of several promising techniques to simultaneously achieve big data confidentiality and authenticity. However, signcryption suffers from the limitation of not being able to revoke users from a large-scale system efficiently. We put forward, in this paper, the first identity-based (ID-based) signcryption scheme with efficient revocation as well as the feature to outsource unsigncryption to enable secure big data communications between data collectors and data analytical system(s). Our scheme is designed to achieve end-to-end confidentiality, authentication, non-repudiation, and integrity simultaneously, while providing scalable revocation functionality such that the overhead demanded by the private key generator (PKG) in the key-update phase only increases logarithmically based on the cardiality of users. Although in our scheme the majority of the unsigncryption tasks are outsourced to an untrusted cloud server, this approach does not affect the security of the proposed scheme. We then prove the security of our scheme, as well as demonstrating its utility using simulations.

An enhanced mutual authentication and key agreement scheme for mobile user roaming service in global mobility networks

Roaming service is required in the ubiquitous access used in the global mobility networks (GLOMONETs) and the security is one of the most important issues. Many researchers focus their interests on authentication schemes for GLOMONETs. In 2015, Gope and Hwang, Zhang et al. and Farash et al. proposed their key agreement authentication schemes for GLOMONETs, respectively. However, we find weaknesses in them. Gope and Hwang’s scheme is under the off-line guessing attack and the de-synchronization attack. Moreover, it does not keep strong forward security and the session key is known by the home agent. Zhang et al.’s scheme has several weaknesses including vulnerability to the off-line guessing attack, destitution of password change phase, and the leakage of updated session key. Farash et al.’s scheme lacks user anonymity and strong forward secrecy and is vulnerable to the off-line password guessing attack. The session key is known to the home agent, too. Furthermore, neither Gope and Hwang’s scheme nor Farash et al.’s scheme has the session key update phase. To eliminate the problems, we present an improved authentication and key agreement scheme for GLOMONETs. According to the formal proof and the informal analysis, our scheme is well-performed and applicable.

A novel quantum deniable authentication protocol without entanglement

A novel quantum deniable authentication protocol based on single photons is proposed. In this scheme, the message sender and the specified receiver will first agree a new shared secret key by key update phases with the help of a third center, where only they can encrypt and decrypt the message by using the new shared secret key. Hence, this scheme can guarantee that only the specified receiver can identify the true source of a given message and the specified receiver cannot prove the source of the message to a third party by a transcript simulation algorithm. Compared with our previous scheme (Shi et al. in Quantum Inf Process 13:1501---1510, 2014), this scheme has the remarkable advantages of the higher qubit efficiency and consuming fewer quantum resources. Finally, security analysis results show that this scheme satisfies known key security and the basic security requirements of deniable authentication protocol such as completeness and deniability, and can withstand forgery attack, impersonation attack and inter-resend attack.

Secure SCADA communication by using a modified key management scheme

This paper presents and evaluates a new cryptographic key management scheme which increases the efficiency and security of the Supervisory Control And Data Acquisition (SCADA) communication. In the proposed key management scheme, two key update phases are used: session key update and master key update. In the session key update phase, session keys are generated in the master station. In the master key update phase, the Elliptic Curve Diffie–Hellman (ECDH) protocol is used. The Poisson process is also used to model the Security Index (SI) and Quality of Service (QoS). Our analysis shows that the proposed key management not only supports the required speed in the MODBUS implementation but also has several advantages compared to other key management schemes for secure communication in SCADA networks.