在2006年Sangshin Lee、Tomoyuki Asano及Kwangjo Kim三人提出了 RFID Mutual Authentication Scheme based on Synchronized Secret Information [14]，他們利用Hash函數以及公開同步化秘密資訊(Synchronized Secret Information )技術，宣稱可以達到保護使用者的隱私性，並且可以預防RFID標籤(Tag)被複製及仿造。 但是在同步化驗證過程後端資料庫(Back- end DataBase)卻必須要使用暴力破解法方式計算再搜尋確認無誤，以致於後端效率不佳尤其在大量確認標籤時更加明顯[14][15]。有鑑於此我們基於RFID同步化秘密資訊(Synchronized Secret Information )發展出一個更有效率的交互確認方案，我們的方案不只可達到同等的安全性且更加的有效率。 In 2006, Sangshin Lee et.al, proposed a RFID MutualAuthentication Scheme based on Synchronized Secret Information [14].They claim their protocol can not only protect user privacy utilizing Hash function and synchronized secret information published schemes, but also can resist against RFID tag cloning. But, in their scheme the back-end database must use the brute force computation to search for the confirmation to be unmistakable. For this reason, the back-end database is not efficient, especially when massive data needed to be confirmed [14][15]. Therefore, we propose a mutual authentication protocol based on the Synchronized Secret Information. Our protocol is more secret and efficient.
