This paper introduces a novel type of digital watermarking, which is mainly designed for embededing information into cryptographic data such as keys, ciphertexts, and signatures. We focus on a mathematical structure of the recent major cryptosystems called pairing-based schemes. We present a detection-type watermarking scheme by which a watermark is visible by anyone but unremovable without secret trapdoor. The important feature is that both correctness and security of cryptographic data remain satisfied even if the trapdoor is published.

Recently, we have proposed a new prefix lookup algorithm which would use the prefixes as scalar numbers. This algorithm could be applied to different tree structures such as Binary Search Tree and some other balanced trees like RB-tree, AVL-tree and B-tree with minor modifications in the search, insert and/or delete procedures to make them capable of finding the prefixes of an incoming string e.g. an IP address. As a result, the search procedure complexity would be O(log n) where n is the number of prefixes stored in the tree. More important, the search complexity would not depend on the address length w i.e. 32 for IPv4 and 128 for IPv6. Here, it is assumed that interface to memory is wide enough to access the prefix and some simple operations like comparison can be done in O(1) even for the word length w. Moreover, insertion and deletion procedures of this algorithm are much simpler and faster than its competitors. In what follows, we report the software implementation results of this algorithm and compare it with other solutions for both IPv4 and IPv6. It also reports on a simple hardware implementation of the algorithm for IPv4. Comparison results show better lookup and update performances or superior storage requirements for Scalar Prefix Search in both average and worst cases.

The influence of noise is an important problem on image acquisition and transmission stages. The traditional image denoising approaches only analyzing the pixels of local region with a moving window, which calculated by neighbor pixels to denoise. Recently, this research has been focused on the transform domain and feature space. Compare with the traditional approaches, the global multi-scale analyzing and unchangeable noise distribution is the advantage. Apparently, the estimation based methods can be used in transform domain and get better effect. This paper proposed a new approach to image denoising in orthonormal wavelet domain. In this paper, we adopt Stein's unbiased risk estimate (SURE) based method to denoise the low-frequency bands and the feature patches distance constraint (FPDC) method also be proposed to estimate the noise free bands in Wavelet domain. The key point is that how to divide the lower frequency sub-bands and the higher frequency sub-bands, and do interscale SURE and intrascale FPDC, respectively. We compared our denoising method with some well-known and new denoising algorithms, the experimental results show that the proposed method can give better performance and keep more detail information in most objective and subjective criteria than other methods.

DTDs are continuously updated according to changes in the real world. Let t be an XML document valid against a DTD D, and suppose that D is updated by an update script s. In general, we cannot uniquely "infer" a transformation of t from s, i.e., we cannot uniquely determine the elements in t that should be deleted and/or the positions in t that new elements should be inserted into. In this paper, we consider inferring K optimum transformations of t from s so that a user finds the most desirable transformation more easily. We first show that the problem of inferring K optimum transformations of an XML document from an update script is NP-hard even if K = 1. Then, assuming that an update script is of length one, we show an algorithm for solving the problem, which runs in time polynomial of |D|, |t|, and K.

Continuous processing and servicing of a new incoming session in LTE systems demands optimal tracking of the mobile user. In this letter, an optimal, information-theoretic framework is developed for tracking area update for next-generation LTE cellular systems. Shannon's entropy is used to characterize the location uncertainty of mobile user. The framework captures users' mobility patterns online and performs profile-based paging for optimizing the tracking area update cost. Simulation results demonstrate reductions in both update and paging costs in comparison to existing LTE systems.

This paper provides an investigation of power distribution network (PDN) performance by a full-wave prediction tool and by experimental measurements. A set of six real boards characterized by increasing complexity is considered in order to establish a solid base for behaviour understanding of printed circuit boards. How the growing complexity impacts on the board performance is investigated by measurements and by simulations. Strengths and weakness of PDN modeling by the full-wave software tool Microwave Studio are highlighted and discussed.

Noise coupling on the power distribution networks (PDN) or between PDN and signal traces is becoming one of the main challenges in designing above GHz high-speed digital circuits. Developing an efficient and accurate modeling method is essential to understand the noise coupling mechanism and then solve the problem afterwards. In addition, development of new noise mitigation technology is also important for future high-speed circuit systems. In this invited paper, a novel modeling methodology that is based on the physics-based equivalent circuit model will be introduced, and an example of multiple layer PCB circuits will be modeled and validated with good accuracy. Based on the periodic structure concept, several new electromagnetic bandgap structures (EBG), such as coplanar EBG, photonic crystal power layer (PCPL), and ground surface perturbation lattice (GSPL), will be introduced for the mitigation of power/ground noise. The trade/offs of all these structures will be discussed.

