本文選題：射頻識(shí)別　切入點(diǎn)：防碰撞　出處：《廣東工業(yè)大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：射頻識(shí)別RFID(Radio Frequency Identification)是一種利用無線射頻信號(hào)進(jìn)行通信的非接觸自動(dòng)識(shí)別技術(shù),它具有快速高效、可靠和不需要物理接觸等優(yōu)點(diǎn),目前廣泛應(yīng)用于動(dòng)物識(shí)別、供應(yīng)鏈管理、電子護(hù)照系統(tǒng)等商品識(shí)別和數(shù)據(jù)采集領(lǐng)域。而標(biāo)簽防碰撞算法與安全協(xié)議設(shè)計(jì)是RFID領(lǐng)域中熱門的研究課題。在應(yīng)用RFID系統(tǒng)時(shí),為了快速高效地識(shí)別可讀范圍中的多個(gè)標(biāo)簽,需要使用標(biāo)簽防碰撞算法。其主要分為隨機(jī)性算法和確定性算法,而安全協(xié)議則是保護(hù)用戶的數(shù)據(jù)安全和隱私。 本文對(duì)現(xiàn)有的一些標(biāo)簽防碰撞算法和安全認(rèn)證協(xié)議進(jìn)行了研究和總結(jié),創(chuàng)新之處如下： 1.提出了一種改進(jìn)的基于二進(jìn)制搜索的防碰撞算法。算法先對(duì)標(biāo)簽的碰撞信息進(jìn)行預(yù)處理,使用碰撞選擇碼只選擇碰撞位來進(jìn)行通信,利用計(jì)數(shù)器來對(duì)閱讀器和標(biāo)簽進(jìn)行搜索深度的同步。算法通過計(jì)算碰撞位的位數(shù)和碰撞比率有效地利用標(biāo)簽的碰撞信息。在碰撞位數(shù)只有一位的時(shí)候,利用碰撞位非0即1的特性立即識(shí)別出兩個(gè)標(biāo)簽,而在碰撞位數(shù)大于1的時(shí)候,則通過計(jì)算碰撞比率來決定搜索分叉數(shù)。算法在碰撞比率高的時(shí)候選擇四叉樹搜索,碰撞比率低的時(shí)候選擇二叉樹搜索。算法的搜索過程使用動(dòng)態(tài)策略和返回策略,這些策略進(jìn)一步減少了閱讀器的查詢次數(shù)和通信數(shù)據(jù)量。理論分析和仿真實(shí)驗(yàn)表明：改進(jìn)的算法相對(duì)于跳躍式動(dòng)態(tài)二進(jìn)制樹算法更優(yōu),可以有效的減少查詢次數(shù)和通信數(shù)據(jù)量,提高系統(tǒng)吞吐率。 2.針對(duì)現(xiàn)有的一些安全認(rèn)證協(xié)議安全性較差的問題,設(shè)計(jì)了一個(gè)基于動(dòng)態(tài)ID帶搜索索引的RFID安全認(rèn)證協(xié)議。新協(xié)議通過閱讀器和標(biāo)簽共享一個(gè)搜索索引,有效的減少了閱讀器的計(jì)算量,加快了查詢的速度。由于ID是通過Hash函數(shù)不斷更新的,即標(biāo)簽ID是動(dòng)態(tài)變化的,因此系統(tǒng)還在閱讀器端保存了標(biāo)簽最近通過認(rèn)證的ID值,使得系統(tǒng)能應(yīng)對(duì)去同步化攻擊,而且具有前向安全性。新協(xié)議中的標(biāo)簽利用通過Hash函數(shù)更新的搜索索引充當(dāng)了隨機(jī)數(shù),使得標(biāo)簽端不用額外的集成偽隨機(jī)數(shù)發(fā)生器,減少了標(biāo)簽的成本。理論分析和GNY邏輯推導(dǎo)表明：本協(xié)議實(shí)現(xiàn)了閱讀器和標(biāo)簽之間的相互認(rèn)證,同時(shí)能抵抗重放攻擊、假冒攻擊、去同步化攻擊、前向安全、位置隱私、竊聽攻擊和標(biāo)簽?zāi)涿榷喾N常見的RFID系統(tǒng)攻擊,具有較高的安全性和實(shí)用性。
[Abstract]:Radio Frequency Identification (RFID(Radio Frequency Identification) is a non-contact automatic identification technology which uses radio frequency signals to communicate. It has the advantages of fast, high efficiency, reliability and no physical contact. It is widely used in animal identification, supply chain management, and so on. In the field of electronic passport system and other commodity identification and data acquisition, the anti-collision algorithm and security protocol design of label is a hot research topic in the field of RFID. In order to quickly and efficiently identify multiple tags in the readable range when using RFID system, It mainly includes random algorithm and deterministic algorithm, and the security protocol is to protect the user's data security and privacy. In this paper, some existing anti-collision algorithms and security authentication protocols are studied and summarized. The innovations are as follows:. 1. An improved anti-collision algorithm based on binary search is proposed. The counter is used to synchronize the search depth between the reader and the tag. The algorithm effectively utilizes the collision information of the tag by calculating the number of bits and the ratio of collision. When the collision bit number is greater than 1, the number of search bifurcation is determined by calculating the collision ratio. The algorithm selects a quadtree search when the collision rate is high. When the collision rate is low, select binary tree search. The search process of the algorithm uses dynamic strategy and return strategy. The theoretical analysis and simulation results show that the improved algorithm is better than the jump dynamic binary tree algorithm, and can effectively reduce the number of queries and the amount of communication data. Improve system throughput. 2. Aiming at the problem of poor security of some existing security authentication protocols, a RFID security authentication protocol based on dynamic ID and search index is designed. The new protocol shares a search index through readers and tags. Because ID is continuously updated through Hash function, that is, tag ID is dynamically changing, the system also keeps the ID value of the tag that has recently been authenticated on the reader side. The tag in the new protocol uses the search index updated by the Hash function to act as a random number, so that the tag end does not need additional integrated pseudorandom number generator. Theoretical analysis and GNY logic derivation show that this protocol realizes mutual authentication between reader and tag, and can resist replay attack, fake attack, desynchronization attack, forward security, location privacy, etc. Eavesdropping attacks, tag anonymity and other common RFID system attacks have high security and practicability.
【學(xué)位授予單位】：廣東工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP391.44

【參考文獻(xiàn)】

中國(guó)期刊全文數(shù)據(jù)庫 前10條

1 程文青;趙夢(mèng)欣;徐晶;;改進(jìn)的RFID動(dòng)態(tài)幀時(shí)隙ALOHA算法[J];華中科技大學(xué)學(xué)報(bào)(自然科學(xué)版);2007年06期

2 丁振華;李錦濤;馮波;;基于Hash函數(shù)的RFID安全認(rèn)證協(xié)議研究[J];計(jì)算機(jī)研究與發(fā)展;2009年04期

3 余松森,詹宜巨,彭衛(wèi)東,趙振宇;基于后退式索引的二進(jìn)制樹形搜索反碰撞算法及其實(shí)現(xiàn)[J];計(jì)算機(jī)工程與應(yīng)用;2004年16期

4 吳躍前;辜大光;范振粵;杜明輝;;RFID系統(tǒng)防碰撞算法比較分析及其改進(jìn)算法[J];計(jì)算機(jī)工程與應(yīng)用;2009年03期

5 聶鵬;;EPCglobal Class 1 Gen 2標(biāo)準(zhǔn)的RFID高效雙向認(rèn)證協(xié)議[J];計(jì)算機(jī)工程與應(yīng)用;2011年10期

6 余松森,詹宜巨,王志平,唐忠平;跳躍式動(dòng)態(tài)樹形反碰撞算法及其分析[J];計(jì)算機(jī)工程;2005年09期

7 翟永;徐進(jìn);;一種用于RFID系統(tǒng)的防碰撞算法[J];計(jì)算機(jī)工程;2009年09期

8 王少輝;王高麗;;RFID認(rèn)證協(xié)議ULAP的被動(dòng)攻擊分析[J];計(jì)算機(jī)工程;2010年22期

9 徐圓圓;曾雋芳;劉禹;;基于Aloha算法的幀長(zhǎng)及分組數(shù)改進(jìn)研究[J];計(jì)算機(jī)應(yīng)用;2008年03期

10 李秉璋;景征駿;羅燁;;基于后退式二進(jìn)制的RFID防碰撞搜索算法[J];計(jì)算機(jī)應(yīng)用與軟件;2009年12期

，

本文編號(hào)：1618665