Please use this identifier to cite or link to this item:
|Title:||Double verification protocol via secret sharing for low-cost RFID tags||Authors:||Liu, Yali
Ezerman, Martianus Frederic
|Issue Date:||2018||Source:||Liu, Y., Ezerman, M. F., & Wang, H. (2019). Double verification protocol via secret sharing for low-cost RFID tags. Future Generation Computer Systems, 90, 118-128. doi:10.1016/j.future.2018.07.004||Series/Report no.:||Future Generation Computer Systems||Abstract:||RFID tags have become ubiquitous and cheaper to implement. It is often imperative to design ultralightweight authentication protocols for such tags. Many existing protocols still rely on triangular functions, which have been shown to have security and privacy vulnerabilities. This work proposes UMAPSS, an ultralightweight mutual-authentication protocol based on Shamir’s (2, n) secret sharing. It includes mechanisms for double verification, session control, mutual authentication, and dynamic update to enhance security and provide a robust privacy protection. The protocol relies only on two simple bitwise operations, namely addition modulo 2m and a circular shift Rot(x, y), on the tag’s end. It avoids other, unbalanced, triangular operations. A security analysis shows that the protocol has excellent privacy properties while offering a robust defense against a broad range of typical attacks. It satisfies common security and the low-cost requirements for RFID tags. It is competitive against existing protocol, scoring favourably in terms of computational cost, storage requirement, and communication overhead||URI:||https://hdl.handle.net/10356/100613
|ISSN:||0167-739X||DOI:||10.1016/j.future.2018.07.004||Rights:||© 2018 Elsevier B.V. All rights reserved. This paper was published in Future Generation Computer Systems and is made available with permission of Elsevier B.V.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.