Journal ArticleDOI
Lightweight RFID authentication with forward and backward security
Mike Burmester,Jorge Munilla +1 more
Reads0
Chats0
TLDR
A lightweight RFID authentication protocol that supports forward and backward security and uses a pseudorandom number generator (PRNG) that is shared with the backend Server.Abstract:
We propose a lightweight RFID authentication protocol that supports forward and backward security. The only cryptographic mechanism that this protocol uses is a pseudorandom number generator (PRNG) that is shared with the backend Server. Authentication is achieved by exchanging a few numbers (3 or 5) drawn from the PRNG. The lookup time is constant, and the protocol can be easily adapted to prevent online man-in-the-middle relay attacks. Security is proven in the UC security framework.read more
Citations
More filters
Proceedings ArticleDOI
Some Unresolved Concerns & Future Directions for Resilient RFID Smart Structures in the Supply Chain
Journal ArticleDOI
An Effective and Robust Method for Unauthorized Reader Detection Based on Tag’s Energy
TL;DR: This paper proposes a new method for Unauthorized Reader Detection based on Tag’s Energy, called URDTE, to detect unauthorized readers by observing the energy of the tag, which takes the electrical energy stored in a tag's resistor-capacitor circuit as the detection principle.
Book ChapterDOI
A Provably Secure, Lightweight Protocol for Anonymous Authentication
TL;DR: In this paper , the authors propose a lightweight anonymous authentication protocol that can be based on any block cipher and is suitable for use by, e.g., RFID tags, and formally define three security properties that their protocol is intended to satisfy (mutual authentication, anonymity, and desynchronization resilience).
Keynote talk: some unresolved concerns & future directions for resilient RFID smart structures in the supply chain
TL;DR: The challenges of establishing resilience for smart structures by considering the supply chain paradigm are analyzed, which involves untrust ed readers inspecting pallets and identifying missing objects, without being able to trace tagged objects via unauthorized inspe ctions, and the privacy of owners.
Posted Content
Attacks on Secure Ownership Transfer for Multi-Tag Multi-Owner Passive RFID Environments.
TL;DR: It is shown that for lightweight RFID applications strong privacy remains an open problem, and a novel ownership transfer protocol that provides individual-owner privacy and prevents tracking attacks falls short of its security objectives.
References
More filters
Book
Handbook of Applied Cryptography
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Proceedings ArticleDOI
How to play ANY mental game
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
ReportDOI
A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications
TL;DR: Some criteria for characterizing and selecting appropriate generators and some recommended statistical tests are provided, as a first step in determining whether or not a generator is suitable for a particular cryptographic application.
Book ChapterDOI
PRESENT: An Ultra-Lightweight Block Cipher
Andrey Bogdanov,Lars R. Knudsen,Gregor Leander,Christof Paar,Axel Poschmann,Matthew Robshaw,Yannick Seurin,C. Vikkelsoe +7 more
TL;DR: An ultra-lightweight block cipher, present, which is competitive with today's leading compact stream ciphers and suitable for extremely constrained environments such as RFID tags and sensor networks.
Journal ArticleDOI
How to construct random functions
TL;DR: In this paper, a constructive theory of randomness for functions, based on computational complexity, is developed, and a pseudorandom function generator is presented, which is a deterministic polynomial-time algorithm that transforms pairs (g, r), where g is any one-way function and r is a random k-bit string, to computable functions.