In this paper, we introduce a new notion of conditional converge cast (CCC), by adding the conditional property to converge cast. A CCC protocol with predicate Q is a three-party protocol which involves two senders S0 and S1 and a receiver R. S0 owns a secret x and a message m0, so does S1 with y and m1. In a protocol, S0 and S1 send their messages to R in a masked form. R obtains the message depending on the value of Q(x,y), i.e. R obtains m0 if Q(x,y)=0, or m1 otherwise. The secrets, x and y, are not revealed to R or the other sender, and Q(x,y) is not revealed to S0 and S1. In addition to the formulation, we propose a concrete scheme for conditional converge cast with the "equality" predicate.
Min-Hang WENG Chang-Sin YE Cheng-Yuan HUNG Chun-Yueh HUANG
A novel dual mode bandpass filter (BPF) with improved spurious response is presented in this letter. To obtain low insertion loss, the coupling structure using the dual mode resonator and the feeding scheme using coplanar-waveguide (CPW) are constructed on the two sides of a dielectric substrate. A defected ground structure (DGS) is designed on the ground plane of the CPW to achieve the goal of spurious suppression of the filter. The filter has been investigated numerically and experimentally. Measured results show a good agreement with the simulated analysis.
Myung Ho YEO Young Soo MIN Kyoung Soo BOK Jae Soo YOO
In this paper, a novel cache conscious indexing technique based on space partitioning trees is proposed. Many researchers investigated efficient cache conscious indexing techniques which improve retrieval performance of in-memory database management system recently. However, most studies considered data partitioning and targeted fast information retrieval. Existing data partitioning-based index structures significantly degrade performance due to the redundant accesses of overlapped spaces. Specially, R-tree-based index structures suffer from the propagation of MBR (Minimum Bounding Rectangle) information by updating data frequently. In this paper, we propose an in-memory space partitioning index structure for optimal cache utilization. The proposed index structure is compared with the existing index structures in terms of update performance, insertion performance and cache-utilization rate in a variety of environments. The results demonstrate that the proposed index structure offers better performance than existing index structures.
Bandpass filters with broad bandwidth (up to 70%), very wide upper stopband (nearest spurious passband occurs up to five times of passband center frequency (f0)), good stopband rejection performance (better than -30-40 dB in the whole stopband region), and matching with the conventional low cost printed circuit board process with low dielectric constant substrates are proposed in this paper. The proposed filters are designed using parallel-coupled vertically installed planar stepped-impedance resonators (VIPSIRs), which adopt the inherent nature of very tight coupling of VIP coupled line and extremely high impedance of VIP line. The extremely tightly coupled line enables the proposed filters having very wide passband and the extremely high impedance of VIP line leads to extremely large low-to-high impedance ratio that pushes the nearest spurious passband up to 5f0. Both VIP coupled line and VIP high impedance line are analyzed and characterized by the design charts. The design procedures based on the design charts are verified by several experimental examples. The measured results agree very well with the simulated ones.
One method for achieving high-speed waveform digitizing uses time-interleaved A-D Converters (ADCs). It is known that, in this method, using multiple ADCs enables sampling at a rate higher than the sampling rate of the ADC being used. Degradation of the dynamic range, however, results from such factors as phase error in the sampling clock applied to the ADC, and mismatched frequency characteristics among the individual ADCs. This paper describes a method for correcting these mismatches using a digital signal processing (DSP) technique. This method can be applied to any number of interleaved ADCs, and it does not require any additional hardware; good correction and improved accuracy can be obtained simply by adding a little to the computing overhead.
Urara SHINMYO Minoru KURIBAYASHI Masakatu MORII Hatsukazu TANAKA
For the construction of a large fingerprinting system, conventional protocols need many computations to provide each fingerprinted contents to each user. In order to reduce the computational cost, we introduce a new concept of distributed providers in the fingerprinting protocol. Before a sale, our practical fingerprinting protocol using a concept of secure oblivious transfer is performed between a contents supplier and each provider. Then each provider obtains fingerprinted contents such that each bit of fingerprinting information is embedded in each segment of the contents. When a user orders some contents to the supplier, each segment of the contents is distributed from each provider specified by the supplier. The selection of providers who distribute the segments of contents is executed based on the user's identity so that the sequence of embedded bits in the collected segments may indicate the user's identity.
Hung-Wei WU Min-Hang WENG Yan-Kuin SU Cheng-Yuan HUNG Ru-Yuan YANG
This investigation proposes a modified equivalent circuit of single complementary split-ring resonator (CSRR) in planar transmission media and a dual-mode ring bandpass filter (BPF) that uses periodic CSRRs to suppress the spurious response. The proposed modified equivalent circuit consists of lumped elements that can be easily extracted from the measured S parameters. The proposed dual-mode ring BPF has exhibits a wide stopband characteristic owing to the bandgap resonant characteristic of CSRRs in the harmonic frequency of the dual-mode ring BPF. Good agreement with EM simulation and measurement is demonstrated.
Hung-Wei WU Min-Hang WENG Yan-Kuin SU Ru-Yuan YANG Cheng-Yuan HUNG
This paper proposes a parallel coupled microstrip bandpass filter (BPF) with ring Electromagnetic Bandgap (EBG) cells on the middle layer for spurious suppression. The ring EBG cells of the middle layer add a good stopband-rejection mode to the second harmonics of the parallel coupled microstrip BPF with suppression of over -50 dB, without affecting the center frequency and insertion loss of the original designed BPF. The design of ring EBG cells is presented and verified by the experimented results.
Ramesh K. POKHAREL Kouji WADA Osamu HASHIMOTO Takeshi TAKAHASHI
Characteristics of a class of stepped-impedance resonators (SIRs) which is loaded with two dielectric rods, are investigated by a Finite-Difference Time-Domain (FDTD) method. Dielectric rods to be inserted between a strip conductor and the ground plane have higher relative permittivity than that of the substrate. When a tapped half-wavelength (λ/2) microstrip resonator is loaded with two dielectric rods, the electric length of a loaded λ/2 resonator becomes longer than λ/2, which makes its fundamental resonant frequency () to be generated on the region lower than that of an unloaded λ/2 resonator (fr) and its first spurious response (fsp1) is generated on the region higher than 2. Therefore, to shift back to fr, the resonator's length is to be reduced, and this, in turns, suppress the spurious responses. Then, the resonant characteristics of an SIR employing the proposed method has also been investigated, and it is found that this is capable of suppressing the spurious responses in wideband together with an attenuation pole in the stopband, and of further reducing the resonator's length. Therefore, wide exploitation of the presented method can be expected in the filter design based on the LTCC technique.
The Oblivious Transfer (OT), introduced by Rabin in 1981, has become an important and fundamental cryptography technique. An OT protocol should have two important characteristics: the sender's privacy and the chooser's privacy. The sender is a party who will deliver a secret to the chooser. The chooser is another party who acts as receiver to learn some information about the input from the sender. The chooser learns of certain information concerning the sender's input while the sender is not allowed to know what the chooser has learned. Moreover, the chooser cannot acquire any messages that he/she did not choose. Naor and Pinkas have recently proposed an efficient oblivious transfer protocol (EOT) that implementes 1-out-of-n protocol, but this EOT has a flaw: it cannot withstand "the same message attack." In this paper, we will improve Naor and Pinkas EOT and make it resistant to "the same message attack."
JaeGwi CHOI Goichiro HANAOKA KyungHyune RHEE Hideki IMAI
Digital fingerprinting schemes are cryptographic methods deterring buyers from illegally redistributing digital contents. It enables sellers to identify the traitor by providing each buyer with a slight different version. What is important in designing fingerprinting scheme is to make it more practical and efficient. Recently, two oblivious transfer protocol-based schemes to consider practicality were proposed. These are significant in the sense that they are completely specified from a computation point of view and are thus readily implementable. But these schemes cannot offer the security of sellers and buyers. In this paper, we show how to break the existing oblivious transfer-based fingerprinting schemes and then suggest how to make secure fingerprinting schemes against the dishonesty of sellers and buyers. We use oblivious transfer protocol with two-lock cryptosystem to make it practical and secure. All computations are performed efficiently and the security degree is strengthened in our proposal.
Jaewon LEE Seong-Min HONG Hyunsoo YOON
The mobile agent paradigm is a promising technology to structure distributed applications. Since mobile agents physically move to a remote host that is under the control of a different principal, they need to be protected from this environment which is responsible for execution. In this paper, we provide a new cryptographic methodology of protecting mobile agents from unauthorized modification for the program code by malicious hosts.
Kouji WADA Ramesh K. POKHAREL Takanobu OHNO Osamu HASHIMOTO
In a partially coupled-line bandpass filter (BPF), a combination of two microstrip line resonators which are partially coupled, are considered, where one resonator is half-wavelength (λ/2)-long, and another whose one end is grounded, is only quarter-wavelength (λ/4)-long. Therefore, the length of a coupled-line section can be varied based on the position of the grounding end, and five conditions of the movable coupling length have been simulated which will greatly influence the spurious responses of a BPF. This property is numerically investigated in this paper. The analysis shows that, based on the grounding position, this method is capable of realizing the improved out-of-band characteristics by locating the multiple attenuation poles in the stopband and improved spurious responses up to five times of the center frequency (5f0). A few empirical models of BPF are fabricated, and the numerical results are ensured by comparing with the experimental results.
Ting-Yi CHANG Chou-Chen YANG Chia-Meng CHEN
Recently, the integration of wired and wireless networks has become an interesting issue. The introduction of extending Mobile IP to mobile ad hoc networks not only helps the mobile nodes connect to the Internet but also broadens the scope of the ad hoc networks and increases their application. However, these hybrid schemes faces several security problems from the inherent weakness of ad hoc routing. In this paper, we propose a hybrid authentication scheme of Mobile IP assistance for ad hoc routing security. The regular Mobile IP registration scheme has been refined to an ad hoc key-aided version and now incorporates a novel routing packet authentication mechanism in the ad hoc routing operation. A distinct character of this hybrid scheme is that a Mobile Agent can form a secure ad hoc network where the mobile hosts can be authorized and authenticated by the refined Mobile IP registration scheme. In these findings, we shall propose that the mobile hosts can follow a novel routing packet authentication mechanism to secure the routing packets by using the cryptography of the simple geometric properties of lines. Since the novel routing authentication mechanism does not need digital signatures for completing the routing packet integrity, in this hybrid authentication scheme, the cryptographic computation cost on the mobile hosts' side is relatively minimized.
This paper reviews the approximation principle of Physical Optics in view of diffraction theory. Two key error factors are identified for PO, that is, 1) errors in edge diffraction coefficients and 2) fictitious penetrating rays. Improved methods named PO-AF and PTD-AF are proposed as the methods which suppress the fictitious penetrating rays from PO and PTD respectively. In deep shadow regions of the reflector antennas, PO-AF and PDT-AF approach to PO-EEC and UTD respectively, while the continuity is assured. The effectiveness is numerically demonstrated for two dimensional scatterers.
It is important to predict serious deterioration of telecommunication quality. This paper investigates predicting such serious events by analyzing only a "short" period (i.e., a "small" amount) of teletraffic data. To achieve this end, this paper presents a method for analyzing the tail distributions of teletraffic state variables, because tail distributions are suitable for representing serious events. This method is based on Extreme Value Theory (EVT), which provides a firm theoretical foundation for the analysis. To be more precise, in this paper, we use throughput data measured on an actual network during daily busy hours for 15 minutes, and use its first 10 seconds (known data) to analyze the tail distribution. Then, we evaluate how well the obtained tail distribution can predict the tail distribution of the remaining 890 seconds (unknown data). The results indicate that the obtained tail distribution based on EVT by analyzing the small amount of known data can predict the tail distribution of unknown data much better than methods based on empirical or log-normal distributions. Furthermore, we apply the obtained tail distribution to predict the peak throughput in unknown data. The results of this paper enable us to predict serious deterioration events with lower measurement cost.
Ramesh K. POKHAREL Kouji WADA Osamu HASHIMOTO Takeshi TAKAHASHI
This paper presents a new method to improve the resonant characteristics of a microstrip resonator. The improved characteristics have been achieved by inserting two dielectric rods between strip conductor and the ground plane. Dielectric rods to be inserted have higher relative permittivity than that of the substrate. Therefore, it is suitable to realize by Low-Temperature Cofired Ceramics (LTCC) technique. Several model of microstrip resonators employing the proposed method are analyzed by a Finite-Difference Time-Domain (FDTD) method, and their resonant characteristics are discussed. One of the advantages of the proposed method is that an attenuation pole (fl or fh) in each side of the fundamental resonant frequency (fr) and improved-spurious responses can be realized together by a capacitive-coupling tapped resonator loaded with dielectric rods. The proposed method is also effective to achieve sharp skirt characteristics and wide stopband of a direct-coupling tapped resonator which can be used either as a wideband lowpass filter or a band-elimination filter. Another interesting feature of the analyzed resonators is that about 60% reduction in resonator's length has been obtained compared to a basic half-wavelength (λ/2) microstrip resonator. Therefore, wide exploitation of the proposed method can be expected in the filter design based on the LTCC technique.
Tetsu SHIJO Takayoshi ITOH Makoto ANDO
High frequency (HF) diffraction is known as local phenomena, and only parts of the scatterer contribute to the field such as the edge, corner and specular reflection point etc. Many HF diffraction techniques such as Geometrical Theory of Diffraction (GTD), Uniform Theory of Diffraction (UTD) and Physical Theory of Diffraction (PTD) utilize these assumptions explicitly. Physical Optics (PO), on the other hand, expresses the diffraction in terms of radiation integral or the sum total of contributions from all the illuminated parts of scatterers, while the PO currents are locally defined at the point of integration. This paper presents PO-based visualization of the scattering and diffraction phenomena and tries to provide the intuitive understanding of local property of HF diffraction as well as the relations between PO and the ray techniques such as GTD, UTD etc. A weighting named "eye function" is introduced in PO radiation integrals to take into account of local cancellation between rapidly oscillating contributions from adjacent currents; this extracts important areas of current distribution, whose location moves not only with the source but also with the observation point. PO visualization illustrates both local property of HF scattering and defects associated with ray techniques. Furthermore, careful examination of visualized image reminds us of the error factor in PO as applied for curved surfaces, named fictitious penetrating rays. They have been scarcely recognized if not for visualization, though they disturb the geometrical shadow behind the opaque scatterer and can be the leading error factors of PO in shadow regions. Finally, visualization is extended to slot antennas with finite ground planes by hybrid use of modified edge representation (MER) to assess the significance of edge diffraction.
Many oblivious transfer (OT) protocols have been proposed, however, most of them the security is assured in the random oracle model. Naor and Pinkas proposed 1-out-of-n OT which does not need random oracles. In this paper, we extend the 1-out-of-n OT to k-out-of-n OT protocol. Our protocol is efficient in the sense of both communication complexity and computation complexity.
An efficient scheme is proposed which achieves the oblivious transfer with probabilistic receipt, α-OT, approximately for 0 < α < 1. The proposed scheme approximates α-OT with 2-i-OT for i = 1,2,...,k. It implements γ-OT for some γ such that (α - 2-k) / (1 - 2-k) < γ α with - log (1 - α) invocations of 2-1-OT and at most 2 invocations of 2-i-OT for each i = 2,...,k. These invocations can be executed in parallel.