<rss version="2.0" xmlns:atom="https://www.w3.org/2005/Atom">
  <channel>
    <title>Transport Research International Documentation (TRID)</title>
    <link>https://trid.trb.org/</link>
    <atom:link href="https://trid.trb.org/Record/RSS?s=PHNlYXJjaD48cGFyYW1zPjxwYXJhbSBuYW1lPSJkYXRlaW4iIHZhbHVlPSJhbGwiIC8+PHBhcmFtIG5hbWU9InN1YmplY3Rsb2dpYyIgdmFsdWU9Im9yIiAvPjxwYXJhbSBuYW1lPSJ0ZXJtc2xvZ2ljIiB2YWx1ZT0ib3IiIC8+PHBhcmFtIG5hbWU9ImxvY2F0aW9uIiB2YWx1ZT0iMCIgLz48L3BhcmFtcz48ZmlsdGVycz48ZmlsdGVyIGZpZWxkPSJpbmRleHRlcm1zIiB2YWx1ZT0iJnF1b3Q7QXV0aGVudGljYXRpb24mcXVvdDsiIG9yaWdpbmFsX3ZhbHVlPSImcXVvdDtBdXRoZW50aWNhdGlvbiZxdW90OyIgLz48L2ZpbHRlcnM+PHJhbmdlcyAvPjxzb3J0cz48c29ydCBmaWVsZD0icHVibGlzaGVkIiBvcmRlcj0iZGVzYyIgLz48L3NvcnRzPjxwZXJzaXN0cz48cGVyc2lzdCBuYW1lPSJyYW5nZXR5cGUiIHZhbHVlPSJwdWJsaXNoZWRkYXRlIiAvPjwvcGVyc2lzdHM+PC9zZWFyY2g+" rel="self" type="application/rss+xml" />
    <description></description>
    <language>en-us</language>
    <copyright>Copyright © 2026. National Academy of Sciences. All rights reserved.</copyright>
    <docs>http://blogs.law.harvard.edu/tech/rss</docs>
    <managingEditor>tris-trb@nas.edu (Bill McLeod)</managingEditor>
    <webMaster>tris-trb@nas.edu (Bill McLeod)</webMaster>
    <image>
      <title>Transport Research International Documentation (TRID)</title>
      <url>https://trid.trb.org/Images/PageHeader-wTitle.jpg</url>
      <link>https://trid.trb.org/</link>
    </image>
    <item>
      <title>SAPSC: SignRecrypting authentication protocol using shareable clouds in VANET groups</title>
      <link>https://trid.trb.org/View/1649367</link>
      <description><![CDATA[Security and mutual reliability are the crucial requirements of an ad hoc network as nodes are dependent upon each other for routing and forwarding their messages. Vehicular ad hoc networks (VANETs) are no exception and are always at the risk of impersonation attack. An authentication protocol protects the identity of network entities from being impersonated. Occasionally, they require re-encryption technique which enables any other node to communicate on behalf of an unavailable node. The technology is used to provide backup in emergencies. The authors propose a secure authentication algorithm to efficiently re-encrypt the messages using signcryption. For faster computation and routing, the authors have used shareable clouds in VANET groups. Security of the protocol is proved using Burrows-Abadi-Needham logic and validated by simulation tool automated validation of internet security protocols and applications.]]></description>
      <pubDate>Mon, 16 Sep 2019 17:19:31 GMT</pubDate>
      <guid>https://trid.trb.org/View/1649367</guid>
    </item>
    <item>
      <title>An Efficient Message-Authentication Scheme Based on Edge Computing for Vehicular Ad Hoc Networks</title>
      <link>https://trid.trb.org/View/1603493</link>
      <description><![CDATA[With the progress in wireless communication technology and the increasing number of vehicles, vehicular ad hoc networks (VANETs) have become essential for improving road conditions and enhancing driving experience. The core of the VANETs is the communication between different vehicles, and the security of the communication is based on message authentication. Several schemes have been designed to enhance the efficiency of message authentication. However, these schemes have the disadvantage of redundant authentication, i.e., repeated authentication of the same message, and fail to seek invalid messages from the batch of messages. To solve these problems, this paper introduces a novel edge-computing concept into the message-authentication process of VANETs. In the authors' scheme, the roadside unit can efficiently authenticate messages from nearby vehicles and broadcast the authentication results to the vehicles within its communication range, thereby reducing redundant authentication and enhancing the efficiency of the entire system. The security analysis results show that the proposed scheme satisfies the security requirements of the VANETs. The performance analysis results show that the proposed scheme can not only work well in an ideal environment where the attacker is absent but also capable of quickly identifying valid and invalid messages even if the VANET is attacked.]]></description>
      <pubDate>Tue, 04 Jun 2019 13:41:39 GMT</pubDate>
      <guid>https://trid.trb.org/View/1603493</guid>
    </item>
    <item>
      <title>Authentication and privacy schemes for vehicular ad hoc networks (VANETs): A survey</title>
      <link>https://trid.trb.org/View/1591156</link>
      <description><![CDATA[The intelligent transportation system (ITS) is made possible and practical due to vehicular ad hoc networks (VANETs) that helps improve drivers safeties and traffic efficiency on road by interchanging traffic-related information among vehicles and infrastructures. However, due to the open wireless access medium, the security and privacy of this information become quite critical in VANETs. The attackers could capture, intercept, alter, replay and delete the traffic-related information and could compromise the security of VANETs. Therefore, to ensure security and privacy of the traffic-related information in VANETs is the hot research area of nowadays. In this context, lots of research works have been done to secure vehicular communications. However, these works did not address the security issues in terms of security requirements, security attacks, and efficiency in performance, properly. In this paper, several authentication and privacy schemes have been classified and discussed their mechanisms, strengths and limitations, security requirements, attacks, and performance parameters. Finally, the authors identified some open research challenges in the domain of VANETs security.]]></description>
      <pubDate>Tue, 30 Apr 2019 09:21:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/1591156</guid>
    </item>
    <item>
      <title>A secure and efficient group key agreement scheme for VANET</title>
      <link>https://trid.trb.org/View/1593596</link>
      <description><![CDATA[A vehicular ad hoc network (VANET) is a special mobile ad hoc network that provides vehicle collaborative security applications using intervehicle communication technology. The method enables vehicles to exchange information (e.g., emergency brake). In VANET, there are many vehicle platoon driving scenes, where vehicles with identical attributes (location, organization, etc.) are organized as a group. However, this organization causes the issue of security threats (message confidentiality, identity privacy, etc.) because of an unsafe wireless communication channel. To protect the security and privacy of group communication, it is necessary to design an effective group key agreement scheme. By negotiating a dynamic session secret key using a fixed roadside unit (RSU), which has stronger computational ability than the on-board unit (OBU) equipped on the vehicle, the designed scheme can help to provide more stable communication performance and speed up the encryption and decryption processes. To effectively implement the anonymous authentication mechanism and authentication efficiency, the authors use a batch authentication scheme and a shared secret key mechanism among the vehicles, RSUs and trusted authority (TA). The authors design an efficient group secret key agreement scheme, which satisfies the above communication and security requirements, protects the privacy of vehicles, and traces the real identity of the vehicle at a time when it is necessary. Computational analysis shows that the proposed scheme is secure and more efficient than existing schemes. © 2019 by the authors. Licensee MDPI, Basel, Switzerland.]]></description>
      <pubDate>Wed, 24 Apr 2019 09:30:38 GMT</pubDate>
      <guid>https://trid.trb.org/View/1593596</guid>
    </item>
    <item>
      <title>An Efficient Authentication Scheme Based on Semi-Trusted Authority in VANETs</title>
      <link>https://trid.trb.org/View/1594485</link>
      <description><![CDATA[With the development of intelligent transportation systems, vehicular ad hoc networks (VANETs) are widely used in safety driving, and so on. However, existing signature schemes, such as pseudonym- and group-based schemes, have certain problems, such as the need for a certificate distribution and certificate revocation lists (CRLs). With such schemes, the vehicle needs to store a valid certificate generated by the management center. Simultaneously, the receiver needs to check the CRLs prior to message authentication. CRLs require large amounts of storage space and computational and communication resources. In addition, many such schemes are built on a trusted authority and do not meet real-world needs. Thus, the authors propose an efficient authentication scheme based on semitrusted authority in VANETs. In this scheme, the authors combine the self-healing key distribution method with a certificateless signature in a semitrusted authority environment, such that the receivers do not require to query the CRLs. Therefore, the vehicles do not have to store the CRLs, thereby saving storage space and communication resources. This also reduces the computational costs and improves the efficiency of the message authentication. Since the proposed scheme is built on a semitrusted authority, it is a more realistic approach.]]></description>
      <pubDate>Wed, 24 Apr 2019 09:30:37 GMT</pubDate>
      <guid>https://trid.trb.org/View/1594485</guid>
    </item>
    <item>
      <title>Lightweight authentication scheme for vehicular ad hoc networks based on MSR</title>
      <link>https://trid.trb.org/View/1568750</link>
      <description><![CDATA[Vehicular ad-hoc networks (VANETs) has become a promising technology for nowadays' intelligent transportation system (ITS). Secure communications in VANETs can help improve safe and comfortable driving environment for drivers. In order to guarantee secure communication, security, privacy, and efficiency should be carefully considered during the deployment of VANETs. In this paper, the authors propose a lightweight privacy-preserving authentication scheme to enhance the communication security in VANETs. The proposed scheme employs the modular square root (MSR) technique to achieve the design goals. The security analysis demonstrates that their scheme achieves more advantages on supporting mutual authentication and other security requirements by comparing with existing schemes. The authors also provide the authentication proof using BAN logic and analyze the security validation using ProVerif. Additionally, compared with existing schemes, their scheme significantly reduces the computation delay on message signing and verification by at least 150 times. Meanwhile, the communication cost of their scheme achieves a reduction of nearly 25%.]]></description>
      <pubDate>Thu, 27 Dec 2018 10:59:22 GMT</pubDate>
      <guid>https://trid.trb.org/View/1568750</guid>
    </item>
    <item>
      <title>An efficient probabilistic authentication scheme for converging VANET</title>
      <link>https://trid.trb.org/View/1569706</link>
      <description><![CDATA[VANET interconnects the vehicles for transferring secure information. In ACPN, the public-key cryptography (PKC) for pseudonym generation is used, which ensures legitimate third parties to achieve the non-repudiation of vehicles by obtaining vehicles' real IDs for privacy preserving authentication and pseudonyms updates on vehicular demands. The convergence point access (CPA) is used to enable communication for out of range vehicles, handover scheme occurs. The scheme provides a seamless connectivity and secure message transmission. However, adversarial nodes could provide false position information. Thus, in VANETs, there is no secure discovery protocol for neighbour positions. The authors address this problem by designing a distributed protocol that relies on information exchange among one-hop neighbours, they analyse security properties of independent or colluding adversaries, and evaluate its performance using realistic mobility traces. This protocol can be highly effective in detecting falsified position information, while maintaining a low rate of false positive detections.]]></description>
      <pubDate>Wed, 05 Dec 2018 16:29:54 GMT</pubDate>
      <guid>https://trid.trb.org/View/1569706</guid>
    </item>
    <item>
      <title>Secure Authentication Protocol for Wireless Sensor Networks in Vehicular Communications</title>
      <link>https://trid.trb.org/View/1568146</link>
      <description><![CDATA[With wireless sensor networks (WSNs), a driver can access various useful information for convenient driving, such as traffic congestion, emergence, vehicle accidents, and speed. However, a driver and traffic manager can be vulnerable to various attacks because such information is transmitted through a public channel. Therefore, secure mutual authentication has become an important security issue, and many authentication schemes have been proposed. In 2017, Mohit et al. proposed an authentication protocol for WSNs in vehicular communications to ensure secure mutual authentication. However, their scheme cannot resist various attacks such as impersonation and trace attacks, and their scheme cannot provide secure mutual authentication, session key security, and anonymity. In this paper, the authors propose a secure authentication protocol for WSNs in vehicular communications to resolve the security weaknesses of Mohit et al.’s scheme. The authors' authentication protocol prevents various attacks and achieves secure mutual authentication and anonymity by using dynamic parameters that are changed every session. The authors prove that their protocol provides secure mutual authentication by using the Burrows–Abadi–Needham logic, which is a widely accepted formal security analysis. The authors perform a formal security verification by using the well-known Automated Validation of Internet Security Protocols and Applications tool, which shows that the proposed protocol is safe against replay and man-in-the-middle attacks. The authors compare the performance and security properties of their protocol with other related schemes. Overall, the proposed protocol provides better security features and a comparable computation cost. Therefore, the proposed protocol can be applied to practical WSNs-based vehicular communications.]]></description>
      <pubDate>Fri, 30 Nov 2018 17:05:15 GMT</pubDate>
      <guid>https://trid.trb.org/View/1568146</guid>
    </item>
    <item>
      <title>Decentralized and Scalable Privacy-Preserving Authentication Scheme in VANETs</title>
      <link>https://trid.trb.org/View/1564260</link>
      <description><![CDATA[Existing authentication schemes are based on either symmetric or asymmetric cryptography such as public-key infrastructure (PKI). These PKI-based authentication schemes are highly recommended to address the security challenges in VANETs. However, they have certain shortcomings such as: 1) lack of privacy-preservation due to revealing of vehicle identity and broadcasting of safety-message and 2) lengthy certificates leading to communication and computation overheads. The symmetric cryptography based schemes on the other hand are faster because they use a single secret key and are very simple; however, it does not ensure nonrepudiation. In this paper, the authors present a decentralized and scalable privacy-preserving authentication (DSPA) scheme for secure vehicular ad hoc networks. The proposed scheme employs a hybrid cryptography. In DSPA, the asymmetric identity-based (ID-based) cryptography and the symmetric hash message authentication code (HMAC) based authentication are adopted during vehicle to infrastructure and vehicle to vehicle communications, respectively. Extensive simulations are conducted to validate the proposed DSPA scheme by comparing the existing works based on PKI, ID-based, group signature, batch verification, and HMAC. The performance analysis showed that DSPA is more efficient, decentralized, scalable, and also a privacy-preserving secured scheme than the existing authentication schemes.]]></description>
      <pubDate>Tue, 20 Nov 2018 10:17:13 GMT</pubDate>
      <guid>https://trid.trb.org/View/1564260</guid>
    </item>
    <item>
      <title>“Verify-on-Demand” - A Practical and Scalable Approach for Broadcast Authentication in Vehicle-to-Vehicle Communication</title>
      <link>https://trid.trb.org/View/1431675</link>
      <description><![CDATA[In general for Vehicle-to-Vehicle (V2V) communication, message authentication is performed on every received wireless message by conducting verification for a valid signature, and only messages that have been successfully verified are processed further. In V2V safety communication, there are a large number of vehicles and each vehicle transmits safety messages frequently; therefore the number of received messages per second would be large. Thus authentication of each and every received message, for example based on the IEEE 1609.2 standard, is computationally very expensive and can only be carried out with expensive dedicated cryptographic hardware. An interesting observation is that most of these routine safety messages do not result in driver warnings or control actions since we expect that the safety system would be designed to provide warnings or control actions only when the threat of collision is high. If the V2V system is designed to provide too frequent warnings or control actions, then the system would be a nuisance to the driver. Therefore it is reasonable to define an approach where messages are first processed and then authenticated using verification on-demand. In this paper we describe such an approach and discuss its implementation for V2V safety system. It is shown that Verify-on-Demand (VoD) is a practical and scalable approach for broadcast authentication in V2V safety communication while conforming to the IEEE 1609.2 standard.       ]]></description>
      <pubDate>Tue, 20 Nov 2018 10:12:01 GMT</pubDate>
      <guid>https://trid.trb.org/View/1431675</guid>
    </item>
    <item>
      <title>HCPA-GKA: A Hash Function-Based Conditional Privacy-Preserving Authentication and Group-Key Agreement Scheme for VANETs</title>
      <link>https://trid.trb.org/View/1541016</link>
      <description><![CDATA[In recent years, the continuous economic development and the emergence of new technologies have made vehicles an indispensable travel tool in people's lives. However, the intelligent and efficient control and management of the increasing number of vehicles to improve traffic efficiency has become a problem. Vehicular ad hoc networks (VANETs) are one of the most important development trends that are used for communication between vehicles to provide information such as weather conditions, road conditions, and traffic jams and their status, which is significant in improving traffic safety and efficiency. In this scenario, authenticating the entity that is sending the message is a critical task to ensure secure communication in VANETs. In this paper, the authors propose a conditional privacy-preserving authentication scheme based on the hash function, which does not use complex bilinear mapping and elliptic curve encryption for identity authentication to prevent illegal vehicle interference and ensure the legitimacy of the source. Meanwhile, a group key agreement mechanism based on the Chinese remainder theorem (CRT) is proposed to distribute the group key for authenticated vehicles. The group key can be updated when the vehicle joins and leaves the group. In the process of anonymous message generation and verification, analysis of the results shows that the authors' proposed scheme satisfies the security privacy requirements and has significant advantages in terms of computation cost and communication overhead compared with existing schemes.]]></description>
      <pubDate>Fri, 28 Sep 2018 11:19:10 GMT</pubDate>
      <guid>https://trid.trb.org/View/1541016</guid>
    </item>
    <item>
      <title>EPA-CPPA: An efficient, provably-secure and anonymous conditional privacy-preserving authentication scheme for vehicular ad hoc networks</title>
      <link>https://trid.trb.org/View/1526752</link>
      <description><![CDATA[Unlike wired networks, vehicular ad hoc networks (VANETs) are subject to a broader range of attacks due to its wireless broadcast nature. One of the potential cryptographic solutions to ensure authentication and privacy preservation is conditional privacy-preserving authentication (CPPA) schemes. Although a number of CPPA schemes have been proposed in the literature, existing approaches generally suffer from limitations such as the security problem of system private keys, high computation requirement during certificate generation and message verification phases. To resolve these issues, in this paper, it presents a provably-secure CPPA scheme for VANETs and demonstrates that the proposed solution provides both security and privacy required in a VANET application. It also demonstrates its utility in terms of computation and communication overheads and owns an optimal performance compared with rather related schemes.]]></description>
      <pubDate>Tue, 28 Aug 2018 09:27:00 GMT</pubDate>
      <guid>https://trid.trb.org/View/1526752</guid>
    </item>
    <item>
      <title>Self-Controllable Secure Location Sharing for Trajectory-Based Message Delivery on Cloud-Assisted VANETs</title>
      <link>https://trid.trb.org/View/1527992</link>
      <description><![CDATA[In vehicular ad hoc networks, trajectory-based message delivery is a message forwarding strategy that utilizes the vehicle’s preferred driving routes information to deliver messages to the moving vehicles with the help of roadside units. For the purpose of supporting trajectory-based message delivery to a moving vehicle, the driving locations of the vehicle need to be shared with message senders. However, from a security perspective, vehicle users do not want their driving locations to be exposed to others except their desired senders for location privacy preservation. Therefore, in this paper, the authors propose a secure location-sharing system to allow a vehicle user (or driver) to share his/her driving trajectory information with roadside units authorized by the user. To design the proposed system, the authors put a central service manager which maintains vehicle trajectory data and acts as a broker between vehicles and roadside units to share the trajectory data on the cloud. Nevertheless, the authors make the trajectory data be hidden from not only unauthorized entities but also the service manager by taking advantage of a proxy re-encryption scheme. Hence, a vehicle can control that only the roadside units designated by the vehicle can access the trajectory data of the vehicle.]]></description>
      <pubDate>Mon, 27 Aug 2018 14:04:07 GMT</pubDate>
      <guid>https://trid.trb.org/View/1527992</guid>
    </item>
    <item>
      <title>Comments on “Dual Authentication and Key Management Techniques for Secure Data Transmission in Vehicular Ad Hoc Networks”</title>
      <link>https://trid.trb.org/View/1522626</link>
      <description><![CDATA[Recently, Vijayakumar et al. proposed a dual authentication and key management scheme for secure data transmission in vehicular ad-hoc networks. As described by Vijayakumar et al., a dual authentication scheme and the corresponding group key management mechanism are illustrated successively. The authors claimed that the proposed scheme is resistant to replay attack and masquerade attack. However, these authors find that the proposed scheme given by Vijayakumar et al. is still vulnerable to replay attack, which could be conducted by reusing previously acquired messages. Moreover, this scheme cannot resist masquerade attack toward the system. For the above consideration, in this paper, modifications toward the existing protocol are presented, so as to provide adequate security assurance toward the mentioned attacks.]]></description>
      <pubDate>Fri, 27 Jul 2018 13:24:19 GMT</pubDate>
      <guid>https://trid.trb.org/View/1522626</guid>
    </item>
    <item>
      <title>A Secure and Efficient Authentication Technique for Vehicular Ad-Hoc Networks</title>
      <link>https://trid.trb.org/View/1516615</link>
      <description><![CDATA[Vehicular ad-hoc networks (VANETs) are under active development, thanks in part to recent advances in wireless communication and networking technologies. The most fundamental part in VANETs is to enable message authentications between vehicles and roadside units. Message authentication using proxy vehicles has been proposed to reduce the computational overhead of roadside units significantly. In this message authentication scheme, proxy vehicles that verify multiple messages at the same time improve roadside units’ efficiency. In this paper, first the authors show that the only proxy-based authentication scheme (PBAS) presented for this goal by Liu <italic>et al.</italic> cannot guarantee message authenticity, and also it is not resistant against impersonation and modification attacks and false acceptance of batched invalid signatures. Next, the authors propose a new identity-based message authentication scheme using proxy vehicles (ID-MAP). Then, to guarantee that it can satisfy the message authentication requirement, existential unforgeability of underlying signature against adaptively chosen-message and identity attack is proved under elliptic curve discrete logarithm problem in the random oracle model. It should be highlighted that ID-MAP not only is more efficient than PBAS since it is pairing-free and identity-based, and also it does not use map-to-point hash functions, but also it satisfies security and privacy requirements of VANETs. Furthermore, analysis shows that the required time to verify 3000 messages in ID-MAP is reduced by 76% compared to that of PBAS.]]></description>
      <pubDate>Thu, 26 Jul 2018 14:38:10 GMT</pubDate>
      <guid>https://trid.trb.org/View/1516615</guid>
    </item>
  </channel>
</rss>