RFID authentication efficient proactive information security within computational security

DOI10.1007/S00224-009-9236-0MaRDI QIDQ2429725zbMATH OpenOpenAlexFDO

Authors Shlomi Dolev, Marina Kopeetsky, Adi Shamir

Publication date 1 April 2011

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0903.5177

zbMATH Keywords

computational securitypseudo-random numbersauthentication protocolRFID tagsinformation theoretic security

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Abstract: We consider repeated communication sessions between a RFID Tag (e.g., Radio Frequency Identification, RFID Tag) and a RFID Verifier. A proactive information theoretic security scheme is proposed. The scheme is based on the assumption that the information exchanged during at least one of every n successive communication sessions is not exposed to an adversary. The Tag and the Verifier maintain a vector of n entries that is repeatedly refreshed by pairwise xoring entries, with a new vector of n entries that is randomly chosen by the Tag and sent to the Verifier as a part of each communication session. The general case in which the adversary does not listen in k > 0 sessions among any n successive communication sessions is also considered. A lower bound of n(k+1) for the number of random numbers used during any n successive communication sessions is proven. In other words, we prove that an algorithm must use at least n(k+1) new random numbers during any n successive communication sessions. Then a randomized scheme that uses only O(n log n) new random numbers is presented. A computational secure scheme which is based on the information theoretic secure scheme is used to ensure that even in the case that the adversary listens in all the information exchanges, the communication between the Tag and the Verifier is secure.

Recommendations

• Efficient RFID authentication protocols based on pseudorandom sequence generators
• Minimalist cryptography for low-cost RFID tags (extended abstract)
• Secure and efficient RFID mutual authentication protocol
• Passive cryptanalysis of the unconditionally secure authentication protocol for RFID systems
• RFID Security: Tradeoffs between Security and Efficiency

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1870449 (Why is no real title available?)
• scientific article; zbMATH DE number 2221909 (Why is no real title available?)
• Collusion-secure fingerprinting for digital data
• Information Security and Cryptology
• Minimalist cryptography for low-cost RFID tags (extended abstract)
• RFID authentication efficient proactive information security within computational security
• Unique permutation hashing

Cited in

(2)

• Flowgraph models for estimating total time of authentication process in RFID system
• RFID authentication efficient proactive information security within computational security

This page was built for publication: RFID authentication efficient proactive information security within computational security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429725)