Dynamic attribute based vehicle authentication

Modern vehicles are proficient in establishing a spontaneous connection over a wireless radio channel, synchronizing actions and information. Security infrastructure is most important in such a sensitive scope of vehicle communication for coordinating actions and avoiding accidents on the road. One of the first security issues that need to be established is authentication via IEEE 1609.2 security infrastructure. According to our preliminary work, vehicle owners are bound to preprocess a certificate from the certificate authority. The certificate carries vehicle static attributes (e.g., licence number, brand and color) certified together with the vehicle public key in a monolithic manner. Nevertheless, a malicious vehicle might clone the static attributes to impersonate a specific vehicle. Therefore, in this paper we consider a resource expensive attack scenario involving multiple malicious vehicles with identical visual static attributes. Apparently, dynamic attributes (e.g., location and direction) can uniquely define a vehicle and can be utilized to resolve the true identity of the vehicle. However, unlike static attributes, dynamic attributes cannot be signed by a trusted authority beforehand. We propose an approach to verify the coupling between non-certified dynamic attributes and certified static attributes on an auxiliary communication channel, for example, a modulated laser beam. Furthermore, we illustrate that the proposed approach can be used to facilitate the usage of existing authentication protocols such as NAXOS, in the new scope of ad-hoc vehicle networks. We use BAN logic to verify the security claims of the protocol against the passive and active interception.     

Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent)

Optical architectures that use exponential space for solving instances of the (non-necessarily-binary) permanent are presented. This is the first work to specifically focus on such hard on average problems. Two architectures are suggested the first is based on programmable masks, and the second on preprepared fixed number of masks.     

Second-generation laser firefly clusters: improved scheme for distributed sensing in the atmosphere

We present an improved concept of laser firefly clustering for atmospheric probing, elaborating on previous published work. The laser firefly cluster is a mobile, flexible, and versatile distributed-sensing system, whose purpose is to profile the chemical and the particulate composition of the atmosphere for pollution monitoring, meteorology, detection of contamination, etc. The fireflies are deployed in situ at the altitude of interest and evoke a backscatter response from aerosols and molecules in the immediate vicinity by using a coded laser signal. The enhanced, second-generation system affords better performance at lower energy cost and has a considerably increased scope of application. A numerical example demonstrates the potential of the innovative system.     

Non-line-of-sight optical wireless sensor network operating in multiscattering channel

Networks of sensors are envisaged to be major participants in future data-gathering systems for civilian and military applications, including medical and environmental monitoring and surveillance, home security, agriculture, and industry. Typically, a very large number of miniature sensing and communicating nodes are distributed ad hoc at the location of interest, where they establish a network and wirelessly communicate sensed data either to one another or to a base station using various network topologies. The optical modality is a potential solution for the links, due to the small and lightweight hardware and low power consumption, as well as other special features. Notably, the backscattering of light by molecules and aerosols in the atmosphere can function as a vehicle of communication in a way similar to the deployment of numerous tiny reflecting mirrors. The scattering of light at solar-blind ultraviolet wavelengths is of particular interest since scattering by atmospheric particles is significant and ambient solar interference is minimal. In this paper we derive a mathematical model of a simple and low-cost non-line-of-sight (NLOS) optical wireless sensor network operating in the solar-blind ultraviolet spectral range. The viability and limitations of the internode link are evaluated and found to facilitate miniature operational sensor networks.     

Task Switching After Cerebellar Damage.

The authors of this study investigated task switching following cerebellar damage. The study group consisted of 7 children and adolescents (M age = 13.8 years) who underwent surgical removal of a benign posterior fossa tumor. They were tested at a sufficient interval after surgery (M lag = 6.13 years) for restoration of normal cognitive skills and intelligence. Although all showed normal learning of the task compared with control participants, when rapid behavioral changes were required (short preparation time), they exhibited behavioral rigidity manifested by enhanced switching cost. These results are in line with another study on serial reaction time with the same patients (A. Berger et al., in press). They have important implications for our understanding of the cognitive sequelae of early cerebellar damage as well as the involvement of the cerebellum in task switching. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Optical solution for bounded NP-complete problems

We present a new optical method for solving bounded (input-length-restricted) NP-complete combinatorial problems. We have chosen to demonstrate the method with an NP-complete problem called the traveling salesman problem (TSP). The power of optics in this method is realized by using a fast matrix-vector multiplication between a binary matrix, representing all feasible TSP tours, and a gray-scale vector, representing the weights among the TSP cities. The multiplication is performed optically by using an optical correlator. To synthesize the initial binary matrix representing all feasible tours, an efficient algorithm is provided. Simulations and experimental results prove the validity of the new method.     

Feasibility of retroreflective transdermal optical wireless communication

There is an increasing demand for transdermal high-data-rate communication for use with in-body devices, such as pacemakers, smart prostheses, neural signals processors at the brain interface, and cameras acting as artificial eyes as well as for collecting signals generated within the human body. Prominent requirements of these communication systems include (1) wireless modality, (2) noise immunity and (3) ultra-low-power consumption for the in-body device. Today, the common wireless methods for transdermal communication are based on communication at radio frequencies, electrical induction, or acoustic waves. In this paper, we will explore another alternative to these methods--optical wireless communication (OWC)--for which modulated light carries the information. The main advantages of OWC in transdermal communication, by comparison to the other methods, are the high data rates and immunity to external interference availed, which combine to make it a promising technology for next-generation systems. In this paper, we present a mathematical model and experimental results of measurements from direct link and retroreflection link configurations with Gallus gallus domesticus derma as the transdermal channel. The main conclusion from this work is that an OWC link is an attractive communication solution in medical applications. For a modulating retroreflective link to become a competitive solution in comparison with a direct link, low-energy-consumption modulating retroreflectors should be developed.     

Secret swarm unit: Reactive k-secret sharing

Secret sharing is a fundamental cryptographic task. Motivated by the virtual automata abstraction and swarm computing, we investigate an extension of the k-secret sharing scheme, in which the secret shares are changed on the fly, independently and without (internal) communication, as a reaction to a global external trigger. The changes are made while maintaining the requirement that k or more secret shares may reconstruct the secret and no k ? 1 or fewer can do so.The application considered is a swarm of mobile processes, each maintaining a share of the secret which may change according to common outside inputs, e.g., inputs received by sensors attached to the process.The proposed schemes support addition and removal of processes from the swarm, as well as corruption of a small portion of the processes in the swarm.