Gaoyuan ZHANG Hong WEN Longye WANG Xiaoli ZENG Jie TANG Runfa LIAO Liang SONG
A simple and novel multiple-symbol differential detection (MSDD) scheme is proposed for IEEE 802.15.4 binary phase shift keying (BPSK) receivers. The detection is initiated by estimating and compensating the carrier frequency offset (CFO) effect in the chip sample of interest. With these new statistics, the decisions are jointly made by allowing the observation window length to be longer than two bit intervals. Simulation results demonstrate that detection reliability of the IEEE 802.15.4 BPSK receivers is significantly improved. Namely, at packet error rate (PER) of 1×10-3, the signal-to-noise ratio (SNR) gap between ideal coherent detection (perfect carrier reference phase and no CFO) with differential decoding and conventional optimal single differential coherent detection (SDCD) is filled by 2.1dB when the observation window length is set to 6bit intervals. Then, the benefit that less energy consumed by retransmissions is successfully achieved.
In this letter, we present a class of binary sequences with optimal autocorrelation magnitude. Compared with Krengel-Ivanov sequences, some proposed sequences have different autocorrelation distribution. This indicates those sequences would be new. As an application of constructed binary sequences, we derive a class of quaternary sequences of length 4p with autocorrelation magnitude equal to $2sqrt{2}$, which is lower than the autocorrelation magnitude equal to 4 of Chung-Han-Yang sequences given in 2011.
Haruka ITO Masanori HIROTOMO Youji FUKUTA Masami MOHRI Yoshiaki SHIRAISHI
Recently, IoT compatible products have been popular, and various kinds of things are IoT compliant products. In these devices, cryptosystems and authentication are not treated properly, and security measures for IoT devices are not sufficient. Requirements of authentication for IoT devices are power saving and one-to-many communication. In this paper, we propose a zero-knowledge identification scheme using LDPC codes. In the proposed scheme, the zero-knowledge identification scheme that relies on the binary syndrome decoding problem is improved and the computational cost of identification is reduced by using the sparse parity-check matrix of the LDPC codes. In addition, the security level, computational cost and safety of the proposed scheme are discussed in detail.
Taekeun PARK Koohong KANG Daesung MOON
In this paper, we propose a scalable and seamless connection migration scheme for moving target defense in legacy networks. The main idea is that a host is allowed to receive incoming packets with a destination address that is either its current IP address or its previous IP address for a period of time because the host does not physically move into another network. Experimental results show that our scheme outperforms the existing connection migration mechanism regardless of the number of active connections in the host.
Ignacio ALGREDO-BADILLO Francisco R. CASTILLO-SORIA Kelsey A. RAMÍREZ-GUTIÉRREZ Luis MORALES-ROSALES Alejandro MEDINA-SANTIAGO Claudia FEREGRINO-URIBE
The great increase of the digital communications, where the technological society depends on applications, devices and networks, the security problems motivate different researches for providing algorithms and systems resistant to attacks, and these lasts need of services of confidentiality, authentication, integrity, etc. This paper proposes the hardware implementation of an steganographic/cryptographic algorithm, which is based on the DWT (Discrete Wavelet Transform) and the AES (Advanced Encryption Standard) cipher algorithm in CBC mode. The proposed scheme takes advantage of a double-security ciphertext, which makes difficult to identify and decipher it. The hardware architecture reports a high efficiency (182.2 bps/slice and 85.2 bps/LUT) and low hardware resources consumption (867 slices and 1853 LUTs), where several parallel implementations can improve the throughout (0.162 Mbps) for processing large amounts of data.
Xiaofei SONG Yanguo JIA Xiumin SHEN Yubo LI Xiuping PENG
In this letter, two new families of quaternary sequences with low four-level or five-level autocorrelation are constructed based on generalized cyclotomy over Z2p. These quaternary sequences are balanced and the maximal absolute value of the out-of-phase autocorrelation is 4.
Hideaki ISHIBASHI Masayoshi ERA Tetsuo FURUKAWA
The aim of this work is to develop a method for the simultaneous analysis of multiple groups and their members based on hierarchical tensor manifold modeling. The method is particularly designed to analyze multiple teams, such as sports teams and business teams. The proposed method represents members' data using a nonlinear manifold for each team, and then these manifolds are further modeled using another nonlinear manifold in the model space. For this purpose, the method estimates the role of each member in the team, and discovers correspondences between members that play similar roles in different teams. The proposed method was applied to basketball league data, and it demonstrated the ability of knowledge discovery from players' statistics. We also demonstrated that the method could be used as a general tool for multi-level multi-group analysis by applying it to marketing data.
We studied complicated superstable periodic orbits (SSPOs) in a spiking neuron model with a rectangular threshold signal. The neuron exhibited SSPOs with various periods that changed dramatically when we varied the parameter space. Using a one-dimensional return map defined by the spike phase, we evaluated period changes and showed its complicated distribution. Finally, we constructed a test circuit to confirm the typical phenomena displayed by the mathematical model.
Geun-Jun KIM Seungmin LEE Bongsoon KANG
Hazes with various properties spread widely across flat areas with depth continuities and corner areas with depth discontinuities. Removing haze from a single hazy image is difficult due to its ill-posed nature. To solve this problem, this study proposes a modified hybrid median filter that performs a median filter to preserve the edges of flat areas and a hybrid median filter to preserve depth discontinuity corners. Recovered scene radiance, which is obtained by removing hazy particles, restores image visibility using adaptive nonlinear curves for dynamic range expansion. Using comparative studies and quantitative evaluations, this study shows that the proposed method achieves similar or better results than those of other state-of-the-art methods.
Reona SUGIYAMA Quang-Thang DUONG Minoru OKADA
Optimal loads and maximum achievable efficiency for multiple-receiver inductive power transfer (IPT) system have been formulated by theoretical studies in literatures. This paper presents extended analysis on system behavior at optimal load condition and extensive S-parameter evaluation to validate the formulas. Our results confirm that at the optimal load condition, the system is in a resonance state; the impact of cross-coupling among receivers is completely mitigated; and the efficiency reaches its maximum expressed by an efficiency angle tangent, in an manner analogous to the well-known kQ-theory for single-receiver IPT. Our contributions do not lie in practical applications of multiple-receiver IPT but in establishing principles for design and benchmarking the system.
Sonu JHA Subhadeep BANIK Takanori ISOBE Toshihiro OHIGASHI Santanu SARKAR
In this paper we present proofs for the new biases in RC4 which were experimentally found and listed out (without theoretical justifications and proofs) in a paper by Vanhoef et al. in USENIX 2015. Their purpose was to exploit the vulnerabilities of RC4 in TLS using the set of new biases found by them. We also show (and prove) new results on couple of very strong biases residing in the joint distribution of three consecutive output bytes of the RC4 stream cipher. These biases provides completely new distinguisher for RC4 taking roughly O(224) samples to distinguish streams of RC4 from a uniformly random stream. We also provide a list of new results with proofs relating to some conditional biases in the keystreams of the RC4 stream cipher.
A fusion framework between CNN and RNN is proposed dedicatedly for air-writing recognition. By modeling the air-writing using both spatial and temporal features, the proposed network can learn more information than existing techniques. Performance of the proposed network is evaluated by using the alphabet and numeric datasets in the public database namely the 6DMG. Average accuracy of the proposed fusion network outperforms other techniques, i.e. 99.25% and 99.83% are observed in the alphabet gesture and the numeric gesture, respectively. Simplified structure of RNN is also proposed, which can attain about two folds speed-up of ordinary BLSTM network. It is also confirmed that only the distance between consecutive sampling points is enough to attain high recognition performance.
The demand for and the scope of connected services have rapidly grown and developed in many industries such as electronic appliances, robotics, and industry automation. In the automotive field, including connected vehicles, different types of connected services have become available and they provide convenience and comfort with users while yielding new business opportunities. With the advent of connected vehicles, the threat of cyber attacks has become a serious issue and protection methods against these attacks are urgently needed to provide safe and secure connected services. From 2017, attack methods have become more sophisticated through different attack surfaces attached to navigation systems and telematics modules, and security requirements to circumvent such attacks have begun to be established. Individual threats have been addressed previously; however, there are few reports that provide an overview of cyber security related to connected vehicles. This paper gives our perspective on cyber security for connected vehicles based on a survey of recent studies related to vehicle security. To introduce these studies, the environment surrounding connected vehicles is classified into three categories: inside the vehicle, communications between the back-end systems and vehicles, and the back-end systems. In each category, this paper introduces recent trends in cyber attacks and the protection requirements that should be developed for connected services. We show that the overall security covering the three categories must be considered because the security of the vehicle is jeopardized even if one item in the categories is not covered. We believe that this paper will further contribute to development of all service systems related to connected vehicles including autonomous vehicles and to the investigation into cyber security against these attacks.
Chaman WIJESIRIWARDANA Prasad WIMALARATNE
Mining software repositories allow software practitioners to improve the quality of software systems and to support maintenance based on historical data. Such data is scattered across autonomous and heterogeneous information sources, such as version control, bug tracking and build automation systems. Despite having many tools to track and measure the data originated from such repositories, software practitioners often suffer from a scarcity of the techniques necessary to dynamically leverage software repositories to fulfill their complex information needs. For example, answering a question such as “What is the number of commits between two successful builds?” requires tiresome manual inspection of multiple repositories. As a solution, this paper presents a conceptual framework and a proof of concept visual query interface to satisfy distinct software quality related information needs of software practitioners. The data originated from repositories is integrated and analyzed to perform systematic investigations, which helps to uncover hidden relationships between software quality and trends of software evolution. This approach has several significant benefits such as the ability to perform real-time analyses, the ability to combine data from various software repositories and generate queries dynamically. The framework evaluated with 31 subjects by using a series of questions categorized into three software evolution scenarios. The evaluation results evidently show that our framework surpasses the state of the art tools in terms of correctness, time and usability.
Hiroya IKARASHI Yong JIN Nariyoshi YAMAI Naoya KITAGAWA Kiyohiko OKAYAMA
Security facilities such as firewall system and IDS/IPS (Intrusion Detection System/Intrusion Prevention System) have become fundamental solutions against cyber threats. With the rapid change of cyber attack tactics, detail investigations like DPI (Deep Packet Inspection) and SPI (Stateful Packet Inspection) for incoming traffic become necessary while they also cause the decrease of network throughput. In this paper, we propose an SDN (Software Defined Network) - based proactive firewall system in collaboration with domain name resolution to solve the problem. The system consists of two firewall units (lightweight and normal) and a proper one will be assigned for checking the client of incoming traffic by the collaboration of SDN controller and internal authoritative DNS server. The internal authoritative DNS server obtains the client IP address using EDNS (Extension Mechanisms for DNS) Client Subnet Option from the external DNS full resolver during the name resolution stage and notifies the client IP address to the SDN controller. By checking the client IP address on the whitelist and blacklist, the SDN controller assigns a proper firewall unit for investigating the incoming traffic from the client. Consequently, the incoming traffic from a trusted client will be directed to the lightweight firewall unit while from others to the normal firewall unit. As a result, the incoming traffic can be distributed properly to the firewall units and the congestion can be mitigated. We implemented a prototype system and evaluated its performance in a local experimental network. Based on the results, we confirmed that the prototype system presented expected features and acceptable performance when there was no flooding attack. We also confirmed that the prototype system showed better performance than conventional firewall system under ICMP flooding attack.
Qian CHENG Jiang ZHU Junshan LUO
A novel secure spatial modulation (SM) scheme based on dynamic multi-parameter weighted-type fractional Fourier transform (WFRFT), abbreviated as SMW, is proposed. Each legitimate transmitter runs WFRFT on the spatially modulated super symbols before transmit antennas, the parameters of which are dynamically updated using the transmitting bits. Each legitimate receiver runs inverse WFRFT to demodulate the received signals, the parameters of which are also dynamically generated using the recovered bits with the same updating strategies as the transmitter. The dynamic update strategies of WFRFT parameters are designed. As a passive eavesdropper is ignorant of the initial WFRFT parameters and the dynamic update strategies, which are indicated by the transmitted bits, it cannot recover the original information, thereby guaranteeing the communication security between legitimate transmitter and receiver. Besides, we formulate the maximum likelihood (ML) detector and analyze the secrecy capacity and the upper bound of BER. Simulations demonstrate that the proposed SMW scheme can achieve a high level of secrecy capacity and maintain legitimate receiver's low BER performance while deteriorating the eavesdropper's BER.
In this letter, we consider the harvested-energy fairness problem in cognitive multicast systems with simultaneous wireless information and power transfer. In the cognitive multicast system, a cognitive transmitter with multi-antenna sends the same information to cognitive users in the presence of licensed users, and cognitive users can decode information and harvest energy with a power-splitting structure. The harvested-energy fairness problem is formulated and solved by using two proposed algorithms, which are based on semidefinite relaxation with majorization-minimization method, and sequential parametric convex approximation with feasible point pursuit technique, respectively. Finally, the performances of the proposed solutions and baseline schemes are verified by simulation results.
WenJie KANG PeiDong ZHU JieXin ZHANG JunYang ZHANG
Critical nodes identification is of great significance in protecting power grids. Network efficiency can be used as an evaluation index to identify the critical nodes and is an indicator to quantify how efficiently a network exchanges information and transmits energy. Since power grid is a heterogeneous network and can be decomposed into small functionally-independent grids, the concept of the Giant Component does not apply to power grids. In this paper, we first model the power grid as the directed graph and define the Giant Efficiency sub-Graph (GEsG). The GEsG is the functionally-independent unit of the network where electric energy can be transmitted from a generation node (i.e., power plants) to some demand nodes (i.e., transmission stations and distribution stations) via the shortest path. Secondly, we propose an algorithm to evaluate the importance of nodes by calculating their critical degree, results of which can be used to identify critical nodes in heterogeneous networks. Thirdly, we define node efficiency loss to verify the accuracy of critical nodes identification (CNI) algorithm and compare the results that GEsG and Giant Component are separately used as assessment criteria for computing the node efficiency loss. Experiments prove the accuracy and efficiency of our CNI algorithm and show that the GEsG can better reflect heterogeneous characteristics and power transmission of power grids than the Giant Component. Our investigation leads to a counterintuitive finding that the most important critical nodes may not be the generation nodes but some demand nodes.
Xuewan ZHANG Wenping GE Xiong WU Wenli DAI
Sparse code multiple access (SCMA) based on the message passing algorithm (MPA) for multiuser detection is a competitive non-orthogonal multiple access technique for fifth-generation wireless communication networks Among the existing multiuser detection schemes for uplink (UP) SCMA systems, the serial MPA (S-MPA) scheme, where messages are updated sequentially, generally converges faster than the conventional MPA (C-MPA) scheme, where all messages are updated in a parallel manner. In this paper, the optimization of message scheduling in the S-MPA scheme is proposed. Firstly, some statistical results for the probability density function (PDF) of the received signal are obtained at various signal-to-noise ratios (SNR) by using the Monte Carlo method. Then, based on the non-orthogonal property of SCMA, the data mapping relationship between resource nodes and user nodes is comprehensively analyzed. A partial codeword transmission of S-MPA (PCTS-MPA) with threshold decision scheme of PDF is proposed and verified. Simulations show that the proposed PCTS-MPA not only reduces the complexity of MPA without changing the bit error ratio (BER), but also has a faster convergence than S-MPA, especially at high SNR values.
Accurate visual correspondence is the foundation of many computer vision based applications. Since existing image matching algorithms generate mismatches inevitably, a reliable mismatch-removal algorithm is highly desired to remove mismatches and preserve true matches. This paper proposes a hierarchical progressive trust (HPT) model to solve this problem. The HPT model first adopts a “trust the most trustworthy ones” strategy to select anchor inliers in its bottom layer, and then progressively propagates the trust from bottom layer to other layers in a bottom-up way: 1) bottom layer verifies anchor inliers with the guidance of local features; 2) middle layers progressively estimate local transformations and perform local verifications; 3) top layer estimates a global transformation with an anchor-inliers-guided expectation maximization (EM) algorithm and performs global verifications. Experimental results show that the proposed HPT model achieves higher performance than state-of-the-art mismatch-removal methods under both rigid transformations and non-rigid deformations.