Trapdoor commitment schemes are widely used for adding valuable properties to ordinary signatures or enhancing the security of weakly secure signatures. In this letter, we propose a trapdoor commitment scheme based on RSA function, and prove its security under the hardness of the integer factoring. Our scheme is very efficient in computing a commitment. Especially, it requires only three multiplications for evaluating a commitment when e=3 is used as a public exponent of RSA function. Moreover, our scheme has two useful properties, key exposure freeness and strong trapdoor opening, which are useful for designing secure chameleon signature schemes and converting a weakly secure signature to a strongly secure signature, respectively.

In 1999, Gennaro, Halevi and Rabin proposed a signature which achieves provable security without assuming the random oracles, and it is the first RSA-type signature whose security is proved in the standard model. Since that time, several signatures have been proposed to achieve better efficiency or useful property along with the provable security in the standard model. In this paper, we construct a trapdoor hash function, and design an efficient online/offline signature by using the trapdoor hash function. Our signature scheme requires only one non-modular multiplication of two small integers for online signing, and it provides the fastest online signing among all online/offline signatures that achieve provable security in the standard model.

In this paper, we present the development of an advanced MMIC receiver for a 94-GHz band passive millimeter-wave (PMMW) imager. Our configuration is based on a Dicke receiver in order to reduce fluctuations in the detected voltage. By introducing an electronic switch in the MMIC, we achieved a high resolution millimeter-wave image in a shorter image collection time compared to that with a conventional mechanical chopper. We also developed an imaging array using MMIC receivers.

This paper describes the recent advances in semiconductor photodiodes for use in ultra-high-speed optical systems. We developed two types of waveguide photodiodes (WG-PD) -- an evanescently coupled waveguide photodiode (EC-WG-PD) and a separated-absorption-and-multiplication waveguide avalanche photodiode (WG-APD). The EC-WG-PD is very robust under high optical input operation because of its distribution of photo current density along the light propagation. The EC-WG-PD simultaneously exhibited a high external quantum efficiency of 70% for both 1310 and 1550 nm, and a wide bandwidth of more than 40 GHz. The WG-APD, on the other hand, has a wide bandwidth of 36.5 GHz and a gain-bandwidth product of 170 GHz as a result of its small waveguide mesa structure and a thin multiplication layer. Record high receiver sensitivity of -19.6 dBm at 40 Gbps was achieved. Additionally, a monolithically integrated dual EC-WG-PD for differential phase shift-keying (DPSK) systems was developed. Each PD has equivalent characteristics with 3-dB-down bandwidth of more than 40 GHz and external quantum efficiency of 70% at 1550 nm.

The vacuum sealing process with a base vacuum of 10-5 Torr is adopted to minimize the residual impurity gas. The address and sustain discharges in the 42-in PDP prepared by the vacuum-sealing process are observed by using the ICCD. As a result, the ICCD observation illustrates that thanks to the reduction of the impurity level by the vacuum-sealing process, the surface and plate-gap discharges are initiated and extinguished very fast and the corresponding IR emissions are also intensified.

We have studied the formation of Pd-nanodots on SiO2 from ultrathin Pd films being exposed to remote hydrogen plasma at room temperature, in which parameters such as the gas pressure and input power to generate H2 plasma and the Pd film thickness were selected to get some insights into surface migration of Pd atoms induced with atomic hydrogen irradiation and resultant agglomeration with cohesive action. The areal dot density was controlled in the range from 3.4 to 6.51011 cm - 2 while the dot size distribution was changed from 7 to 1.5 in average dot height with 40% variation in full-width at half maximum. We also fabricated MOS capacitors with a Pd-nanodots floating gate and confirmed the flat-band voltage shift in capacitance-voltage characteristic due to electron injection to and emission from the dots floating gate.

Codebook based multiple-input multiple-output (MIMO) precoding can significantly improve the system spectral efficiency with limited feedback and has been accepted as one of the most promising techniques for the Evolved UTRA (E-UTRA). Compared with single-user (SU) MIMO, multi-user (MU) MIMO can further improve the system spectral efficiency due to increased multi-user diversity gain. MU-MIMO is preferred for the case of a large number of users,when the total feedback overhead will become a problem. In order to reduce the feedback overhead, feedback of single channel quality indicator (CQI), e.g. rank 1 CQI, is required in E-UTRA currently. The main challenge is how to obtain CQIs of other ranks at Node B for rank adaptation with single CQI feedback. In this paper, an adaptive CQI update scheme at Node B based on statistical characteristics of CQI of various ranks is proposed. To further increase the accuracy of CQI at Node B for data transmission, an adaptive CQI feedback scheme is then proposed in which single CQI with the rank same as previously scheduled is fed back. Simulation results show that our proposed CQI update scheme can achieve 2.5-5% gain compared with the conventional method with fixed backoff. Moreover, with the proposed adaptive feedback scheme, 20-40% performance gain can be obtained and the performance can approach the upper bound.

