• Title/Summary/Keyword: Key message

Search Result 493, Processing Time 0.02 seconds

The Binding Update Method using Delegation of Rights in MIPv6 (MIPv6에서 권한위임을 이용한 위치수정 방안)

  • 이달원;이명훈;황일선;정회경;조인준
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.6
    • /
    • pp.1194-1203
    • /
    • 2004
  • The RR protocole, proposed in IETF mip6 WG and standardized by RFC 3775 at lune 2004, send a message 'Binding Update' that express MN's location information to CN safety and update location information. Standard RR protocole has some problems with initiating the protocol by the MN; it causes to increases in communication load in the home network, to increases communication delay between MN and CN. Also, is connoting vulnerability to against attacker who are on the path between CN and HA in security aspect. This paper proposes doing to delegate MN's location information update rights by HA new location information update method. That is, When update MN's location information to HA, Using MN's private key signed location information certificate use and this certificate using method that HA uses MN's location information at update to CN be. It decreases the route optimization overhead by reducing the number of messages as well as the using location information update time. Also, remove security weakness about against attacker who are on the path between CN and HA.

Mutual Authentication Protocol using One Time Password for Mobile RFID System (OTP를 이용한 모바일 RFID 상호인증 프로토콜)

  • Sung, Jong-Yeop;Lee, Sang-Duck;Ryu, Chang-Ju;Han, Seung-Jo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1634-1642
    • /
    • 2014
  • Mobile RFID system, that consists of the existing RFID reader mounted on the mobile devices such as smartphones, is able to provide the users a variety of services and convenience. But security of mobile RFID system is too weak like the existing RFID system. In this paper, the mobile RFID mutual authentication protocol with high level of security is proposed to overcome the troubles such as cryptographic protocols in the existing RFID system responding with the same value in every authentication procedure and the exposure in the exchange of messages. The proposed protocol exchanges messages unexposed by using the random numbers generated in the mutual authentication between the tag and the reader and making numbers coded with the symmetric key. Besides, the protocol uses the mutual authentication utilizing OTP by considering the characteristics of the reader embedded in mobile devices in the mutual authentication process between the reader and the server. Because changed message in every authentication, which produces safe from spoofing attacks and replay attacks, etc.

Improved variable bits M-ary QT conflict resolution algorithm for discrete m-bits recognition in RFID system (RFID 시스템에서 불연속 m-bits 인식을 위한 개선된 가변비트 M-ary QT 충돌해소 알고리즘)

  • Kim, Kwan-woong;Kim, Byun-gon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.10
    • /
    • pp.1887-1894
    • /
    • 2016
  • In the RFID system, the reader transmits a query message to tags in order to identify a unique ID of tags within its detection range. The procedures for arbitrating a collision is essential because the multiple tags can response simultaneously in the same to the query of the Reader. This procedure is known as conflict resolution algorithm and it is a key technology in the RFID system. In this paper, we proposed a variable bits M-ary QT algorithm based on Manchester coding techniques. The proposed algorithm use the location information of the collision bits in the reader and tags. The proposed algorithm can reduce the number of the query-response cycle because it is capable of recognizing discontinuous bits and a variable number of bits. From computer simulation, the proposed method give better performance than the conventional M-ary QT techniques in terms of response, recognition efficiency, communication overhead.

Chameleon Hash-Based Mutual Authentication Protocol for Secure Communications in OneM2M Environments (OneM2M 환경에서 안전한 통신을 위한 카멜레온 해쉬 기반의 상호인증 프로토콜)

  • Kim, Sung-soo;Jun, Moon-seog;Choi, Do-hyeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.10
    • /
    • pp.1958-1968
    • /
    • 2015
  • Things intelligence communication (M2M or IoT) service activation and global company of OneM2M-related business on aggressive investing and has led to the acceleration of change in the ICT market. But a variety of hacking security technology because of the possibility of secure communication (data exposure, theft, modification, deletion, etc.) has been issued as an important requirement. In this paper, we propose a mutual authentication protocol for secure communications chameleon hash based on the M2M environment. The results of performance analysis efficiency is encryption and decryption an average of 0.7%, calculated rate showed good results as compared to the target algorithm, equivalent to a 3%(Average 0.003 seconds) difference, mutual authentication and encryption region by using the key update advantage of ECC(Elliptic Curve Cryptography)based Chameleon hash function is signed of the operational efficiency, using a collision message verifiable properties demonstrated strong security of the communication section.

