With the increase of commercial multimedia applications using digital video, the security of video data becomes more and more important. Although several techniques have been proposed in order to protect these video data, they provide limited security or introduce significant overhead. This paper proposes a video security scheme for MPEG video compression standard, which includes two methods: DCEA (DC Coefficient Encryption Algorithm) and "Event Shuffle." DCEA is aim to encrypt group of codewords of DC coefficients. The feature of this method is the usage of data permutation to scatter the ciphertexts of additional codes in DC codewords. These additional codes are encrypted by block cipher previously. With the combination of these algorithms, the method provides enough security for important DC component of MPEG video data. "Event Shuffle" is aim to encrypt the AC coefficients. The prominent feature of this method is a shuffling of AC events generated after DCT transformation and quantization stages. Experimental results show that these methods introduce no bit overhead to MPEG bit stream while achieving low processing overhead to MPEG codec.

It has been a very important issue to evaluate the performance of transmission control protocol (TCP), and the importance is still growing up because TCP will be deployed more widely in future wireless as well as wireline networks. It is also the reason why there have been a lot of efforts to analyze TCP performance more accurately. Most of these works are focusing on overall TCP end-to-end throughput that is defined as the number of bytes transmitted for a given time period. Even though each TCP's fast recovery strategy should be considered in computation of the exact time period, it has not been considered sufficiently in the existing models. That is, for more detailed performance analysis of a TCP implementation, the fast recovery latency during which lost packets are retransmitted should be considered with its relevant strategy. In this paper, we extend the existing models in order to capture TCP's loss recovery behaviors in detail. On the basis of the model, the loss recovery latency of three TCP implementations can be derived with considering the number of retransmitted packets. In particular, the proposed model differentiates the loss recovery performance of TCP using selective acknowledgement (SACK) option from TCP NewReno. We also verify that the proposed model reflects the precise latency of each TCP's loss recovery by simulations.

Recently, the radix-3 representation of integers is used for the efficient implementation of pairing based cryptosystems. In this paper, we propose non-adjacent form of radix-r representation (rNAF) and efficient algorithms for generating rNAF. The number of non-trivial digits is (r-2)(r+1)/2 and its average density of non-zero digit is asymptotically (r-1)/(2r-1). For r=3, the non-trivial digits are {2, 4} and the non-zero density is 0.4. We then investigate the width-w version of rNAF for the general radix-r representation, which is a natural extension of the width-w NAF. Finally we compare the proposed algorithms with the generalized NAF (gNAF) discussed by Joye and Yen. The proposed scheme requires a larger table but its non-zero density is smaller even for large radix. We explain that gNAF is a simple degeneration of rNAF--we can consider that rNAF is a canonical form for the radix-r representation. Therefore, rNAF is a good alternative to gNAF.

The newest video coding standard called H.264 provides considerable performance improvement over a wide range of bit rates and video resolutions compared to previous standards. However, these features result in an extraordinary increase in encoder complexity, mainly regarding to mode decision and multiple reference frame motion estimation (ME). This letter presents two algorithms to reduce the computational complexity caused by motion estimation. The adaptive search range decision method determines the search range size according to the motion vector predictor dynamically and the early termination scheme defines a criterion to early terminate the search processing for multiple reference frames. Experimental results show that the proposed algorithms provide significant improvement of coding speed with negligible objective quality degradation compared to the fast motion estimation algorithms adopted by reference software.

In this letter, a pilot structure and an efficient algorithm for downlink synchronization and cell searching in OFDM-based cellular systems are proposed. The pilots, randomly allocated in the frequency domain, allow us to minimize inter-cell interference (ICI) as well as to increase cell searching capability, estimation range of integer carrier frequency offset (CFO), and estimation accuracy of symbol timing offset (STO). The proposed low-complexity joint algorithm for integer CFO estimation, cell searching, and downlink detection is robust to ICI, multipath channel, STO and fine CFO.

A blind symbol synchronization scheme for MIMO and Multi-User OFDM systems is proposed, which utilizes short-time Fourier Transformation (STFT) to obtain 2D (time and frequency) timing information from the received signals. By analyzing the obtained 2D time-frequency amplitude spectrum, intervals where no inter-symbol interference (ISI) exists are checked out for symbol synchronization, and samples during these intervals are used to carry out carrier frequency offset estimation. Theoretical analysis and simulation results show that the proposed method is more robust and provides more accurate carrier frequency offset estimation than traditional schemes.

Multiple-input multiple-output (MIMO) eigenbeam space division multiplexing that uses adaptive modulations for substreams is a promising technology for improving transmission capacity. A fundamental drawback of this approach is that the modulation levels determined from the carrier-to-noise ratio at each substream are sometimes overly optimistic so the use of these modulation levels results in transmission errors and diminished transmission performance. A novel method of determining substream modulation levels is proposed that alleviates this degradation. In the proposed method, the expected bit error rates for possible modulations of each substream are calculated from delay profiles. Simulation results indicate that transmission capacity is improved by 30% using the new method compared with the conventional method.

