In this paper, a modified version of the Grouping Proof as described by J.Saito is proposed. By employing RFID dynamic grouping tags, a simpler and more secure identification scheme is suggested, and its application on car theft prevention is studied. A group of certain number RFID electronic tags is first provided by the car manufacturer. A car buyer then combines some of those tags to form subgroups, and corresponding grouping proofs are generated. Existence of all tags in a subgroup is checked by the grouping proof. Ignition of the car can only be possible if any one of subgroup having all its tags checked. The RFID dynamic grouping tags allow each car buyer to choose his/her own number of tags to form the subgroup. Hence, dynamic grouping offers a more secure, higher mobility, and easier to operate features than other car theft prevention practices, such as a subgroup with fixed content or metal keys. Thus, the car theft prevention should overall be enhanced.
Key Words：RFID, Automobile Immobilizer System, car theft prevention, grouping proof, dynamic grouping tags.
近年來，隨著車用隨意網路（Vehicular Ad Hoc Networks；VANET）註一在研究上的前瞻性與未來的高應用價值，各國產官學界無不競相投入先期研發的行列：如德國的NOW（Network on Wheel）專案專注於「行車溝通的通訊協定設計」與「資料傳輸的安全議題」等兩大研發重心、IEEE的DSRC（Dedicated Short Range Communication）研究團隊針對「行車間車輛的通訊（Inter-Vehicle Communications；IVC）」與「行車對路邊設備的通訊（Roadside-to-Vehicle Communications；RVC）」定義了約四十種的相關應用，皆顯示出國際上對VANET的相關應用與研究發展之高度重視。雖然車輛自動駕駛尚須等待一段時間來完成，但行車間自我組織形成（Self-Organized）的通訊網路其應用發展無疑地將成為VANET領域中未來十年的主要研究方向。然而VANET的網路結構容易發生資訊安全的問題與保護使用者隱私的需求。有鑑於此，本研究主要著眼於VANET上的整合應用架構之安全議題探討，冀能為我國於VANET安全相關議題上，作先期研發之角色。
本研究蒐集目前國際上與VANET安全議題相關之研究，並採取周延的彙整與分析，以此為基礎提出一個具備資訊安全與隱私防護機制的整合性架構。根據本研究的結論，目前VANET上的應用系統可藉由「應用面向的急迫性」與「訊息傳輸對象」來將之區分，並針對此一分類模式，分析其相對應的安全威脅與需求並提出自行整理設計的 VANET訊息安全整合應用之架構。最後，我們指出未來在VANET上針對訊息安全與隱私權議題的研究方向。
The nature of data security vulnerability and location privacy invasion of RFID systems have become a serious problem after hundreds of RFID application systems deployed all over the world. One of the promising solution directions is to provide an e±cient authentication scheme with the compliance of international RFID standards such as EPCglobal, ISO18000-1 and ISO18000-6. In this study, we propose a novel authentication scheme for RFID systems with excellent data security properties, robust location privacy preservation and efficient data matching/retrieval mechanism. In addition, our scheme is compatible to EPCglobal Class-1 Generation-2 RFID standards because only simple cryptographic primitives such as pseudo-random number generator and cyclic redundancy check are required to be implemented in RFID tags.
Key words: RFID; EPCglobal; Location Privacy; Data Security; Authentication; CRC
The proportional delay differentiation (PDD) is one of the most well-known quality of
service (QoS) models and has drawn much attention because of its ‘controllable’ and ‘predictable’
characteristics. How to provide PDD in a wireless LAN (WLAN) is addressed and a cross-layer
fine-tuning scheduling (CFS) scheme with the goal to maintain PDD among all wireless stations
is proposed, while improving performance in a WLAN. CFS additionally considers the timevarying
channel capacity to schedule packets, finely tunes the contention window and properly
arbitrates the backoff time. Also, it operates in a fully distributed manner among all stations and
in a cross-layer approach in each station. The simulation results demonstrate that the CFS
scheme can provide more satisfactory PDD and higher performance in a WLAN, compared with
802.11e.
How can a RFID (Radio Frequency Identification Devices) system prove that two or more RFID tags are in the same location? Previous researchers have proposed yoking-proof and grouping-proof techniques to
address this problem – and when these turned out to be vulnerable to replay attacks, a new existence-proof technique was proposed. We critique this class of existence-proofs and show it has three problems: (a) a race condition when multiple readers are present; (b) a race condition when multiple tags are present;
and (c) a problem determining the number of tags. We present two new proof techniques, a secure timestamp proof (secTS-proof) and a timestamp-chaining proof (chaining-proof) that avoid replay attacks and solve problems in previously proposed techniques.
Keywords: RFID, coexistence proof, timestamp, computer security,
cryptographic protocol, race condition
3rd year External Midterm Review Meeting (2009.01.07)