An Analysis for the Efficient Dissemination of Beacon Messages in Vehicle-to-Vehicle (V2V) Communications (자동차 간 통신에서 비컨 메시지의 효율적인 방송을 위한 성능 분석)

  • Nguyen, Hoa-Hung;Bhawiyuga, Adhitya;Jeong, Han-You
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6C
    • /
    • pp.483-491
    • /
    • 2012
  • In vehicle-to-vehicle (V2V) communications, each vehicle should periodically disseminate a beacon message including the kinematics information, such as position, speed, steering, etc., so that a neighbor vehicle can better perceive and predict the movement of the vehicle. However, a simple broadcasting of such messages may lead to a low reception probability as well as an excessive delay. In this paper, we attempt to analyze the impact of the following key parameters of the beacon dissemination on the performance of vehicular networks: beacon period, carrier-sensing range, and contention window (CW) size. We first derive a beacon period which is inversely proportional to the vehicle speed. Next, we mathematically formulate the maximum beacon load to demonstrate the necessity of the transmit power control. We finally present an approximate closed-form solution of the optimal CW size that leads to the maximum throughput of beacon messages in vehicular networks.

Authentication Method based on AAA to Traverse the VPN Gateway in Mobile IPv4 (Mobile IPv4에서 VPN 게이트웨이 통과를 위한 AAA 기반의 인증 방법)

  • Kim, Mi-Young;Mun, Young-Song
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4B
    • /
    • pp.191-199
    • /
    • 2007
  • Mobile node has to register its current location to Home Agent when it moves to another network while away from home. However, the registration procedure cannot be completed successfully when Home Agent is protected by the VPN gateway which guards MN's home network and discards the unauthorized packets incoming from outside as a lack of security association(SA) between the Care-of address and security policy of the home network so that the binding registration message without SA is discarded smoothly by the VPN gateway. This paper presents the authentication and key exchange scheme using the AAA infrastructure for a user in Internet to access the home network behind the VPN gateway. By defining the role of authentication and tunnel processing for each agent or relay entity, this paper presents the procedure to register the current location to its Home Agent with secure manner. Performance result shows cost improvement up to 40% comparing with existing scheme in terms of the packet loss cost, the property of mobility and traffic.

