HCPA-GKA: A hash function-based conditional privacy-preserving authentication and group-key agreement scheme for VANETs

In the VANET systems, the leakage of some sensitive data or communication information will cause heavy losses for life and property. Then, a higher security level is required in the VANET systems. Meanwhile, fast computation powers are needed by devices with limited computing resources. Thus, a secure and lightweight privacy-preserving protocol for VANETs is urgent. In this paper, we first propose an identity-based signature that achieves unforgeability against chosen-message attack without random oracle. In order to reduce the computational cost, we design two secure and efficient outsourcing algorithms for the exponential operations, where a homomorphic mapping based on matrices conjugate operation is used to achieve the security of both exponent and base numbers. Furthermore, we construct a privacy-preserving protocol for VANETs by using outsourcing computing and the proposed IBS, where a proxy re-signature scheme is presented for authentications. In the VANET privacy-preserving protocol, TA authorizes RSU to act as an agent and RUS converts OBU's signature into TA's signature, which effectively hides the real identity of vehicle OBU. Meanwhile, TA has access to trace the real identity of OBU using its secret key when malicious messages are found. Then, the protocol provides anonymity, traceability, and privacy. In addition, with respect to the efficiency, our scheme does not need pairing operations and exponential operations. Thus, the calculation burdens for the VANET system can be significantly reduced. INDEX TERMS Identity-based signature, VANETs privacy-preserving protocol, outsourcing computing.

Section: Related Workmentioning

confidence: 99%

A Lightweight Privacy-Preserving Protocol for VANETs Based on Secure Outsourcing Computing

Wei

Wang

et al. 2019

“…These attacks prove that the said scheme is vulnerable. Before proceeding with the attack, several security assumptions are made, using [1]- [14], [20], [21], [23]- [27]. Following are the assumptions.…”

Section: Security Weakness and Design Flaws In Xiong Et Al Schemementioning

confidence: 99%

“…In this paper Real-Or-Random Oracle model is used to prove the semantic security of the scheme [9], [20], [21], [34], a design of a security model is very beneficial as it helps us in delivering of robust security goals, the said model has following components which are of interest:…”

Section: Message Meaning Rulementioning

confidence: 99%

Hash-Based Conditional Privacy Preserving Authentication and Key Exchange Protocol Suitable for Industrial Internet of Things

Paliwal

2019

Wireless sensor networks (WSN) are integral part of Industrial Internet of Things (IIOT), the said networks comprise of elements possessing low power processors. WSNs are used for gathering data in the monitoring region, using which vital information about the sensor and the monitoring region can be attained (placement of the sensor node is critical). Moreover, due to open nature of communication channel and resource constrained environment of nodes the privacy, integrity and confidentiality of the data becomes a big issue as we need to ensure that the said data is only accessed by a valid user in the IIOT environment. Many schemes presented various means to overcome the above issue. However, the existing works do have certain vulnerabilities which make its application in the WSNs constrained. The proposed work presents a scheme for achieving above goals in IIOT environment. Moreover, the proposed scheme presents security vulnerabilities and weaknesses in existing schemes and attempts to overcome these issues; the proposed work provides cryptanalysis of Xiong et al. scheme which is based on ECC, the direct consequence of the cryptanalysis directs to design a solution which can overcome the issues. The proposed work provides a robust hash based conditional privacy preserving authentication and probabilistic key exchange protocol which is lightweight and as a result, puts less computation overheads on the entities involved in the region. The proposed work is secure against many known attacks due to difficulty in guessing the credentials. The main motivation is to develop a lightweight scheme which can help exchange information with efficacy. The security of the proposed work is provided using both formal and informal security analysis where formal analysis comprises of AVISPA and Real-or-Random oracle model simulations whereas informal analysis depicts proofs as of how the proposed work withstands many known attacks. Thus, the proposed work is secure against many malicious attacks directing and championing its application in IIOT environment.

“…A group key agreement mechanism based on the Chinese remainder theorem is proposed to distribute the group key for authenticated vehicles in [28]- [31]. The group key can be updated when the vehicle joins and leaves the group.…”

Section: A Related Workmentioning

confidence: 99%

Group Key Agreement Protocol Based on Privacy Protection and Attribute Authentication

Zhang

Gan

et al. 2019

Group key agreement is a good way to ensure secure communication within a group. However, the identity authentication, privacy protection, and information sharing access control (different access rights may exist for different sensitivity of information) are key issues to be solved in group key agreement. Aiming at these problems, this paper proposes a group key agreement protocol based on privacy protection and attribute authentication (GKA-PPAA). The protocol proposes identity authentication for hidden attributes; it not only preserves the advantages of traditional identity-based key agreement protocol, but also provides hiding the identity information and privacy protection of the individual, and also proposes information sharing access control, which different secret information is shared among a set of members who have different levels of authority. It increases the flexibility of group key management. In addition, the group key factors are also calculated before the group key agreement, which eliminates most of the computation overhead due to the group key agreement. This protocol is proven secure under the discrete logarithm problem (DLP) and decisional bilinear Diffie-Hellman (DBDH) problem assumptions. The performance analysis shows that the proposed scheme is much more efficient than the existing ones. INDEX TERMSGroup key agreement, attribute authentication, information exchange, threshold authority.