• Title/Summary/Keyword: ID4

Search Result 764, Processing Time 0.024 seconds

Unforgeable RFID Tag Variable ID Scheme with Efficient Identification (효율적인 식별 기능을 가진 위조 불가 RFID Tag 가변 ID 방식)

  • Choi, Jae-Gwi;Park, Ji-Hwan
    • The KIPS Transactions:PartC
    • /
    • v.11C no.4
    • /
    • pp.447-454
    • /
    • 2004
  • This paper proposes unforgeable RFID variable n scheme with efficient identification. The existing schemes on privacy protection are in efficient because a server should execute identification process with all Tag ID's Information in order to identify a certain Tag. Moreover these schemes have the serious problem that an attacker can forge special tags if he can know tag's secret information stored in the server's database. Our scheme Is required only 2 times exponent computation to identify a tag. The proposed scheme is also secure against leakage of tags information stored in a database, because an attacker cannot forge special tag even if he knows secret information of the server(database).

ON FACTORIZATIONS OF THE SUBGROUPS OF SELF-HOMOTOPY EQUIVALENCES

  • Shi, Yi-Yun;Zhao, Hao
    • Journal of the Korean Mathematical Society
    • /
    • v.45 no.4
    • /
    • pp.1089-1100
    • /
    • 2008
  • For a pointed space X, the subgroups of self-homotopy equivalences $Aut_{\sharp}_N(X)$, $Aut_{\Omega}(X)$, $Aut_*(X)$ and $Aut_{\Sigma}(X)$ are considered, where $Aut_{\sharp}_N(X)$ is the group of all self-homotopy classes f of X such that $f_{\sharp}=id\;:\;{\pi_i}(X){\rightarrow}{\pi_i}(X)$ for all $i{\leq}N{\leq}{\infty}$, $Aut_{\Omega}(X)$ is the group of all the above f such that ${\Omega}f=id;\;Aut_*(X)$ is the group of all self-homotopy classes g of X such that $g_*=id\;:\;H_i(X){\rightarrow}H_i(X)$ for all $i{\leq}{\infty}$, $Aut_{\Sigma}(X)$ is the group of all the above g such that ${\Sigma}g=id$. We will prove that $Aut_{\Omega}(X_1{\times}\cdots{\times}X_n)$ has two factorizations similar to those of $Aut_{\sharp}_N(X_1{\times}\cdots{\times}\;X_n)$ in reference [10], and that $Aut_{\Sigma}(X_1{\vee}\cdots{\vee}X_n)$, $Aut_*(X_1{\vee}\cdots{\vee}X_n)$ also have factorizations being dual to the former two cases respectively.

VLC-based ESL system design for interference avoidance in 2.4GHz ISM band (2.4GHz ISM 대역의 간섭회피를 위한 VLC 기반 ESL 시스템 설계)

  • Lee, Sang-gwon;Oh, Chang-heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.05a
    • /
    • pp.636-637
    • /
    • 2018
  • The electronic shelf label(ESL) system based on wireless communication can reduce waste of disposable paper, reduce labor force and update real time information. However, the environment in which a large number of ESL modules are installed is exposed to interference from radio frequency(RF) communications in the Industry-Science-Medical(ISM) band. In this paper, we propose an ESL system based on visible light communication to avoid congestion of ESL system using ISM band. In the proposed system, the goods information and ID transmitted from the administrator server are transmitted in the ESL Tag, and the ESL Tag identifies the ID and displays the product information. Experiments show that ESL system using visible light communication is possible.

  • PDF