Several hardware-based pattern matching engines for network intrusion/prevention detection systems (NIDS/NIPSs) can achieve high throughput with less hardware resources. However, their flexibility to update new patterns is limited and still challenging. This paper describes a PAttern Matching Engine with Limited-time updAte (PAMELA) engine using a recently proposed hashing algorithm called Cuckoo Hashing. PAMELA features on-the-fly pattern updates without reconfiguration, more efficient hardware utilization, and higher performance compared with other works. First, we implement the improved parallel exact pattern matching with arbitrary length based on Cuckoo Hashing and linked-list technique. Second, while PAMELA is being updated with new attack patterns, both stack and FIFO are utilized to bound insertion time due to the drawback of Cuckoo Hashing and to avoid interruption of input data stream. Third, we extend the system for multi-character processing to achieve higher throughput. Our engine can accommodate the latest Snort rule-set, an open source NIDS/NIPS, and achieve the throughput up to 8.8 Gigabit per second while consuming the lowest amount of hardware. Compared to other approaches, ours is far more efficient than any other implemented on Xilinx FPGA architectures.

The use of cross-polarized antennas for multiple-input multiple-output (MIMO) systems is receiving attention as they are able to double the number of antenna for half antenna spacing needs. This paper presents the channel correlation property of the 3rd Generation Partner Project (3GPP)/3GPP2 spatial channel model (SCM) with the polarization propagation. The statistical average of the per path polarization correlation given random cross-polarization discrimination (XPD) with co-located ideal tilted dipole antennas is derived. The impact on the random behavior of the polarization correlation due to the slant offset angle, the per path angular spread (AS), and the random XPD is analyzed. The simulation results show that the variation of polarization correlation caused by the random XPD is maximized with a 58 slant offset angle under the assumptions of all predefined scenarios in SCM. The per path AS has minor impact on the statistics of the polarization correlations. The randomness of polarization correlation is negligible for an XPD with small standard deviation.

With the growth of wireless computing and the popularity of eXtensible Markup Language (XML), wireless XML data management is emerging as an important research area. In this paper, cache invalidation methodology with XML update is addressed in wireless computing environments. A family of XML cache invalidation strategies, called S-XIR, D-XIR and E-XIR, is suggested. Using S-XIR and D-XIR, the unchanged part of XML data, only its structure changes, can be effectively reused in client caching. E-XIR, which uses prefetching, can further improve access time. Simulations are carried out to evaluate the proposed methodology; they show that the proposed strategies improve both tuning time and access time significantly. In particular, the proposed strategies are on average about 4 to 12 times better than the previous approach in terms of tuning time.

A Policy-based Network Management (PBNM) in Mobile Ad-hoc Networks (MANETs) should be efficient and reliable. In this letter, we propose a mechanism for the policy-based management in ad hoc networks and we discuss methods to discover the Policy Decision Point (PDP), set the management area, and manage the movements of nodes in the PBNM system. Finally, we assess the results through simulations.

An adaptive algorithm to optimize the packet size in wireless mobile networks with Gauss-Markov mobility is presented. The proposed control algorithm conducts adaptive packet size control for mobile terminals that experience relatively fast changing channel conditions, which could be caused by fast mobility or other rapidly changing interference conditions. Due to the fast changing channel conditions, the packet size controller uses short channel history for channel status estimation and takes advantage of a pre-calculated probability density function (PDF) of the distance of the mobile nodes in the estimation process. The packet size is adapted to maximize the communication performance through automatic repeat request (ARQ). The adaptive packet size controlling algorithm is based on an estimation of the channel error rate and the link statistics obtained from the mobility pattern. It was found that the distribution of the link distance among mobile nodes following the Markov-Gauss mobility pattern in a circular communication range well fits the Beta PDF. By adapting the Beta PDF from the mobility pattern, the results show that it is possible to estimate the channel condition more accurately and thereby improve the throughput and utilization performance in rapidly changing wireless mobile networking systems.

We propose a stereo transmission technique using infrared rays and pulse density modulation (PDM) for digital wireless audio headphone systems. The main feature of the proposed technique is the use of two channels for transmission: the PDM data channel and the synchronized clock channel. This technique improves receiver characteristics to a noise floor of -80 dB and a second distortion of 62 dB and achieves a very low power consumption of 3.5 mW.