Irregular Low-Density Parity-Check (LDPC) codes generally achieve better performance than regular LDPC codes at low Eb/N0 values. They have, however, higher error floors than regular LDPC codes. With respect to the construction of the irregular LDPC code, it can achieve the trade-off between the performance degradation of low Eb/N0 region and lowering error floor. It is known that a decoding algorithm can achieve very good performance if it combines the Ordered Statistic Decoding (OSD) algorithm and the Log Likelihood Ratio-Belief Propagation (LLR-BP) decoding algorithm. Unfortunately, all the codewords obtained by the OSD algorithm satisfy the parity check equation of the LDPC code. While we can not use the parity check equation of the LDPC code to stop the decoding process, the wrong codeword that satisfies the parity check equation raises the error floor. Once a codeword that satisfies the parity check equation is generated by the LLR-BP decoding algorithm, we regard that codeword as the final estimate and halt decoding; the OSD algorithm is not performed. In this paper, we propose a new encoding/decoding scheme to lower the error floor created by irregular LDPC codes. The proposed encoding scheme encodes information bits by Cyclic Redundancy Check (CRC) and LDPC code. The proposed decoding scheme, which consists of the LLR-BP decoding, CRC check, and OSD decoding, detects errors in the codewords obtained by the LLR-BP decoding algorithm and the OSD decoding algorithm using the parity check equations of LDPC codes and CRC. Computer simulations show that the proposed encoding/decoding scheme can lower the error floor of irregular LDPC codes.

In this paper, a novel projection-based method is presented to register partial 3D point clouds, acquired from a multi-view camera, for 3D reconstruction of an indoor scene. In general, conventional registration methods for partial 3D point clouds require a high computational complexity and much time for registration. Moreover, these methods are not robust for 3D point cloud which has a low precision. To overcome these drawbacks, a projection-based registration method is proposed. Firstly, depth images are refined based on both temporal and spatial properties. The former involves excluding 3D points with large variation, and the latter fills up holes referring to four neighboring 3D points, respectively. Secondly, 3D point clouds acquired from two views are projected onto the same image plane, and two-step integer mapping is applied to search for correspondences through the modified KLT. Then, fine registration is carried out by minimizing distance errors based on adaptive search range. Finally, we calculate a final color referring to the colors of corresponding points and reconstruct an indoor scene by applying the above procedure to consecutive scenes. The proposed method not only reduces computational complexity by searching for correspondences on a 2D image plane, but also enables effective registration even for 3D points which have a low precision. Furthermore, only a few color and depth images are needed to reconstruct an indoor scene. The generated model can be adopted for interaction with as well as navigation in a virtual environment.

This paper provides an overview of identity management with emphasis on the federated approaches, covering related standard specifications, and security and privacy considerations. Actual business cases, ranging from B2E to B2C in different industries, such as mobile communications, gaming, and digital TV are introduced. The Liberty Alliance identity frameworks are used as a concrete example to illustrate federated identity management technologies. Moreover, other approaches, such as SAML, shibboleth and WS-Federation, are compared.

This paper presents a new type of wearable teleoperation system that can be applied to the control of a humanoid robot. The proposed system has self-contained computing hardware with a stereo head-mounted display, a microphone, a set of headphones, and a wireless LAN. It also has a mechanism that tracks arm and head motion by using several types of sensors that detect the motion data of an operator, along with a simple force reflection mechanism that uses vibration motors at appropriate joints. For remote tasks, we use intelligent self-sensory feedback and autonomous behavior, such as automatic grasping and obstacle avoidance in a slave robot, and we feed the information back to an operator through a multimodal communication channel. Through this teleoperation system, we successfully demonstrate several teleoperative tasks, including object manipulation and mobile platform control of a humanoid robot.

In this paper authorization-limited transformation-free proxy cryptosystems (AL-TFP systems) are studied. It is a modification of the original proxy cryptosystem introduced by Mambo et al.[8] in which a ciphertext transformation by the original decryptor is necessary, and also a modification of the delegated decryption system proposed by Mu et al.[10]. In both systems proposed in [8] and [10], the original decryptors have to trust their proxies completely. The AL-TFP system allows the proxy decryptor to do decryption directly without any ciphertext transformation from the original decryptor, so that it can release the original decryptor more efficiently from a large amount of decrypting operations. Moreover, the original decryptor's privacy can be protected efficiently because the authority of proxy decryptor is limited to his duty and valid period. An active identity-based and a directory-based AL-TFP systems from pairings are proposed. Furthermore, an application of directory-based AL-TFP system to electronic commerce is also described. The securities of our schemes introduced are based on the BDH assumption.