A Design of Hadoop Security Protocol using One Time Key based on Hash-chain (해시 체인 기반 일회용 키를 이용한 하둡 보안 프로토콜 설계)

  • Jeong, Eun-Hee;Lee, Byung-Kwan
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.4
    • /
    • pp.340-349
    • /
    • 2017
  • This paper is proposed Hadoop security protocol to protect a reply attack and impersonation attack. The proposed hadoop security protocol is consists of user authentication module, public key based data node authentication module, name node authentication module, and data node authentication module. The user authentication module is issued the temporary access ID from TGS after verifing user's identification on Authentication Server. The public key based data node authentication module generates secret key between name node and data node, and generates OTKL(One-Time Key List) using Hash-chain. The name node authentication module verifies user's identification using user's temporary access ID, and issues DT(Delegation Token) and BAT(Block Access Token) to user. The data node authentication module sends the encrypted data block to user after verifing user's identification using OwerID of BAT. Therefore the proposed hadoop security protocol dose not only prepare the exposure of data node's secret key by using OTKL, timestamp, owerID but also detect the reply attack and impersonation attack. Also, it enhances the data access of data node, and enforces data security by sending the encrypted data.

Establishment of Hanwoo(Korean Cattle, Bos taurus, Linn.) Traceability System Using Radio Frequency Identification(RF-ID) (전자식별칩(RF-ID)을 이용한 한우 생산이력추적시스템 도입)

  • Seo, K. S.;Kim, S.;Lee, J.G.;Sohn, Y.G.;Salces, A.J.;Choi, T.J.
    • Journal of Animal Science and Technology
    • /
    • v.50 no.1
    • /
    • pp.1-8
    • /
    • 2008
  • This study was conducted to develop a traceability system for systematic animal identifi- cation to increase efficiency of animal production, post production and processing to ensure that quality and sanitary meat products reach the consumers of the entire country. The new animal identification traceability system was designed for easy management, data collection and storage considering bar code, registration number and farm number.Specifically the system aimed 1) To provide standard radio frequency technology identification (RF-ID) for livestock management, standard of ear tag, microchip and ear tag identification equipment, 2) To guarantee meat product label thereby safeguarding the consumers 3) To give incentives to farmers for producing quality meat products and 4) To provide unified system for national livestock management.Results of the research which started in July 2003 which was used by several farmers’ cooperatives and Department Store revealed the feasibility of using the RF-ID system although much will be done to conform to global nomenclatures.

Can Auto-ID make Trade Stable between Korea and China?

  • Choi, Jae-Seob
    • The Journal of Information Technology
    • /
    • v.7 no.4
    • /
    • pp.119-127
    • /
    • 2004
  • As increasing trade through the world, especially in food, asymmetry of information can make the trade shrink. With the industrial development, Korea's agriculture had shrunk dramatically. By the result of the nation's industrial restructuring, over than 3/4 of Korea food consumption comes from abroad. And China is an important source of agricultural product to Korea. Increasing family income and increasing importing food consumption, Korean consumers have been interested in food safety. Especially. after experiencing several cases like struggle for safety of GMO food, poultry influenza, lead contained Chinese fish import, mad cow disease, cheating origin, etc. Obviously, those unreliable cases will hinder the increase of world free trade as well as the trust of two countries. Furthermore, distrust will be a cause of adverse selection. So, it need to find a way to solve the distrust which caused by asymmetry of information. And automatic identification procedures can help mitigate asymmetry of information in trade. And it will make Korean consumers can avoid adverse selection. This paper suggests adoption of Auto ID to encourage agricultural trade between Korea and China.

  • PDF

A Simple Cost Analysis of Host ID-LOC Separating protocol using SDN Features

  • Lee, Chan-Haeng;Choi, Chang-Won
    • Journal of Internet of Things and Convergence
    • /
    • v.2 no.4
    • /
    • pp.41-47
    • /
    • 2016
  • The IP address used in the Internet has the role of both identifier and locator to bind a host and the application, however, this binding restricts some functions such as mobility and multi-homing. As a result, we suggested a host ID-LOC separation protocol using DHT with SDN features. The proposed scheme is a network-based scheme, and uses IPv6 addresses. The underlying network is partitioned into Host Identity domain and IP domain for identifiers and locators. In this paper, we present a simple cost model for analyzing both the proposed scheme and one of the previous works, the MOFI. The result of cost analysis shows better performance of the proposed scheme.

