• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2534-2553
• /
• 2020

Recently, numerous certificateless encryption (CLE) schemes have been introduced. The security proofs of most schemes are given under the random oracle model (ROM). In the standard model, the adversary is able to calculate the hash function instead of asking the challenger. Currently, there is only one scheme that was proved to be secure in SM. In this paper, we constructed a new CLE scheme and gave the security proofs in SM. In the new scheme, the size of the storage space required by the system is constant. The computation cost is lower than other CLE schemes due to it needs only two pairing operations.

• IEMEK Journal of Embedded Systems and Applications
• /
• 제5권2호
• /
• pp.93-102
• /
• 2010

The FMCW(Frequency Modulation Continuous Wave) radar possesses range-velocity ambiguity to identify the correct combination of beat frequencies for each target in the multi-target situation. It can lead to ghost targets and missing targets, and it can reduce the detection probability. In this pap er, we propose an effective identification algorithm for the correct pairs of beat frequencies and the signal processing hardware architecture to effectively support the algorithm. First, using the correlation of the detected up- and down-beat frequencies and Doppler frequencies, the possible combinations are determined. Then, final pairing algorithm is completed with the power spectrum density of the correlated up- and down-beat frequencies. The proposed hardware processor has the basic architecture consisting of beat-frequency registers, pairing table memory, and decision unit. This method will be useful to improve the radar detection probability and reduce the false alarm rate.

• IE interfaces
• /
• 제22권3호
• /
• pp.263-277
• /
• 2009

This research deals with a task assignment problem to worker group which consists of one master and one assistant. Each task must be assigned to only one worker group and it is possible to make a pair of each master and each assistant to organize a worker group. A worker group may have more than one task assigned to it, but the workloads of each worker group must be balanced within the allowable range. This problem can be formulated mathematically using the Mixed Integer Programming(MIP), where the objective function is to minimize the total assignment cost. A two phase heuristic algorithm is suggested in order to find approximate solutions. The first phase is to obtain an initial solution, where the initial assignment is performed to follow the workload adjustment. In the second phase, the solution is improved through the repeated process of the exchange and the assignment adjustment. Numerical experiments have been performed to evaluate the performance of the heuristic algorithm.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 한국정보보호학회 2003년도 하계학술대회논문집
• /
• pp.37-42
• /
• 2003

Threshold signature and blind signature are playing important roles in cryptography as well as practical applications such as e-cash and e-voting systems. In this paper, we present a new threshold blind digital signature based on pairings without a trusted third party. Our scheme operates on Gap Diffie-Hellman group, where Computational Diffie-Hellman problems are hard but Decision Diffie-Hellman problems are easy. For example, we use pairings that could be built from Weil pairing or Tate pairing. To the best of our knowledge, we claim that our scheme is the first threshold blind signature using pairings with provable security in the random oracle model.

• Progress in Superconductivity
• /
• 제1권2호
• /
• pp.85-88
• /
• 2000

The temperature dependent Josephson critical current $J_c(T)/J_c(0)$ between high $T_c$ superconductors along the a-axis is theoretically studied. The interface influence on the wave functions of quasi-particles is included in the theory within the framework of the two-dimensional t-J model. It is found that the experimental results can be satisfactorily explained by the present model with d wave pairing symmetry.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.881-896
• /
• 2016

Certificate-based cryptography is a useful public key cryptographic primitive that combines the merits of traditional public key cryptography and identity-based cryptography. It not only solves the key escrow problem inherent in identity-based cryptography, but also simplifies the cumbersome certificate management problem in traditional public key cryptography. In this paper, by giving a concrete attack, we first show that the certificate-based encryption scheme without bilinear pairings proposed by Yao et al. does not achieve either the chosen-ciphertext security or the weaker chosen-plaintext security. To overcome the security weakness in Yao et al.'s scheme, we propose an enhanced certificate-based encryption scheme that does not use the bilinear pairings. In the random oracle model, we formally prove it to be chosen-ciphertext secure under the computational Diffie-Hellman assumption. The experimental results show that the proposed scheme enjoys obvious advantage in the computation efficiency compared with the previous certificate-based encryption schemes. Without costly pairing operations, it is suitable to be employed on the computation-limited or power-constrained devices.

• Convergence Security Journal
• /
• 제8권2호
• /
• pp.1-6
• /
• 2008

Designing efficient and secure electronic payment is important for M-Commerce. In this paper, we propose an efficient Micro-payment protocol that allows multiple transactions using ID-based public key encryption-system. The proposed payword system requires to generate authenticated key generated by Weil-pairing which uses an elliptic curve cryptosystem over finite field Fq for transactions. Therefore, it is more secure in known key attacks as well as man-in-the middle attacks.

• ETRI Journal
• /
• 제37권3호
• /
• pp.512-522
• /
• 2015

Recent developments in identity-based cryptography (IBC) have provided new solutions to problems related to the security of mobile ad hoc networks (MANETs). Although many proposals to solve problems related to the security of MANETs are suggested by the research community, there is no one solution that fits all. The interdependency cycle between secure routing and security services makes the use of IBC in MANETs very challenging. In this paper, two novel methods are proposed to eliminate the need for this cycle. One of these methods utilizes a key pool to secure routes for the distribution of cryptographic materials, while the other adopts a pairing-based key agreement method. Furthermore, our proposed methods utilize threshold cryptography for shared secret and private key generation to eliminate the "single point of failure" and distribute cryptographic services among network nodes. These characteristics guarantee high levels of availability and scalability for the proposed methods. To illustrate the effectiveness and capabilities of the proposed methods, they are simulated and compared against the performance of existing methods.

• Journal of Ocean Engineering and Technology
• /
• 제20권3호
• /
• pp.1-6
• /
• 2006

Modulation theory describes propagation of surface waves with deep wave number and frequency modulation. Locally spectrally narrow wave packet can have accumulated large scale frequency shift of carrier wave during propagation. Some important nonlinear modulation effects, such as negative frequencies, phase kinks, crest pairing, etc., often observed experimentally at long fetch propagation of finite amplitude surface wave trains, are reproduced by the proposed theory. The presented model permits also to analyze the appropriately short surface wave packets and modulation periods. Solutions show the wave phase kinks to arise on areas' of relatively small free surface displacement in complete accordance with the experiments.

• Journal of Information Processing Systems
• /
• 제10권1호
• /
• pp.92-102
• /
• 2014

In recent years, there has been growing interest in secure pairing, which refers to the establishment of a secure communication channel between two mobile devices. There are a number of descriptions of the various types of out-of-band (OOB) channels, through which authentication data can be transferred under a user's control and involvement. However, none have become widely used due to their lack of adaptability to the variety of mobile devices. In this paper, we introduce a new OOB channel, which uses accelerometer-based gesture input. The gesture-based OOB channel is suitable for all kinds of mobile devices, including input/output constraint devices, as the accelerometer is small and incurs only a small computational overhead. We implemented and evaluated the channel using an Apple iPhone handset. The results demonstrate that the channel is viable with completion times and error rates that are comparable with other OOB channels.