In this work, we answer this question positively in an amortized view. Precisely, we design a fully privacy-preserving protocol in which the amortized cost of a successful authentication phase only requires time $O(n^{3/4})$. In addition, our protocol is a hybrid from the randomized hash lock scheme of Weis et. al., the hash chain scheme of Ohkubo et. al., and the efficient identification scheme of Dimitriou. We combine them delicately to obtain the desired authentication protocol.
Category / Keywords: applications / RFID, authentication, privacy, traceability Date: received 26 Mar 2009 Contact author: hsinlung at mail ntpu edu tw Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation Version: 20090327:042027 (All versions of this report) Discussion forum: Show discussion | Start new discussion