A Study on the Aesthetic Characteristics of the Dance Costume of Jean Paul Gaultier (장 폴 고티에 무용의상의 조형성에 관한 연구)

  • Han, Kyeng-Ha;Geum, Key-Sook
    • Journal of the Korean Society of Costume
    • /
    • v.60 no.9
    • /
    • pp.1-15
    • /
    • 2010
  • Fashion designer Jean Paul Gaultier incorporated his own boundless and unique artistic Into his design of dance costumes, presenting an unobstructed imaginary world that was filled with freedom, which is no less than one would expect from the one-time enfant t${\'{e}}$rrible of Paris fashion. This creativity of Gaultier was made possible only through the fantastic partnership he formed with the French modern dancer, R${\'{e}}$gine Chopinot. Gaultier and Chopinot shared a deep-rooted sympathy that enabled their own artistic worlds to fully mingle and cross over, resulting in a doubled synergy of their talent and their fame. This study analyzed 11 dancing costumes created through the collaborated efforts of those two enfants t${\'{e}}$rribles, one from the fashion industry and the other from the world of dance. The following are the results of my analysis. Gaultier's dance costumes served as a artistic venue for experimenting with a number of creative inspirations lurking in his mind, which were sometimes expressed in pr${\^{e}}$t-${\`{a}}$-porter collections. Instead of the decorative and expressive features of conventional dance costumes, his was the revival of the dancer's persona as a human being, ablaze with individuality and uniqueness. He pointed out that there is no good in the distorted turturro's fixed point of view, and the great joy of an opposing way of thinking that overturned the established. Leotard material was used as a second skin by transforming it into various styles and delivering his message. In addition, obscene and sexual expressions were delivered in a direct narrative. His eccentric ideas provided entertainment while showing his oppositional way of thinking. In the dance, the effect of the costumes was doubled by the use of cumbersome and exaggerated accessories, which is generally forbidden in modern dance.

3D Medical Image Data Watermarking Applied to Healthcare Information Management System (헬스케어 정보 관리 시스템의 3D 의료영상 데이터 다중 워터마킹 기법)

  • Lee, Suk-Hwan;Kwon, Ki-Ryong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11A
    • /
    • pp.870-881
    • /
    • 2009
  • The rapid development of healthcare information management for 3D medical digital library, 3D PACS and 3D medical diagnosis has addressed security issues with medical IT technology. This paper presents multiple 3D medical image data for protection, authentication, indexing and diagnosis information hiding applied to healthcare information management. The proposed scheme based on POCS watermarking embeds the robust watermark for doctor's digital signature and information retrieval indexing key to the distribution of vertex curvedness and embeds the fragile watermark for diagnosis information and authentication reference message to the distance difference of vertex. The multiple embedding process designs three convex sets for robustness, fragileness and invisibility and projects 3D medical image data onto three convex sets alternatively and iteratively. Experimental results confirmed that the proposed scheme has the robustness and fragileness to various 3D geometric and mesh modifiers at once.

VLIS Design of OCB-AES Cryptographic Processor (OCB-AES 암호 프로세서의 VLSI 설계)

  • Choi Byeong-Yoon;Lee Jong-Hyoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1741-1748
    • /
    • 2005
  • In this paper, we describe VLSI design and performance evaluation of OCB-AES crytographic algorithm that simulataneously provides privacy and authenticity. The OCB-AES crytographic algorithm sovles the problems such as long operation time and large hardware of conventional crytographic system, because the conventional system must implement the privancy and authenticity sequentially with seqarated algorithms and hardware. The OCB-AES processor with area-efficient modular offset generator and tag generator is designed using IDEC Samsung 0.35um standard cell library and consists of about 55,700 gates. Its cipher rate is about 930Mbps and the number of clock cycles needed to generate the 128-bit tags for authenticity and integrity is (m+2)${\times}$(Nr+1), where m and Nr represent the number of block for message and number of rounds for AES encryption, respectively. The OCB-AES processor can be applicable to soft cryptographic IP of IEEE 802.11i wireless LAN and Mobile SoC.

An Improved Side Channel Attack Using Event Information of Subtraction (뺄셈연산의 이벤트 정보를 활용한 향상된 RSA-CRT 부채널분석공격 방법)

  • Park, Jong-Yeon;Han, Dong-Guk;Yi, Okyeon;Kim, Jung-Nyeo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.2
    • /
    • pp.83-92
    • /
    • 2013
  • RSA-CRT is a widely used algorithm that provides high performance implementation of the RSA-signature algorithm. Many previous studies on each operation step have been published to verify the physical leakages of RSA-CRT when used in smart devices. This paper proposes SAED (subtraction algorithm analysis on equidistant data), which extracts sensitive information using the event information of the subtraction operation in a reduction algorithm. SAED is an attack method that uses algorithm-dependent power signal changes. An adversary can extract a key using differential power analysis (DPA) of the subtraction operation. This paper indicates the theoretical rationality of SAED, and shows that its results are better than those of other methods. According to our experiments, only 256 power traces are sufficient to acquire one block of data. We verify that this method is more efficient than those proposed in previously published studies.