Reproducible Circularly Secure Bit Encryption: Applications and Realizations

We give generic constructions of several fundamental cryptographic primitives based on a new encryption primitive that combines circular security for bit encryption with the so-called reproducibility property (Bellare et al. in Public key cryptography—PKC 2003, vol. 2567, pp. 85–99, Springer, 2003). At the heart of our constructions is a novel technique which gives a way of de-randomizing reproducible public-key bit encryption schemes and also a way of reducing one-wayness conditions of a constructed trapdoor function family (TDF) to circular security of the base scheme. The main primitives that we build from our encryption primitive include k-wise one-way TDFs (Rosen and Segev in SIAM J Comput 39(7):3058–3088, 2010), chosen-ciphertext-attack-secure encryption and deterministic encryption. Our results demonstrate a new set of applications of circularly secure encryption beyond fully homomorphic encryption and symbolic soundness. Finally, we show the plausibility of our assumptions by showing that the decisional Diffie–Hellman-based circularly secure scheme of Boneh et al. (Advances in cryptology—CRYPTO 2008, vol. 5157, Springer, 2008) and the subgroup indistinguishability-based scheme of Brakerski and Goldwasser (Advances in cryptology—CRYPTO 2010, vol. 6223, pp. 1–20, Springer, 2010) are both reproducible.     

OVSF Code Sharing and Reducing the Code Wastage Capacity in WCDMA

The non quantized nature of user rate wastes the code capacity in Orthogonal Variable Spreading Factor Codes (OVSF) based Code Division Multiple Access (CDMA) systems. The code sharing scheme in multi code CDMA is proposed to minimize the code rate wastage. The scheme combines the unused (wastage) capacity of already occupied codes to reduce the code blocking problem. Simulation results are presented to show the superiority of the proposed code assignment scheme as compared to existing schemes.

A Reliable Multicast Routing Protocol Based on Recovery Points and FEC in Mobile Ad-hoc Networks

Multicasting is an essential service for mobile ad-hoc networks. A major challenge for multicasting in mobile ad-hoc networks (MANETs) is the unstable forwarding path. This work presents a reliable multicasting protocol for mobile ad-hoc networks. A virtual backbone is used as a shared structure for multiple sessions. A lost packet recovery scheme is developed for reliable packet transmission, called the Recovery Point (RP) scheme. The RP scheme maintains the data packets received from the source for recovering lost packets for its downstream RPs. In addition, we combine the Forward Error Correction (FEC) technology with our RP scheme to enhance the reliability of our RP scheme. A mergence scheme for RP is also proposed to avoid excessive control overhead. Our RP and FEC based scheme can be used to improve the reliability and efficiency of the traditional non-acknowledged multicasting approach. Experiments were conducted to evaluate the proposed multicasting scheme. The results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio and multicast efficiency. Furthermore, the simulation results also demonstrate that our approach is stable in networks with high mobility.

Eigentargets Versus Kernel Eigentargets: Detection of Infrared Point Targets Using Linear and Nonlinear Subspace Algorithms

The Eigentargets method, based on the linear principal component analysis (LPCA), has been used successfully to detect infrared point targets. LPCA is based only on the second-order correlations without taking higher-order statistics into account. That results in the limitation of Eigentargets in target detection. This paper extends Eigentargets, a linear subspace method, to kernel Eigentargets, a detection method based on a nonlinear subspace algorithm. Because the kernel Eigentargets is capable of capturing the part of higher-order statistics, the better detection performance can be achieved. Moreover, the Gaussian intensity model is modified to generate training samples of infrared point targets.     

A New Modulation for Intrinsically Secure Radio Channel in Wireless Systems

One of the biggest challenges in RFID (radio frequency identification) large scale deployment, such as in warehouse RFID deployment, is the positioning of RFID reader antennas to efficiently locate all the tagged objects distributed at RFID reader environment. This paper has investigated a novel location sensing system based on geometric grid covering algorithm that can use any passive or active RFID standard for positioning or tracking objects inside buildings. This study involves design of RFID reader antenna network which focuses on placing the reader antennas on a grid to cover all the tags distributed at two dimensional planes and position calculation using statistical averages algorithm. The statistical averages algorithm simply computes the location coordinates of the tagged object by statistical average of the reader antenna’s location. The proposed grid of reader antennas can assist in minimizing the actual number of reader antennas required for RFID large scale deployment. The proposed prototype system is a simpler positioning system which presents the solution of placement pattern of RFID reader antennas, gives less complicated mathematical calculation, and is able to provide a high degree of accuracy. The obtained results show that the proposed location sensing system can achieve better positioning accuracy as compared to existing positioning system and in some cases accuracy improvement of about 50% can be reached.

