Improving the Key Search using Parallelism in RFID Privacy Protection

• 발행기관: 한국전자통신학회
• 저자명: Myeong sook Shin Choong woon Kim Joon Lee
• 간행물 정보: 『한국전자통신학회 논문지』제2권 제1호, 19~24쪽, 전체 6쪽
• 주제분류: 공학 > 전자/정보통신공학
• 파일형태: PDF
• 발행일자: 2007.02.28

영문 초록

Abstract. In the ubiquitous environment of the next generation, RFID is predicted to occupy an important technical location and also expected to apply to various fields. However, the properties of tags in itself which is the core of RFID have a dysfunction like an invasion of privacy for user. An existing cryptanalytic protection scheme of the information leakage have a difficult problem to apply to RFID tags for privacy protection. We applied Ohkubo et al. s scheme to the protection of the tag s information efficiently in the RFID system environment using low-cost tags. But, this method has all informations of tagsto identify tag s ID and then performs the process of identification in sequence in the Back-end server. These processes have lots of computations so that it have problems about a scalability. In this paper, we are based on Ohkubo et al. s scheme to solve problems, and then analyze the parallelism with the Hellman s tradeoff method, divide it into nodesin parallel. In this paper, we are based on Okubo et al. s scheme to solve problems, and then analyze the parallelism with Hellman s tradeoff method, divide it into the  node in parallel. as a result, we can reduce the computing complexity of key search to ？？ ？？ ？禮？ ？？？禮？ ？？  ？挻？ seconds from ？？ ？？ ？？ seconds . finally we show the results to be enhanced the scalability.

목차

I. INTRODUCTION

II. RFID Privacy Protection System

III. Improving Scalability of Back-end server

IV. CONCLUSION

REFERENCE

키워드

RFID Privacy Protection Scheme Hash Chain Scheme Hellman s Tradeoff Method Parallelism