• Journal of Digital Convergence
• /
• v.14 no.10
• /
• pp.287-293
• /
• 2016

Wireless sensor networks (WSNs) have many applications and are deployed in a wide variety of areas. They are often deployed in potentially adverse or even hostile environment so that there are concerns on security issues in these WSNs. Recently, an anonymous user authentication and key agreement scheme (AUAKAS) was proposed based on symmetric cryptosystem in WSNs. It is claimed in AUAKAS that it assures security against different types of attacks including impersonation attacks. However, this paper shows that AUAKAS does not cope from user impersonation attack and gateway impersonation attack from the legally registered user on the gateway. The security analysis could guide the required features of the security scheme to be satisfied.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.344-365
• /
• 2020

Providing security has been always on priority in all areas of computing and communication, and for the systems that are low on computing power, implementing appropriate and efficient security mechanism has been a continuous challenge for the researchers. Radio Frequency Identification (RFID) system is such an environment, which requires the design and implementation of efficient security mechanism. Earlier, the security protocols for RFID based on hash functions and symmetric key cryptography have been proposed. But, due to high strength and requirement of less key size in elliptic curve cryptography, the focus of researchers has been on designing efficient security protocol for RFID based on elliptic curves. In this paper, an efficient elliptic curve signcryption based security protocol for RFID has been proposed, which provides mutual authentication, confidentiality, non-repudiation, integrity, availability, forward security, anonymity, and scalability. Moreover, the proposed protocol successfully provides resistance from replay attack, impersonation attack, location tracking attack, de-synchronization attack, denial of service attack, man-in-the-middle attack, cloning attack, and key-compromise attack. Results have revealed that the proposed protocol is efficient than the other related protocols as it takes less computational time and storage cost, especially for the tag, making it ideal to be used for RFID systems.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.641-652
• /
• 2002

In this paper, proposes Kerberos certification mechanism that improve certification service of PKINIT base that announce in IETF CAT Working Group. Bid to certificate other realm because search position of outside realm through DNS and apply X.509 directory certification system, acquire public key from DNS server by chain (CertPath) between realms by certification and Key exchange way that provide service between realms applying X.509, DS/DNS of PKINIT base. In order to provide regional services, Certification and key exchange between realms use Kerberos symmetric method and Session connection used Directory service to connection X.509 is designed using an asymmetric method. By efficient TGT (Ticket Granting Ticket) exchange and reusability of ticket, A Design of Kerberos system that have effect and simplification of certification formality that reduce overload on communication.

• Proceedings of the KAIS Fall Conference
• /
• 2007.05a
• /
• pp.199-202
• /
• 2007

In this paper, I suggest that as follow. First, it is the algorithm to transmit the encryption key which use ${\ast}$ N Puzzle method more safe than the existing One-path XOR method. Second, it does provide the high quality of security than the existing system because it does not save the generated puzzle to the setter side. Third, it does support the client decryption system which can decrypt the puzzle with OPT in decryption with client side. Fourth, it does adopt more of the safe tansmission method with the compound of ${\ast}$ N Puzzle method and OPT.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3576-3583
• /
• 2000

Digital watermarks have recently been proposed for the purposes of copyright ptotechtion and autheutication for multimedia contents. A watermarking technique consists of an algorithm that incorporates a watermarking structure into an image in the spatial or frequency domains. In this paper we proposed a new watermarking method for authentication and integrity of digital images and the proposed algorithm uses the MD5 hash funiction and a symmetric key encryption algorithm. To decide the position of embedding watermark and the bit pasitionin the original image, the secret key is used as an input of the MD5 hash function. The simulation results show that the proposed algorithm has the advantage of difficulty to find positions of inserted watermarks, and keep the similar watermarked image quabty with Wong's method.

• Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.248-252
• /
• 2015

Currently composite manufacturing process, such as linear friction welding plus NC machining, is the main method for the manufacturing and repairing of complex parts with integrated structure. Due to different datum position and inevitable distortion from different processes, it is important to ensure sufficient machining allowance for complex parts during the NC machining process. In this paper, a workpiece localization approach for machining allowance optimization of complex parts based on CMM inspection is developed. This technique concerns an alignment process to ensure sufficient stock allowance for the single parts as well as the whole integrated parts. The mathematical model of the constrained alignment is firstly established, and then the symmetric block solution strategy is proposed to solve the optimization model. Experiment result shows that the approach is appropriate and feasible to distribute the machining allowance for the single and whole parts for adaptive machining of complex parts.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.1241-1257
• /
• 2014

