We present a method for secrecy extraction from jointly Gaussian random sources. The approach is motivated by and has applications in enhancing security for wireless communications. The problem is also found to be closely related to some well known lossy source coding problems.

Dengue is an emerging disease in Nepal and was first observed as an outbreak in nine lowland districts in 2006. In 2010, however, a large epidemic of dengue occurred with 4,529 suspected and 917 serologically-confirmed cases and five deaths reported in government hospitals in Nepal. The collection of demographic information was performed along with an entomological survey and clinical evaluation of the patients. A total of 280 serum samples were collected from suspected dengue patients. These samples were subjected to routine laboratory investigations and IgM-capture ELISA for dengue serological identification, and 160 acute serum samples were used for virus isolation, RT-PCR, sequencing and phylogenetic analysis. The results showed that affected patients were predominately adults, and that 10% of the cases were classified as dengue haemorrhagic fever/ dengue shock syndrome. The genetic characterization of dengue viruses isolated from patients in four major outbreak areas of Nepal suggests that the DENV-1 strain was responsible for the 2010 epidemic. Entomological studies identified Aedes aegypti in all epidemic areas. All viruses belonged to a monophyletic single clade which is phylogenetically close to Indian viruses. The dengue epidemic started in the lowlands and expanded to the highland areas. To our knowledge, this is the first dengue isolation and genetic characterization reported from Nepal.

No abstract

The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, and uniquely shared by a given transmitter-receiver pair. The complexity associated with a richly scattering environment implies that the short-term fading process is inherently hard to predict and best modeled stochastically, with rapid decorrelation properties in space, time and frequency. In this paper, we demonstrate how the channel state between a wireless transmitter and receiver can be used as the basis for building practical secret key generation protocols between two entities. We begin by presenting a scheme based on level crossings of the fading process, which is well-suited for the Rayleigh and Rician fading models associated with a richly scattering environment. Our level crossing algorithm is simple, and incorporates a self-authenticating mechanism to prevent adversarial manipulation of message exchanges during the protocol. Since the level crossing algorithm is best suited for fading processes that exhibit symmetry in their underlying distribution, we present a second and more powerful approach that is suited for more general channel state distributions. This second approach is motivated by observations from quantizing jointly Gaussian processes, but exploits empirical measurements to set quantization boundaries and a heuristic log likelihood ratio estimate to achieve an improved secret key generation rate. We validate

No abstract