Secure Communications System Through Concurrent AJ and LPD Evaluation

In this paper, a systematic approach and their corresponding metrics for concurrent anti-jamming (AJ) and low probability of detection (LPD) performance evaluations of a secure communications system are investigated. In general, it is necessary to deal simultaneously with adversary threats of both active jamming and passive detection for a secure communications system concern. For independent or concurrent AJ and LPD performance evaluations, a single varying paired and multiple paired fixed collocated jammers/interceptors scenario is explored with real sinc type (sin(x)/x) antenna patterns being considered for the communicators. The error probability with both AJ and LPD being considered simultaneously can be derived as system- and geometry-dependent factors and categorized as system metrics related to jammers, interceptors, and communicators themselves only. Whenever multiple collocated jammers/interceptors are considered, we can observe interesting “smoothed” effects for bit energy to jamming density ratio (E _b /J _o ), when one of these varying jammers/interceptors is approaching or receding. In addition, by means of these system metrics, it is intuitive and straightforward to enhance system performance for the victim or to deteriorate system performance for the adversary, respectively. Moreover, the proposed approach and metrics have also paved one practical way for the developments of the latest emphasized cognitive radio (CR) communications systems, if all the collocated jammers/interceptors on the proposed scenario are replaced with “cooperative” communicators.

An opportunistic cooperation scheme and its BER analysis

The cooperative communication technology proposed in recent years enables network nodes to share their antennas to achieve diversity gain. In this paper, an efficient variation scheme on opportunistic cooperation is proposed by using an outage criterion, in which the cooperation mode will be adopted only when the channel from source to relay does not occur outage event. We derive a closed-form BER (bit error rate) expression for the proposed scheme over Rayleigh fading channels, showing that the full diversity is achieved by the new scheme. Also, the BER performance of the known coded cooperation is presented for the purpose of comparison with our scheme. Numerical results illustrate the superiority of the proposed scheme over the coded cooperation in terms of BER performance. It is pointed out that the corresponding BER advantage of the proposed scheme comes at the expense of increasing system overhead since the new scheme needs some feedback from relay to both source and destination.     

基于Chirp Scaling的双基SAR成像PFA算法研究

该文研究了基于Chirp Scaling原理实现双基聚束SAR成像的极坐标格式算法(Polar Format Algorithm, PFA)。PFA通过两个一维插值来实现数据的极坐标格式转换,插值计算量较大。该文基于发射信号的线性调频特性,在距离向对极坐标格式数据进行变标处理,仅包含信号复乘和FFT,从而避免了插值运算。文中对于接收Chirp信号和Dechirp信号分别进行了讨论,依照不同流程实现了极坐标格式算法。同插值方法相比,二者聚焦结果相当,但是CS(Chirp Scaling)的方法速度有显著提高。点目标仿真实验验证了此方法的有效性。     

基于累计量的干扰信号调制识别算法

为解决正常通信中检测到非法或干扰信号时的调制识别问题,该文提出了一种共信道干扰信号调制识别算法。分析了相偏、频偏等未知参数对共信道信号四阶累积量的影响并给出降低这些影响的方法。以信号四阶累积量为识别特征对干扰信号的调制方式进行识别。同时给出干扰信号相偏、频偏等参数的估计。实验结果表明了所提算法的有效性。     

水下无线多点通信系统研究

随着世界各国海洋开发和海洋军事领域的飞速发展,对水下传感网络、水下监视系统、水声预警网络的需求越来越迫切.这里讨论一种采用跳频通信方式,以凌阳16位单片机SPEC061A为控制核心,通过主节点向各分节点发送信息或指令,实现水下无线多点通信.分析了通信节点的硬件和软件设计.通过水池实验证明该系统能够可靠稳定的工作,具有良好的性能.