We consider a class of hypoelliptic operators of the following type $$L=\sum_{i,j=1}^{p_0}a_{ij}{\partial}^2_{x_ix_j}+\sum_{i,j=1}^{N}b_{ij}x_i{\partial}_{x_j}-{\partial}_t$$, where ($a_{ij}$), ($b_{ij}$) are constant matrices and ($a_{ij}$) is symmetric positive definite on $\mathbb{R}^{p_0}$ ($p_0{\leqslant}N$). By establishing global Morrey estimates of singular integral on the homogenous space and the relation between Morrey space and weak Morrey space, we obtain the global weak Morrey estimates of the operator L on the whole space $\mathbb{R}^{N+1}$.

• Proceedings of the Korea Technical Association of the Pulp and Paper Industry Conference
• /
• 2006.06b
• /
• pp.387-390
• /
• 2006

Cationic rosin sizes are prepared by premixing extremely pure ployaluminum chloride (PAC) and dispersed rosin size (DRS). It turned out that zeta potential and particle size of the sizing agents took a big change by Plus90 analyzer's and FTIR analyzer's analysis. It turned out that -C=O and -COOH of the DRS have both chemical reaction with PAC to form the muti-hydroxyl aluminum rosin acid and that the cationic rosin sizes modified by PAC has dissymmetric and symmetric flexible vibration two absorbing peaks of the groups (its absorbing peaks $at1596cm^{-1}\;and\;1425cm^{-1}$). By DRS reacting with PAC, zeta potential of the resin size varied from negative to cationic. $Al_{2}O_{3}/rosin=1:0.3$, zeta potential of premixed admixture is tiptop28.8mv, When joined continuously PAC, zeta potential of cationic rosin sizes descend on the contrary.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.151-153
• /
• 2005

무선 센서 네트워크는 방대한 응용분야와 유비쿼터스 환경 하에서 중요한 한 부분을 차지하며 그 유용성을 입증하고 있다. 이런 무선 센서 네트워크의 센서 노드는 작은 크기를 바탕으로 목표 장소에 임의로 배치되어 다양한 데이터를 수집하는 능력이 탁월하다 하지만 이런 장점은 센서 노드의 한정된 하드웨어 능력과 전원공급 문제, 물리적 노출 문제로 인해 스스로를 위험에 노출시키는 여지를 만들게 되었다. 즉 일반적으로 사용되어지는 네트워크 보안 방법을 무선 센서 네트워크에 적응하기에는 센서 노드 능력에 한계가 있으며, 환경적 요소로 인해 불가능하다. 따라서 무선 센서 네트워크의 특성을 감안한 효과적인 보안 방법이 필요하며, 이런 맥락에 본 논문은 무선 센서 네트워크의 하드웨어적인 한계를 감안한 대칭키(Symmetric key) 기반의 키 분배 기법을 제안하고자 한다. 제안하는 기법에서는 모든 노드가 공통으로 소유한 전체 마스터 키(master key)와 의사 난수 생성기(pseudo random number generator:PRNG), 그리고 특정 대상으로부터 분배되는 난수(random number)의 조합을 통해 임의의 키를 생성, 갱신함으로써 다양한 종류의 무선 센서 네트워크 모델에 유연하게 대처할 수 있도록 하였다. 또한 이를 위한 통신 회수를 최소화함으로써 효율성을 제공해 준다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.5
• /
• pp.43-52
• /
• 2001

Y. Zheng introduced a new type of cryptograghic primitive as \"signcryption\", which combines a function of digital signature scheme with a symmetric key encryption algorithm. Signcryption doesn\`t only provide authenticity and confidentiality in a single step, but also give more efficient computation than the traditional \"signature-then-encryption\". And C. Gamage proposed a proxy-signcryption that efficiently combines a proxy signature with the signcryption. But, in the proposed signcryption schemes, one who obtains the sender\`s private key can recover the original message of a signcrypted text. That is, forward secrecy is not offered by the signcryption scheme with respect to the sender\`s private key. In this paper, we will propose a modified signcryption of Zheng\`s signcryption and a variant of proxy-signcryption with forward secrecy.ith forward secrecy.