The thesis briefly describes the digital signatures and basic methods (RSA, DSA, ECDSA) for the creation and verification of the digital signature. The method of group signatures designed by Boneh, Boyen and Shacham (BBS) is described in more details as well as the method designed by Bonen and Shacham (BS). The thesis further explores related issue of the implementation of batch signing and verification for the above mentioned methods and their practical application, particularly for systems Vehicular ad-hod network (VANET) and cloud storage in the field of forensic IT. The purpose of the thesis is to determine which of the methods BBS and BS is more suitable for these systems in terms of computational complexity. For this reason, the author created the program for the comparison of methods BBS and BS. The programme compares the time consumption of the methods for signing and verification of incoming messages. The results of the measurement are summarized in the conclusion along with the justification why the particular methods are suitable for the systems.

Les réseaux véhiculaires, connus sous le terme VANETs, sont des réseaux impliquant des communications entre deux ou plusieurs véhicules et éventuellement une communication avec des éléments d’infrastructure sur la route. Récemment, le concept de systèmes de transports intelligent a connu beaucoup d’intérêt. Les STI sont des systèmes utilisant les nouvelles technologies de communication sans fil appliquées au domaine du transport pour améliorer la sécurité routière, la logistique et les services d’information. Des défis majeurs ont besoin cependant d'être abordés pour offrir une communication sur la route sécurisée et fiable dans des environnements anonymes et quelquefois hostiles à la communication. Comme dans tout système de communication, les réseaux véhiculaires doivent opérer en respectant des contraintes en termes de qualité de service. Ces contraintes sont d’autant plus strictes quand il s’agit de fournir des services de sécurité sur la route. Ce projet vise à développer des techniques de communication véhiculaires pour le relayage d’informations de manière fiable et à faible délai entre véhicules voyageant à haute vitesse. Ces techniques devront permettre de respecter des contraintes temporelles sévères afin d’envisager leur utilisation dans des applications de sécurité sur la route. Pour ce faire, cette thèse proposera d’abord des techniques efficaces de dissémination d’informations utilisant des approches multi-métriques basées sur différentes mesures en temps-réel. Des méthodes de relayage seront proposées qui permettent de diminuer les délais d’acheminement et augmenter la probabilité de réception. Ces méthodes utiliseront, entre autres, des approches d’adaptation de la portée et/ou de la priorité des messages en fonction de leur type et de l’intérêt éventuels des véhicules récepteurs en la réception de ces messages. Dans un second volet, ce projet proposera des concepts et des méthodes afin de palier au problème de congestion dans les réseaux véhiculaires qui peut résulter conjointement à la dissémination d’informations. Ces concepts et méthodes viseront à respecter la fiabilité exigée par les applications de sécurité, tout en restant conforme aux nouveaux standards de communications véhiculaires.

Des techniques fiables de radiolocalisation s’avèrent indispensables au développement d’un grand nombre de nouveaux systèmes pertinents. Les techniques de localisation basées sur les réseaux de communication sans-fil (WNs) sont particulièrement adéquates aux espaces confinés et fortement urbanisés. Le présent projet de recherche s’intéresse aux systèmes de localisation en temps réel (RTLS) basés sur les technologies de communication sans-fil existantes. Deux nouvelles techniques de radiolocalisation alternatives sont proposées pour améliorer la précision de positionnement des nœuds sans-fil mobiles par rapport aux méthodes conventionnelles basées sur la puissance des signaux reçus (RSS). La première méthode de type géométrique propose une nouvelle métrique de compensation entre les puissances de signaux reçus par rapport à des paires de stations réceptrices fixes. L’avantage de cette technique est de réduire l’effet des variations du milieu de propagation et des puissances d’émission des signaux sur la précision de localisation. La même métrique est sélectionnée pour former les signatures utilisées pour créer la carte radio de l’environnement de localisation durant la phase hors-ligne dans la deuxième méthode de type analyse de situation. Durant la phase de localisation en temps réel, la technique d’acquisition comprimée (CS) est appliquée pour retrouver les positions des nœuds mobiles à partir d’un nombre réduit d’échantillons de signaux reçus en les comparant à la carte radio préétablie. Le calcul d’algèbre multilinéaire proposé dans ce travail permet l’utilisation de ce type de métrique ternaire, équivalemment la différence des temps d’arrivée (TDOA), pour calculer les positions des cibles selon la technique de CS. Les deux méthodes sont ensuite validées par des simulations et des expérimentations effectuées dans des environnements à deux et à trois dimensions. Les expériences ont été menées dans un bâtiment multi-étages (MFB) en utilisant l’infrastructure sans-fil existante pour retrouver conjointement la position et l’étage des cibles en utilisant les techniques proposées. Un exemple emblématique de l’application des RTLS dans les zones urbaines est celui des systèmes de transport intelligents (ITS) pour améliorer la sécurité routière. Ce projet s’intéresse également à la performance d’une application de sécurité des piétons au niveau des intersections routières. L’accomplissement d’un tel système repose sur l’échange fiable, sous des contraintes temporelles sévères, des données de positionnement géographique entre nœuds mobiles pour se tenir mutuellement informés de leurs présences et positions afin de prévenir les risques de collision. Ce projet mène une étude comparative entre deux architectures d’un système ITS permettant la communication entre piétons et véhicules, directement et via une unité de l’infrastructure, conformément aux standards de communication dans les réseaux ad hoc véhiculaires (VANETs).

