Thanks to the rapid development in mobile vehicles and wireless technologies, the Internet of Vehicles (IoV) has become an attractive application that can provide a large number of mobile services for drivers. Vehicles can be informed of the mobile position, direction, speed, and other real-time information of nearby vehicles to avoid traffic jams and accidents. However, the environments of IoV could be dangerous in the absence of security protections. Due to the openness and self-organization of IoV, there are enormous malicious attackers. To guarantee the safety of mobile services, we propose an effective decentralized authentication mechanism for IoV on the basis of the consensus algorithm of blockchain technology. The simulation under the veins framework is carried out to verify the feasibility of the scheme in reducing the selfish behavior and malicious attacks in IoV.INDEX TERMS Blockchain, Internet of Vehicles, security and privacy, consensus algorithm.

Vehicular ad hoc network (VANET) is a traffic application of wireless sensor network, which is also a new mobile ad hoc networks composed of vehicle nodes, roadside units, service providers and other components. In VANET, data is transmitted by the wireless channel, which is subject to potential threat like information leak and data attack due to the openness and sensitivity of the auto organization network itself. How to ensure the identity privacy and trusted communication in VANETs is the key issue to be solved urgently. The existing work usually uses authentication mechanism, but the user's privacy disclosure is inevitable during the authentication process. Some anonymous authentication schemes have been proposed to solve the problem of privacy disclosure regardless of considering anonymity abuse. However, anonymity abuse is also severe in VANET. In view of the above problems, this paper proposes a scheme based on fair blind signature and secret sharing algorithm. By security analysis and experiment, the scheme has been proved to be higher anonymity and higher efficiency. KEYWORDSVehicular ad hoc network; anonymous authentication; track; fair blind signature; secret sharing algorithm

In recent years, under the background that the rapid development of traffic volume makes the current traffic lights far from meeting the urban traffic demand, intelligent traffic lights based on the centralized architecture began to appear. However, in the traffic network with complex structure and private data flow, there are many malicious attacks against the centralized architecture, such as Sybil and ghost car attacks, which undoubtedly brings great security risks to the traditional intelligent traffic lights. Blockchain technology is a popular security framework nowadays. Based on its outstanding characteristics in the distributed architecture and the development of Edge Intelligence (EI) technology, this paper proposes a distributed security architecture scheme based on blockchain technology for the existing intelligent traffic light system. At the same time, based on the model cutting technology proposed by EI, the smart contract is improved to achieve redundant cutting of ledger data in the process of block consensus, which greatly reduces the pressure of blockchain ledger data transmission. In the end of this paper, the superiority of this scheme compared with the traditional intelligent traffic light scheme in communication cost and time cost is demonstrated by simulation experiment.INDEX TERMS Blockchain, intelligent transportation, distributed architecture, edge intelligence.PENGJIE ZENG is currently pursuing the bachelor's degree from the Hunan University of Science and Technology. His research field is the application of blockchain in the Internet of Things, cyberspace security, privacy protection, and large data processing and analysis. He received the Second Prize at the National College Students Innovative Electronic Design Competition and the Third Prize at the School-Level Financial Management Data Analysis Competition. He is currently in charge of leading the Technical Team to complete the development of a smart agriculture project and an intelligent traffic light project.

Vehicular communication networks are traffic applications of the Internet of Things consisting of vehicle nodes, roadside units, service providers, and other components. To protect the vehicle privacy, some vehicular communication networks adopt anonymous schemes. However, in these anonymous schemes, anonymity abuse is inevitable. In order to protect vehicular privacy and prevent anonymity abuse, some conditional anonymous authentication schemes based on cryptography have been proposed. However, most of these methods have complex computation and large communication overhead, which makes them difficult to meet the actual requirement of high-speed traffic in vehicular communication networks. In this paper, a novel conditional anonymity scheme called VKPCA (vehicular communication network based on kernel principal component analysis [KPCA]) is proposed, which can protect vehicle privacy while avoid anonymity abuse. The simulation results show that this scheme has lower computational complexity and communication overhead than the conventional anonymous authentication scheme.

Abstract-The lack of optical buffer is still one of the main problems that hinder the development of all optical network. The current works on this topic mainly focus on emulating optical buffers with fiber delay line (FDL). Recent advances have shown the feasibility of emulating many kinds of optical buffers, such as the First In First Out (FIFO) buffer, priority buffer, etc. The Last In First Out (LIFO) buffer is another important network components that can be used for providing QoS guarantee and congestion control. Huang et al. introduced a recursive construction of LIFO buffer with buffer size B by using no less than 9 log 2 B FDLs [1]. In this paper, we try to reduce the number of required delay lines there. We will show that by combining every 3 fiber delay lines into one group and applying exponential growth of FDLs among groups, one needs only 3 log 2 B delay lines to emulate a LIFO buffers of size B.