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
Journal ArticleDOI
An enhanced symmetric-key based 5G-AKA protocol
TL;DR: In this paper, the authors proposed an open access charge for open access in Malaga, which was supported in part by Funding for Open Access charge: Universidad de Malaga/CBUA, FEDER funds (Junta de Andalucia-University of Malaga) under Project UMA18-FEDERJA-172 and by Junta de Ceballos and ERDF under Project CEIATECH-11, and in part, NSF, USA under Grant 1565215.
Journal ArticleDOI
A Forward-secure Grouping-proof Protocol for Multiple RFID Tags
TL;DR: A Forward-Secure Grouping-Proof Protocol (FSGP) for multiple RFID tags based on Shamir's (n, n) secret sharing is proposed that provides security enhancement, performance improvement, and meanwhile controls the computation cost.
Journal ArticleDOI
Pre vs Post State Update: Trading Privacy for Availability in RFID
Mike Burmester,Jorge Munilla +1 more
TL;DR: This letter analyzes a recently proposed RFID protocol and proves that for lightweight RFID applications strong privacy cannot be achieved in the presence of a Byzantine adversary.
Book ChapterDOI
Key-Indistinguishable Message Authentication Codes
TL;DR: In this paper, it was shown that it is possible for an attacker to determine whether or not two authenticated messages were sent by the same party even without any information about the secret key used.
Proceedings ArticleDOI
Anonymous Yoking-Group Proofs
TL;DR: This paper considers a scenario that multi-group of tags can be proved to be scanned simultaneously and introduces a novel concept called "yoking-group proofs", which is an extension of yoking-proofs that allows multiple tags to be proved together.
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.