Vehicular Ad hoc NETworks (VANETs), an emerging technology, use vehicles as nodes to form a mobile ad hoc network for the dissemination of safety and entertainment messages. The thesis provides a scheme for the fast propagation of messages in VANETs and evaluates the impact of vehicles as obstacles on signal propagation. An improved scheme for intermediate node selection in DBA-MAC (Dynamic Backbone Assisted MAC) is proposed, which consists of a CW (Contention Window) constraint scheme and an updated criterion of suitability. A performance comparison shows that messages in the proposed scheme propagate faster than in DBA-MAC. The CW constraint scheme is also applicable in VANET protocols which adapt the CW mechanism to communicate the suitability of vehicles for acting as intermediate nodes. Additionally, the mathematical models for DBAMAC and the proposal are established, which indicate the probability of candidates to be chosen over alternatives in the intermediate node selection. A novel metric - delay taking into account the effect of formation time(DEFT) - is proposed. DEFT combines the network formation time and propagation delay. It shows the impact of network formation on propagation latency. The configuration for optimal performance can be acquired using the proposed DEFT. In order to evaluate the proposals, a novel distribution of vehicle location is proposed. In the proposed distribution, the security distances between adjacent vehicles in the same lane are considered. The estimation of vehicles’ location can be more practical and accurate using the proposed distribution. In the wide body of the VANET literature, it is assumed that all the vehicles within the radio range of a transmitter are able to receive the signal. Yet, in practice, the vehicles as obstacles between the transmitter and the receiver affect the signal propagation significantly. This thesis presents the impact of these obstacles on the network connectivity and system performance of the protocols. The results and the analysis show that neglecting obstacles in practice leads to a significant degree of error in the estimation of system performance. In practice, tall vehicles forward messages in a more efficient way than do lower vehicles since they are free from the obstacle effect. An improved scheme is proposed, in which the height of vehicles is used as a factor to determine their suitability for message forwarding.

Vehicular Ad-Hoc Network (VANET)s are a key element of Intelligent Transport System (ITS)s. One of the challenges in VANETs is dealing with awareness and congestion due to the high amount of messages received from the vehicles in communication range. As VANETs are used in critical applications, congestion on the receiver side caused by the buffering of the packets is a safety hazard. In this thesis, we propose a stream-wise queuing system on the receiver side and show how it improves the timeliness of the messages received and main- tains the awareness of the system in a congestion situation.

With the increasing number of Vehicular Autonomous Network (VANET) architectures and applications, user privacy must be addressed and protected. Internet of Things (IoT) and their applications take care of everyday mundane task in order to increase user convenience and productivity. However, studies have shown that IoT architectures can be a weak spot in network security, including data being sent plain text. In this thesis, a VANET architecture is proposed that is capable of securing anonymous data collection from a distributed set of autonomous vehicles. The proposed architecture features a hybrid combination of centralized and decentralized routing concepts. Unlike other VANET implementations, our proposed architecture provides anonymity to users in the network. Lower latency can be achieved by merging data from live short-range ad-hoc routing methods with the data collected from a pseudo-live long range centralized routing methods. The proposed architecture guarantees user anonymity within the VANET framework. Most VANET models assume users do not value the privacy of their identity. We assume that each vehicle is equipped with a VANET computer capable of storing data, performing calculations, and both sending and receiving data wirelessly. Therefore vehicles can communicate directly with each other and exchange data within short distances as well as communicate with long-range wireless infrastructure. Simulation results show the implementation is equipped to handle diverse traffic scenarios as well as deter adversaries to the network from maliciously trying to manipulate collected data.

