跳到主要內容

臺灣博碩士論文加值系統

(44.200.169.3) 您好!臺灣時間:2022/12/04 19:37
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:呂紹永
研究生(外文):Shao-Yong Lu
論文名稱:以多層式群組證明改善供應鏈貨物管理
論文名稱(外文):A Multilayered Grouping Proof Method for Improving Cargo Management
指導教授:楊明豪楊明豪引用關係羅嘉寧羅嘉寧引用關係
指導教授(外文):Ming-Hour YangJia-Ning Luo
學位類別:碩士
校院名稱:中原大學
系所名稱:資訊工程研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2015
畢業學年度:103
語文別:中文
論文頁數:34
中文關鍵詞:RFID多層式群組證明供應鏈管理匿名性多重證明攻擊同步讀取攻擊
外文關鍵詞:radio-frequency identificationmultilayered grouping proofsupply chain managementanonymitymulti-session attacksconcurrency attacks
相關次數:
  • 被引用被引用:0
  • 點閱點閱:137
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
  Mobile RFID目前已普遍應用於供應鏈管理,藉由RFID技術,物流業者可大幅提升管理效率。為了改善供應鏈運輸途中,貨物遭到竊取的問題,目前大多利用群組證明來確保整批貨物的完整性。然而傳統的證明因採用依序讀取標籤之方法,無法同時針對特定的一群標籤產生群組證明,亦無法確保隱私性,最嚴重的是這些方法會因讀取大量標籤耗費過多時間而造成不存在的標籤包含於群組證明中,所以較難以實用於現今之物流產業。為此,本論文擬提出多層式的離線群組證明產生方法。該方法不僅可提供匿名之隱私保護,且可透過群組證明,以及收貨時立即自動驗證發貨與收貨資料一致性的做法,來改善供應鏈的收件商與快遞人員間,關於交貨完整性之交易糾紛。此外,亦可抵抗重送攻擊與同步讀取等攻擊。而除了現有群組證明方法之優點外,我們的方法可針對群組或特定之標籤產生群組證明。最後我們將以實驗證明:與其他群組證明方法相較,我們的方法可在移動的RFID環境下,更有效率地執行跨越不同單位的離線大量群組證明產生方法。

Currently, mobile radio-frequency identification (RFID) systems are generally used in supply chain management. Through utilizing RFID, logistic operators can improve the effectiveness of cargo management considerably. To minimize cargo theft during transport, grouping proof methods are generally employed to ensure the integrity of entire cargo loads. However, because conventional grouping proofs involve scanning tags sequentially, they can neither simultaneously generate grouping proofs for a specific group of RFID tags, nor ensure data confidentiality. The most serious problem is that the considerable amount of time such methods require to scan a high number of tags; moreover, nonexisting tags are included in the grouping proofs. Thus, applying grouping proof methods in the current logistic industry involves difficulty. To solve this problem, this paper describes a method for generating multilayered offline grouping proofs. The proposed method provides tag anonymity to ensure data confidentiality; moreover, resolving disputes between recipients and transporters over the integrity of cargo deliveries can be expedited by generating grouping proofs and automatically authenticating the consistency between the receipt proof and pick proof. The proposed method can also protect against replay attacks, multi-session attacks, and concurrency attacks. In addition, the proposed method can generate grouping proofs for specific individual tags or groups of tags. Finally, experimental results verify that compared with other methods for generating grouping proofs, the proposed method can efficiently generate offline grouping proofs involving several parties in a supply chain that uses mobile RFID.

目錄
中文摘要 I
Abstract II
誌謝 III
目錄 IV
圖目錄 V
表目錄 VI
第一章 前言 1
第二章 行動物流貨物檢核管理 3
2.1 初始化階段 5
2.2 多層讀取器群組證明協定 7
2.3 後端驗證器覆驗群組證明的正確性 12
第三章 安全與性能分析 13
第四章 效能分析 17
第五章 證明 21
第六章 結論 25
第七章 參考文獻 25

