Welcome to the resource topic for 2006/131
Title:
Provably Secure Ubiquitous Systems: Universally Composable RFID Authentication Protocols
Authors: Mike Burmester, Tri van Le, Breno de Medeiros
Abstract:This paper examines two unlinkably anonymous, simple RFID identification protocols that require only the ability
to evaluate hash functions and generate random values, and that are provably secure against Byzantine adversaries.
The main contribution is a universally composable security model tuned for RFID applications. By making specific
setup, communication, and concurrency assumptions that are realistic in the RFID application setting, we arrive
at a model that guarantees strong security and availability properties,
while still permitting the design of
practical RFID protocols. We show that the two previously proposed protocols are provably secure within the new security model.
Our proofs do not employ random oracles—the protocols are shown to be
secure in the standard model under the assumption of
existence of pseudo-random function families.
ePrint: https://eprint.iacr.org/2006/131
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .