• Bulletin of the Korean Chemical Society
• /
• v.25 no.5
• /
• pp.747-750
• /
• 2004

• BMB Reports
• /
• v.43 no.2
• /
• pp.69-78
• /
• 2010

Asymmetric cell division is a fundamental mechanism for the generation of body axes and cell diversity during early embryogenesis in many organisms. During intrinsically asymmetric divisions, an axis of polarity is established within the cell and the division plane is oriented to ensure the differential segregation of developmental determinants to the daughter cells. Studies in the nematode Caenorhabditis elegans have contributed greatly to our understanding of the regulatory mechanisms underlying cell polarity and asymmetric division. However, much remains to be elucidated about the molecular machinery controlling the spatiotemporal distribution of key components. In this review we discuss recent findings that reveal intricate interactions between translational control and targeted proteolysis. These two mechanisms of regulation serve to carefully modulate protein levels and reinforce asymmetries, or to eliminate proteins from certain cells.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7C
• /
• pp.726-734
• /
• 2005

Traditional watermarking technologies are symmetric method which embedding and detection keys are the same. Although the symmetric watermarking method is easy to detect the watermark, this method has weakness against to malicious attacks remove or modify the watermark information when the symmetric key is disclosure. Recently, the asymmetric watermarking method that has different keys to embed and detect is watched by several researchers as a next generation watermarking technology. In this paper, hybrid asymmetric watermarking algorithm is proposed. This algorithm is composed of correlation detection method and critical criteria method. Each method can be individually used to detect watermark from a watermarked content. Hybrid asymmetric detection is complement between two methods, and more feasible than when each method is used respectively, Private key and public key are generated by secure linear transformation and specific matrix. As a result, we have proved the proposed algorithm is secured than symmetric watermarking algorithms. This algorithm can expand to multi bits embedding watermark system and is robust to JPEG and JPEG2000 compression.

• Convergence Security Journal
• /
• v.16 no.6_1
• /
• pp.25-32
• /
• 2016

We can not respond asymmetric warfare effectively. The asymmetric operation is performed in asymmetric methods and means with different characteristics and functions to their enemy. And the character of the asymmetric operation have 'heterogeneity' and 'superiority' in principle. The type of asymmetric strategy is complex and diverse. Since we can classify the type of the asymmetric strategy in many different way and we must study in many ways and aspects. When we study asymmetric war previous cases from modern to ancient era, we can find that the key factors of the victory have superiority of the asymmetric strategy and discriminatory measures. The asymmetry is created when one party has to adapt to the strategic environment. If we want to secure a strategic advantage, we must take a number of case studies and countermeasures for asymmetric warfare.

• Journal of the Optical Society of Korea
• /
• v.19 no.6
• /
• pp.592-603
• /
• 2015

In this paper, an optical implementation of a novel asymmetrical cryptosystem combined with D-H secret key sharing and triple DES is proposed. The proposed optical cryptosystem is realized by performing free-space interconnected optical logic operations such as AND, OR and XOR which are implemented in Mach-Zehnder type interferometer architecture. The advantage of the proposed optical architecture provides dual outputs simultaneously, and the encryption optical setup can be used as decryption optical setup only by changing the inputs of SLMs. The proposed cryptosystem can provide higher security strength than the conventional electronic algorithm, because the proposed method uses 2-D array data, which can increase the key length surprisingly and uses 3DES algorithm, which protects against “meet in the middle” attacks. Another advantage of the proposed asymmetrical cryptosystem is that it is free to change the user’s two private random numbers in generating the public keys at any time. Numerical simulation and performance analysis verify that the proposed asymmetric cryptosystem is effective and robust against attacks for the asymmetrical cipher system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3046-3059
• /
• 1999

Kailar Accountability Logic proposed for the accountability analysis of communication protocols that require accountability and use asymmetric key digital signature is extended for protocols that use symmetric key digital signature. A proposed electronic micropayment protocol that uses symmetric key digital signature is analyzed to illustrate the use of the extend logic in detecting its lack f accountability and suggesting changes to enhance its accountability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4624-4640
• /
• 2017

This paper mainly presents a secure and efficient e-Medical Record System via searchable encryption scheme from asymmetric pairings, which could provide privacy data search and encrypt function for patients and doctors in public platform. The core technique of this system is an extension public key encryption system with keyword search, which the server could test whether or not the files stored in platform contain the keyword without leaking the information about the encrypted file. Compared with former e-medical record systems, the system proposed here has several superior features: (1)Users could search the data stored in cloud server contains some keywords without leaking anything about the origin data. (2) We apply asymmetric pairings to achieve shorter key size scheme in the standard model, and adopt the dual system encryption technique to reduce the scheme's secure problem to the hard Symmetric External Diffie-Hellman assumption, which could against the variety of attacks in the future complex network environment. (3) In the last of paper, we analyze the scheme's efficiency and point out that our scheme is more efficient and secure than some other classical searchable encryption models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1955-1971
• /
• 2013

This paper studies relay selection and power allocation for amplify-and-forward (AF) based two-way relay networks (TWRN) with asymmetric traffic requirements (ATR). A joint relay selection and power allocation algorithm is proposed to decrease the outage probability of TWRN with ATR. In this algorithm, two sources exchange information with the help of the relay during two time slots. We first calculate the optimal power allocation parameters based on instantaneous channel state information (CSI), and then derive a tight lower bound of outage probability. Furthermore, we propose a simplified relay selection criterion, which can be easily calculated as harmonic mean of instantaneous channel gains, according to the outage probability expressions. Simulation results verified the theoretical analyses we presented. It is shown that the outage probability of our algorithm improves 3-4dB comparing with that of other existing algorithms, and the lower bound is tight comparing with actual value for the entire signal-to-noise ratio (SNR) region.

• Journal of the Korean Chemical Society
• /
• v.58 no.2
• /
• pp.230-233
• /
• 2014

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.2
• /
• pp.39-44
• /
• 2020

In this paper, we show a modified Diffie-Hellman key exchange protocol that can exchange keys by exposing only minimal information using pre-computable session key pairs. The discrete logarithm problem, which provides the safety of existing Diffie-Hellman and Diffie-Hellman based techniques, is modified to prevent exposure of primitive root. We prove the algorithm's operation by applying the actual value to the proposed scheme and compare the execution time and safety with the existing algorithm, shown that the security of the algorithm is improved more than the product of the time complexity of the two base algorithms while maintaining the computation amount at the time of key exchange. Based on the proposed algorithm, it is expected to provide a key exchange environment with improved security.