圖目錄
圖1供應鏈配送與群組證明流程 4
圖2收件商貨物標籤群組金鑰樹(a)群組金鑰之間編號規則(b)3元群組標籤金鑰樹 5
圖3非完整金鑰樹的群組金鑰選取範例(a)剩餘標籤數量RA≤讀取能力r(b)RA>r 8
圖4讀取器能力為6個的讀取樹(a)單1群組金鑰(b)多把群組金鑰 9
圖5取得可信任時鐘標籤簽章的時間戳記 9
圖6產生多層讀取器群組證明 11
圖7確認標籤和雙方簽章並檢查時間限制 12
圖8群組標籤的計算量比較 18
圖9讀取器的計算量比較 18
圖10收集群組標籤的訊息量比較 19
圖11讀取器傳輸的訊息量比較 20
圖12產生群組證明時間的比較 20

表目錄
表1 符號定義 6
表2 群組證明安全性比較表 14
表3 群組證明性能比較表 16
表4 群組證明標籤(m個)的計算量 17
表5 群組證明標籤(m個)的傳輸量 19
表6 邏輯證明的符號定義 21

[1]J. Balogh, J. Békési and G. Galambos, “New lower bounds for certain classes of bin packing algorithms,” Journal of Theoretical Computer Science, vol.440-441, pp. 1-13, July, 2012.
[2]S. Bo, Y. Ito and K. Nakano, “CRT-Based DSP Decryption Using Montgomery Modular Multiplication on the FPGA”, in IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, Shanghai, 2011, pp.532-541.
[3]A. Bogdanov, G. Leander, C. Paar, A. Poschmann, M. J. B. Robshaw and Y. Seurin, “Hash functions and RFID tags: Mind the gap”, in Cryptographic Hardware and Embedded Systems, vol. 5154, pp. 283-299, August, 2008.
[4]L. Bolotnyy and G. Robins, “Generalized "Yoking-Proofs" for a Group of RFID Tags,” in the 3rd Annual International Conference on Mobile and Ubiquitous Systems: Networking &; Services, San Jose, 2006, pp. 1-4.
[5]M. Burmester and J. Munilla, “Distributed Group Authentication for RFID Supply Management,” IACR Cryptology ePrint Archive, vol. 2013, p. 779, November, 2013.
[6]J. R. Cha and J. H. Kim, “Novel Anti-collision Algorithms for Fast Object Identification in RFID System,” in 11th International Conference on Parallel and Distributed Systems, Fukuoka, 2005, pp. 63-67.
[7]H. Y. Chien and S. B. Liu, “Tree-Based RFID Yoking Proof,” in International Conference on Networks Security, Wireless Communications and Trusted Computing, 2009, pp.550-553.
[8]S. J. Engberg, M. B. Harning and C. D. Jensen, “Zero-knowledge Device Authentication: Privacy &; Security Enhanced RFID preserving Business Value and Consumer Convenience”, in 2nd Annual Conference on Privacy, Security and Trust, New Brunswick, 2004, pp.89-101.
[9]EPCTM Radio-Frequency Identity Protocols Class-1 Generation-2 UHF RFID Protocol for Communications at 860 Mhz - 960 Mhz, ver 2.0.0, EPCGlobal Inc., November, 2013.
[10]M. Feldhofer and J. Wolkerstorfer, “Strong Crypto for RFID Tags - A Comparison of Low-Power Hardware Implementations”, in IEEE International Symposium on Circuits and Systems, New Orleans, 2007, pp.1839-1842.
[11]K. Fleszar and C. Charalambous, “Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem,” European Journal of Operational Research, vol. 210, no. 2, pp. 176-184, April, 2011.
[12]J. M. de Fuentes, P. Peris-Lopez, Juan E. Tapiador and Sergio Pastrana, “Probabilistic yoking proofs for large scale IoT systems,” Ad Hoc Networks, 2015.
[13]R. Glidden, C. Bockorick, S. Cooper, C. Diorio, D. Dressler, V. Gutnik, C. Hagen, D. Hara, T. Hass, T. Humes, J. Hyde, R. Oliver, O. Onen, A. Pesavento, K. Sundstrom and M. Thomas, “Design of ultra-low-cost UHF RFID tags for supply chain applications,” Communications Magazine, vol.42, pp.140-151, August, 2004.
[14]L. Gong, R. Needham and R. Yahalom, “Reasoning about belief in cryptographic protocols,” in Computer Society Symposium on Research in Security and Privacy, 1990, pp. 234-248.
[15]J. ND. Gupta and J. C. Ho, “A new heuristic algorithm for the one-dimensional bin-packing problem”, Production planning &; control, vol. 10, no. 6, pp. 598-603, September, 1999.
[16]J. Hermans and R. Peeters, “Private Yoking Proofs: Attacks, Models and New Provable Constructions,” in 8th International Conference on RFIDSec, Netherlands, 2013, pp 96-108.
[17]H. H. Huang and C. Y. Ku, “A RFID Grouping Proof Protocol for Medication Safety of Inpatient,” Journal of Medical Systems, vol. 33, no. 6, pp. 467-474, December, 2009.
[18]International Organization for Standardization. ISO/IEC 18000: Information technology automatic identification and data capture techniques - Radio frequency identification for item management air interface, 2003.
[19]S. Jantarapatin, C. Mitrpant, C.Tantibundhit, T. Nuamcherm and P. Kovintavewat,“Performance Comparison of the Authentication Protocols in RFID System,” in Management of Emergent Digital EcoSystems, 2010, pp. 131-136.
[20]A. Juels, “"Yoking-Proofs" for RFID Tags,” in the 2nd Annual International Conference on Pervasive Computing and Communications, 2004, pp. 138-143.
[21]C. E. Koh, H. J. Kim and E. Y. Kim, “The Impact of RFID in Retail Industry:Issues and Critical Success Factors,” Shopping Center Research, vol. 13, no. 1, pp. 101-117, 2006.
[22]X. Leng, Y. Lien, K. Mayes and K. Markantonakis, “An RFID grouping proof protocol exploiting anti-collision algorithm for subgroup dividing,” International Journal of Security and Networks, vol. 5, no. 2/3, pp. 79-86, March, 2010.
[23]Y. H. Lien, C. T. His, X. Leng, J. H. Chiu and H. K. Chang, “An RFID BasedMulti-batch Supply Chain Systems,” Wireless Personal Communications, vol. 63, no. 2, pp.393-413, March, 2012.
[24]Y. Lien, X. Leng, K. Mayes and J. H. Chiu, “Reading Order Independent Grouping Proof for RFID Tags, ” in International Conference on Intelligence and Security Informatics, Taipei, 2008, pp. 128-136.
[25]C. C. Lin, Y. C. Lai, J. D. Tygar, C. K. Yang and C. L. Chiang, “Coexistence Proof Using Chain of Timestamps for Multiple RFID Tags,” in Web and Network Technologies and Information Management, 2007, pp.634-643.
[26]N. W. Lo and K. H. Yeh, “Anonymous Coexistence Proofs for RFID Tags,” Journal of Information Science and Engineering, vol. 26, no. 4, pp. 1213-1230, July, 2010.
[27]C. Ma, J. Lin, Y. Wang and M. Shang, “Offline RFID Grouping Proofs with Trusted Timestamps,” in International Conference on Trust, Security and Privacy in Computing and Communications, Liverpool, 2012, pp. 674-681.
[28]A.S.W. Man, E.S. Zhang, V.K.N. Lau, C.Y. Tsui and H.C. Luong, “Low Power VLSI Design for a RFID Passive Tag baseband System Enhanced with an AES Cryptography Engine,” in 1st Annual RFID Eurasia, Istanbul, 2007, pp.1-6.
[29]K. Michael and L. McCathie, “The Pros and Cons of RFID in Supply Chain Management,” in International Conference on Mobile Business, 2005, pp. 623-629.
[30]K. Nakano, K. Kawakami, and K. Shigemoto, “RSA encryption and decryption using the redundant number system on the FPGA,” in IEEE International Symposium on Parallel &; Distributed Processing, 2009, pp. 1-8.
[31]T. Nuamcherm, P. Kovintavewat, C. Tantibundhit, U. Ketprom and C. Mitrpant, “An Improved Proof for RFID Tags,” in International Conference on Electrical Engineering /Electronics, Computer, Telecommunications and Information Technology, 2008, pp. 737-740.
[32]M. H. Ozcanhan, G. Dalkilic, and S. Utku, “Analysis of Two Protocols Using EPC Gen-2 Tags for Safe Inpatient Medication,”in Innovations in Intelligent Systems and Applications (INISTA), Albena, 2013, pp. 1-6.
[33]P. Peris-Lopez, A. Orfila, A. Mitrokotsa, and J. CA van der Lubbe, “A Comprehensive RFID Solution to Enhance Inpatient Medication Safety,” Journal of Medical Informatics, vol. 80, no. 1, pp. 13-24, November, 2011.
[34]P. Peris-Lopez, A. Orfila, J. C. Hernandez-Castro and J. CA Van der Lubbe, “Flaws on RFID grouping-proofs. Guidelines for future sound protocols,” Journal of Network and Computer Applications, vol. 34, no. 3, pp. 833-845, May, 2011.
[35]P. Peris-Lopez, J. C. Hernandez-Castro, J. M. Estevez-Tapiador and A. Ribagorda, “Solving the Simultaneous Scanning Problem Anonymously: Clumping Proofs for RFID Tags,” in the 3rd International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing, Istanbul, 2007, pp. 55-60.
[36]P. Peris-Lopez, M. Safkhani, N. Bagheri and M. Naderi, “RFID in eHealth: How to Combat Medication Errors and Strengthen Patient Safety,” Medical and Biological Engineering, vol. 33, no. 4, pp. 363-372, August, 2013.
[37]S. Piramuthu, “On Existence Proofs for Multiple RFID Tags,” in ACS/IEEE International Conference on Pervasive Services, Lyon, 2006, pp. 317-320.
[38]G. M. Pisarsky, “RFID Technology:An Analysis of Privacy and Security Issues,” in Computer Science Seminar SA3-T1-1, 2004, pp. 1-5.
[39]B. R. Ray, M. Chowdhury and J. Abawajy, “Critical Analysis and Comparative Study of Security for Networked RFID Systems,” in 14th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, Honolulu, 2013, pp.197-202.
[40]J. Saito and K. Sakurai, “Grouping Proof for RFID Tags,” in International Conference on Advanced Information Networking and Applications, 2005, pp. 621-624.
[41]H. M. Sun, W. C. Ting and S. Y. Chang, “Offlined Simultaneous Grouping Proof for RFID Tags,” in 2nd International Conference on Computer Science and its Applications, Jeju, 2009, pp. 1-6.
[42]S. Sundaresan, R. Doss, S. Piramuthu and W. Zhou, “A Robust Grouping Proof Protocol for RFID EPC C1G2 Tags,” Journal of Information Forensics and Security, vol. 9, no. 6, pp. 961-975, June, 2014.
[43]K. H. Tsoi, K. H. Leung and P. H. W. Leong, “Compact FPGA-based true and pseudo random number generators,” in 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2003, pp. 51-61.
[44]S. Wu, K. Chen and Y. Zhu, “A Secure Lightweight RFID Binding Proof Protocol for Medication Errors and Patient Safety,” Journal of Medical Systems, vol. 36, no. 5, pp. 2743-2749, October, 2012.
[45]L. Xu, C. Huang, “Computation-Efficient Multicast Key Distribution,” IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 5, pp. 577-587, May, 2008.
[46]Y. C. Yen, N. W. Lo and T. C. Wu, “Two RFID-Based Solutions for Secure Inpatient Medication Administration,” Journal of Medical Systems, vol. 36, no. 5, pp. 2769-2778, October, 2012.
[47]Y. C. Yu, T. W. Hou and T. C. Chiang, “Low Cost RFID Real Lightweight Binding Proof Protocol for Medication Errors and Patient Safety,” Journal of Medical Systems, Vol. 36, no. 2, pp. 823-828, April, 2012.
[48]J. Zhai and G. Wang, “An Anti-collision Algorithm Using Two-functional Estimation for RFID Tags,” in International Conference on Computational Science and Its Applications, Singapore, 2005, pp. 702-711.
[49]Z. Zhong and X. Qiu-Liang, “Universal Composable Grouping-Proof Protocol for RFID Tags in the Internet of Things,” Chinese Journal of Computers, vol. 34, no. 7, pp. 1188-1194, July, 2011.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top