- 學位論文
使用防噪群組證明改進巡房用藥安全
An Anti-Noise Multiple Grouping Proof to Improve Medication Safety in a Medicine Round
摘要
群組證明是證明複數RFID 標籤存在於相同時間區段的方法。在傳統的群組證明中，對於汙染攻擊毫無抵抗能力，而且相當局限於環境，不能混入其他多餘的標籤，需要連網，沒有匿名。經過多年的改進，目前的許多研究，已經可以匿名且離線使用，並且可抵抗絕大部分的重送攻擊，但仍然沒有研究可以選擇性的挑選標籤；當環境中混有其他標籤的情況，群組認證將會包含無關的標籤，甚至會導致群組證明失敗。而效能方面，由於群組認證是採取循序的方式來讀取，必須等待前一個標籤讀取完後，才能繼續下一個標籤的作業。是故在量大的標籤群組證明上，循序式的讀取將成為效能瓶頸，大大的不利於物流等應用。在本文中，我們提出一個具有匿名性、離線、能抵抗重送攻擊、交叉攻擊、避免污染標籤且可以同時讀取的高效率群組認證。我們的方法將會包含其他研究的優點，且可以避免混入無關標籤、只讀某些標籤，而且可以同時對大量標籤做讀取以改進效能。也因為引入了屬性加密，我們的方法將會比其他研究安全性更高。
並列摘要
Grouping proof is a way to prove that multiple RFID tags exist in the same time zone. The traditional methods of grouping proof are vulnerable to illegitimate tag attacks; they are unable to include extra tags in their operating environment; they require Internet access; and they cannot achieve anonymity. Although current studies have seen the possibility in anonymous and offline grouping proof, they are still unable to target their tags. If other groups of tags appear in their read range, these grouping proofs will read the tags too and consequently cause failure. Another disadvantage of these proofs is their one-by-one read sequence. So bigger groups of tags will take more time and become a bottleneck of performance. This may not be a practical method for logistics services. For these reasons, we propose an efficient offline grouping proof protocol that can achieve anonymity, and can resist replay attacks, cross attacks and illegitimate tag attacks. Apart from the advantages of current grouping proofs, our protocol can target specific tags and is also capable of group reading. Besides, our attribute-based encryption helps enhance the security strength of our protocol.