Vehicular Ad hoc Networks (VANET) consist of radio-equipped vehicles and roadside units (RSU) and support many safety and commercial applications. Multi-hop forwarding can extend the communication range of both RSUs and vehicular broadcasts. Recently, the use of Positive Orthogonal Codes (POC) as transmission patterns of repetition-based broadcast medium access control (MAC) for safety messages has been proposed. This thesis proposes a cooperative forwarding protocol in which multiple relays at each forwarding hop form a virtual relay and coordinate their transmission times to correspond to a POC codeword. The protocol thereby exploits spatial diversity while conforming to the POC-based MAC, resulting in fewer collisions and mitigating the effect of hidden terminals. The design is validated through NS2 simulations, which show comparable performance with other forwarding schemes while producing significantly less performance degradation for safety message broadcasts on the same channel.

Vehicular Ad hoc Networks (VANET) consist of radio-equipped vehicles and roadside units (RSU) and support many safety and commercial applications. Multi-hop forwarding can extend the communication range of both RSUs and vehicular broadcasts. Recently, the use of Positive Orthogonal Codes (POC) as transmission patterns of repetition-based broadcast medium access control (MAC) for safety messages has been proposed. This thesis proposes a cooperative forwarding protocol in which multiple relays at each forwarding hop form a virtual relay and coordinate their transmission times to correspond to a POC codeword. The protocol thereby exploits spatial diversity while conforming to the POC-based MAC, resulting in fewer collisions and mitigating the effect of hidden terminals. The design is validated through NS2 simulations, which show comparable performance with other forwarding schemes while producing significantly less performance degradation for safety message broadcasts on the same channel.

Vehicular communication networking is a promising approach for facilitating road safety, traffic management, and infotainment dissemination for drivers and passengers. However, it is subject to various malicious abuses and security attacks which hinder it from practical implementation. In this study, we propose a novel security protocol called GSIS based on group signature and identity-based signature schemes to meet the unique requirements of vehicular communication networks. The proposed protocol not only guarantees security and anonymity, but also provides easy traceability when the identity of the sender of a message has to be revealed by the authority. However, the cryptographic operations introduced in GSIS as well as the existing public key based message authentication protocols incur some computation and communication overhead which affect the system performance. Simulation results show that the GSIS security protocol is only applicable under light traffic conditions in terms of the message end to end delay and message loss ratio. Both the GSIS protocol and the existing public key based security protocols have to sign and verify all the received messages with asymmetric algorithms. The PKI based approach also has to attach a public key certificate in each packet. Therefore, to enhance the system performance and mitigate the message overhead without compromising the security requirement, this study further proposes an enhanced TESLA based Secure Vehicular Communication (TSVC) protocol. In TSVC, the communication overhead can be significantly reduced due to the MAC tag attached in each packet and only a fast hash operation is required to verify each packet. Simulation results show that TSVC maintains acceptable message latency, using a much smaller packet size, and significantly reduces the message loss ratio as compared to GSIS and existing PKI based protocols, especially when the traffic is denser. We conclude that the proposed approach could serve as good candidate for future vehicular communication networks.

In this paper, we propose a trust-based message propagation and evaluation framework to support the effective evaluation of information sent by peers and the immediate control of false information in a VANET. More specifically, our trust-based message propagation collects peers’ trust opinions about a message sent by a peer (message sender) during the propagation of the message. We improve on an existing cluster-based data routing mechanism by employing a secure and efficient identity-based aggregation scheme for the aggregation and propagation of the sender’s message and the trust opinions. These trust opinions weighted by the trustworthiness of the peers modeled using a combination of role-based and experience-based trust metrics are used by cluster leaders to compute a ma jority opinion about the sender’s message, in order to proactively detect false information. Malicious messages are dropped and controlled to a local minimum without further affecting other peers. Our trust-based message evaluation allows each peer to evaluate the trustworthiness of the message by also taking into account other peers’ trust opinions about the message and the peer-to-peer trust of these peers. The result of the evaluation derives an effective action decision for the peer. We evaluate our framework in simulations of real life traffic scenarios by employing real maps with vehicle entities following traffic rules and road limits. Some entities involved in the simulations are possibly malicious and may send false information to mislead others or spread spam messages to jam the network. Experimental results demonstrate that our framework significantly improves network scalability by reducing the utilization of wireless bandwidth caused by a large number of malicious messages. Our system is also demonstrated to be effective in mitigating against malicious messages and protecting peers from being affected. Thus, our framework is particularly valuable in the deployment of VANETs by achieving a high level of scalability and effectiveness.