This paper presents a correlation-based watermarking method for video using the similarity of adjacent frames. In general, the adjacent frames of a video sequence is very similar. In the proposed scheme, we use an adjoining frame in detection process instead of an original image in the watermarking scheme of Cox et al. So the proposed method does not need an original video sequence in detection process. When a watermarked video sequence is attacked by overwriting copy or frame dropping, the pair of the frames that is not adjoining in an original video sequence is used in detection process. However, since a watermark is embedded in a part of each frame and embedding positions are different for each frame in the proposed method, we can detect the watermark even from an overwriting-copied video sequence and a frame-dropped video sequence. Experimental results show that the proposed method is robust against overwriting copy and frame dropping. Moreover, it is shown from experimental results that the method has robustness to low bitrate MPEG compression and StirMark attack.

Moment vector equations (MVEs) are presented for use in approximating and analyzing multi-dimensional non-linear discrete- and continuous-time equations. A non-linear equation is expanded into simultaneous equations of generalized moments and then reduced to an MVE of a coefficient matrix and a moment vector. The MVE can be used to analyze the statistical properties, such as the mean, variance, covariance, and power spectrum, of the non-linear equation. Moreover, we can approximately express a combination of non-linear equations by using a combination of MVEs of the equations. Evaluation of the statistical properties of Lorenz equations and of a combination of logistic equations based on the MVE approach showed that MVEs can be used to approximate non-linear equations in statistical measurements.

In this letter, we focus on rearranged pilot patterns for channel estimation in a mobile communication system using Orthogonal Frequency Division Multiplexing (OFDM). The conventional pilot patterns for channel estimation in OFDM systems do not have robust characteristics in time-varying channels. In order to overcome this weakness of the conventional pilot patterns, we propose the pilot patterns with robust mobility for OFDM systems, which can achieve a good error performance in time-varying multi-path fading channels. Simulation results show that the bit error rate (BER) performances of the proposed pilot patterns are better than those of the conventional pilot patterns in fast time-varying fading channels under the same pilot density and data rate.

In 2000, Xu and Tilborg proposed an ID-based conference key distribution scheme which builds on earlier work of Harn and Yang in the 2-party setting. Recently, Jung et al. have discovered security flaws in the Xu-Tilborg scheme and proposed an improvement of this scheme to fix the security flaws. However, Jung et al.'s improvement introduces another security weakness. We demonstrate this by showing that the improved scheme is vulnerable to a parallel session attack mounted by two colluding adversaries. Further, we recommend changes to the scheme that address this vulnerability.

Recently, Chien et al. proposed an efficient timestamp-based remote user authentication scheme using smart cards. The main merits include: (1) user-independent server, i.e., there is no password or verification table kept in the server; (2) users can freely choose their passwords; (3) mutual authentication is provided between the user and the server; and (4) lower communication and computation cost. In this paper, we show that Chien et al.'s scheme is insecure against forgery attack because one adversary can easily pretend to be a legal user, pass the server's verification and login to the remote system successfully. An improved scheme is proposed that can overcome the security risk while still preserving all the above advantages.

This paper studies the state-of-the-art software optimization methodology for symmetric cryptographic primitives on Pentium III and 4 processors. We aim at maximizing speed by considering the internal pipeline architecture of these processors. This is the first paper studying an optimization of ciphers on Prescott, a new core of Pentium 4. Our AES program with 128-bit key achieves 251 cycles/block on Pentium 4, which is, to our best knowledge, the fastest implementation of AES on Pentium 4. We also optimize SNOW2.0 keystream generator. Our program of SNOW2.0 runs at the rate of 2.75 µops/cycle on Pentium III, which seems the most efficient code ever made for a real-world cipher primitive. Our another interest is to optimize cryptographic primitives that essentially utilize 64-bit operations on Pentium processors. For the first example, the FOX128 block cipher, we propose a technique for speeding-up by interleaving two independent blocks using a register group separation. For another examples, we consider fast implementation of SHA512 and Whirlpool. It will be shown that the new SIMD instruction sets introduced in Pentium 4 excellently contribute to fast hashing of SHA512.

In a Peer-to-Peer (P2P) network, in order to improve the search performance and to achieve load balancing, replicas of original data are created and distributed over the Internet. However, the replication methods which have been proposed so far focus only on the improvement of search performance. In this paper, we examine the load on the storage systems, which is due to writing and reading, and propose two replication methods for balancing the load on the storages distributed over P2P networks while limiting the degradation of the search performance within an acceptable level. Furthermore, we investigate the performance of our proposed replication methods through computer simulations, and show their effectiveness in balancing the load.

In this letter, a simple peak-to-average power ratio (PAPR) reduction method using subband permutation is proposed for multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. The proposed method is shown to have a 2-3 dB PAPR reduction gain for 2 transmit antennas, compared with the conventional MIMO-OFDM, and a low computational complexity at the transmitter and receiver.