Design and Implementation of a Simulation Framework for Wireless Data Broadcasting based on Data ID Space Partition

  • Im, Seokjin
    • International journal of advanced smart convergence
    • /
    • v.7 no.4
    • /
    • pp.10-18
    • /
    • 2018
  • For the information services supporting requests of data items from a great number of mobile clients, wireless data broadcasting is an effective way because it can accommodate any number of clients. In the wireless data broadcasting, various air indexing schemes and data scheduling schemes have been developed in order to enable the clients to access their desired data items efficiently. The broadcasting system needs a method to simulate newly designed air indexing and scheduling schemes of the system, and to evaluate the performance parameters of the schemes. In this paper, we design an expandable and efficient simulation framework for the wireless data broadcasting based on the partition of data ID space. The framework can adopt regular and irregular space partition and evaluate various performance parameters of the broadcasting system. We implement a testbed of the broadcasting system using the framework, that adopts IIP, GDI and EXP as its air indexing schemes. We simulate the system using the testbed and evaluate the performance parameters of the system. Thus, we show the efficiency and expandability of the designed and implemented framework.

Usefulness of four commonly used neuropathic pain screening questionnaires in patients with chronic low back pain: a cross-sectional study

  • Gudala, Kapil;Ghai, Babita;Bansal, Dipika
    • The Korean Journal of Pain
    • /
    • v.30 no.1
    • /
    • pp.51-58
    • /
    • 2017
  • Background: Recently symptoms-based screening questionnaires have gained attention for screening for a neuropathic pain component (NePC) in various chronic pain conditions. The present study assessed the usefulness of four commonly used NePC screening questionnaires including the Self-completed douleur neuropathique 4 (S-DN4), the ID Pain, the painDETECT questionnaire (PDQ), and the Self-completed Leeds Assessment of neuropathic Symptoms and Signs (S-LANSS) questionnaire in patients with chronic low back pain (CLBP) to assess the presence of NePC. Methods: This is a single-center cross-sectional study where patients with CLBP, with or without leg pain, were included. Participants were initially screened for NePC presence by a physician according to the regular practice, and later assessed using screening questionnaires. The diagnostic accuracy of these questionnaires was compared assuming the physician-made diagnosis as the gold standard. Results: A total of 215 patients with CLBP of which 164 (76.3%, 95% CI, 70.2-81.5) had a NePC were included. S-DN4, ID Pain, and PDQ have an area under the curve (AUC) > 0.8 indicating excellent discrimination. However, S-LANSS has an AUC of 0.69 (0.62-0.75), indicating low discrimination. S-DN4 has a significantly higher AUC as compared to ID Pain (d(AUC) = 0.063, P < 0.01) and S-LANSS (d(AUC) = 0.197, P < 0.01). But the AUC of S-DN4 does not significantly differ from that of PDQ (d(AUC) = 0.013, P = 0.62). Conclusions: S-DN4, ID Pain, and PDQ, but not S-LANSS, have good discriminant validity to screen for NePCs in patients with CLBP. Despite using all the tests, 20-30% of patients with an NePC were missed. Thus, these questionnaires can only be used as an initial clue in screening for NePCs, but do not replace clinical judgment.

The Design of RFID System using Group Separation Algorithm (Group Separation 알고리듬을 적용한 RFID system의 구현)

  • Ko, Young-Eun;Lee, Suk-Hui;Oh, Kyoung-Wook;Bang, Sung-Il
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.11
    • /
    • pp.25-32
    • /
    • 2007
  • In this paper, we propose the Group Separation Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Group Separation algorithm identify each Tag_ID bit#s sum of bit #1#. In other words, Group Separation algorithm had standard of selection by collision table, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Group Separation algorithm had performance test that criterions were reader#s number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Group Separation algorithm better than exisiting algorithm.