Fatty M. Salem

Non-interactive Authentication Scheme Providing Privacy among Drivers in Vehicle-to-Vehicle Networks

In this paper, we present a non-interactive authentication scheme providing privacy among drivers in vehicle-to-vehicle (V2V) communication networks. Where the drivers, who are members of V2V networks, are organized into groups. Each group has a shared public key between members. Additionally, each member has a private key provided by the Third Trusted Party (TTP). In our proposed scheme, we ensure drivers privacy by allowing members to change their own set of public keys frequently using the Digital Signature Algorithm (DSA). The TTP sends to each member a token of his original set of public keys. This member can find non-interactively a new token corresponding to the new set of public keys, and hence vehicles can exchange the safety critical information without requiring a control from the TTP. In case of a malicious behavior, the identity of the signer can be revealed only by the TTP.

Non-interactive Secure and Privacy Preserving Protocol for Inter-vehicle Communication Networks

In this paper, we introduce a non-interactive secure protocol preserving privacy of the drivers for Inter-Vehicle Communication (IVC) networks. To protect the privacy among drivers, we propose to arrange vehicles into several groups. Vehicles in a group share the same public key, but each member can change his own set of public keys frequently, so the receiving vehicle cannot identify an individual driver in the group. In addition, each member has a private key provided by the Third Trusted Party (TTP) to enable the TTP, who is assumed to be fully trusted, to trace the driver who sends malicious information. Then, the TTP computes a fixed token of all members in the same group, but only participants in IVC networks can convince the receiving vehicle that the token is corresponding to their changed public keys set. So, we can achieve authentication.

Efficient Noninteractive Secure Protocol Enforcing Privacy in Vehicle-to-Roadside Communication Networks

Vehicular ad hoc networks (VANETs) have attracted extensive attentions in recent years for their promises in improving safety and enabling other value-added services. In this paper, we propose an efficient noninteractive secure protocol preserving the privacy of drivers in vehicle-to-roadside (V2R) communication networks with the ability of tracing malicious drivers only by a third trusted party (TTP), who is assumed to be fully trusted. Our proposed protocol can provide these complex requirements depending on symmetric cryptographic algorithms. The drivers can change the symmetric key used for message encryption with each message transmission and find noninteractively new values to be correctly used for verification and tracing in case of malicious behavior. The advantages of symmetric cryptographic algorithms over asymmetric algorithms are the faster processing speed and the shorter message length which makes it suitable for real-time applications such as V2R communications. An efficient key revocation scheme will be also described.

A Secure Mutual Authentication Scheme with Perfect Forward-Secrecy for Wireless Sensor Networks

Recently, Internet of Things (IoT) is increasing pervasively, permits the unattended objects to be connected securely among themselves allowing highly classified processed data to be controlled. WSN has the most significant attention since transferring data is the most security challenge of the IoT environment. As well as, the previous messages which might be intercepted causing the established session key to be revealed. To mitigate such an attack, a lot of schemes were proposed, with an allegation of high efficient security features were achieved and powerful resilience against various attacks. After prudent studies have been made, we found that multiple proposed schemes do not support all the security requirements and are susceptible to some security attacks. In this paper, we propose a secure mutual authentication scheme with perfect forward-secrecy for WSN. Likewise, provides resilience against various types of known attacks in WSNs. Finally, the security of proposed scheme is proven.

RAON-RB: A Verifiable Randomized Non-Separable Encryption Scheme for Secure Cloud Storage

Exponential increase in data inside endeavors is making a gush in the storage requirements and its security. Typical encrypting techniques of separable nature suffer against powerful adversaries due to the exponential improvement of computing power. Therefore, some cloud storage systems apply erasure coding in addition to encryption to prevent adversaries from revealing or/and controlling stored information. Nevertheless, still a powerful adversary can extract useful information from a compromised server. In this paper, a new storage scheme is introduced implying an AllOr-Nothing (AON) encryption mode to separately randomize the encrypted blocks and hashing the resulted pseudorandom blocks altogether afterwards, and with the aid of the salting technique, called Replicated BYTE, integrity is ensured. The scheme will be called Randomized AON plus Replicated BYTE (RAON-RB). By employing systematic Reed Solomon erasure coding, the proposed scheme will be more applicable to distributed systems. The proposed scheme is secure even if all but one storage servers have been compromised and even if the encryption key is disclosed. Moreover, to resist share modification and localize faulty server(s), the proposed scheme verifies the received shares before they are involved in the reconstruction process, and hence, the scheme can save superfluous computations as well.