Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function

15 years 2 months ago

Download eprint.iacr.org

In 2004, Molnar and Wagner introduced a very appealing scheme dedicated to the identification of RFID tags. Their protocol relies on a binary tree of secrets which are shared

Julien Bringer, Hervé Chabanne, Thomas Icar

Real-time Traffic

Appealing Scheme | Communications | RFID Tags | SCN 2008 | Tags |

claim paper

» Physically Unclonable FunctionBased Security and Privacy in RFID Systems

» Flowchart description of security primitives for controlled physical unclonable functions

» Robust Authentication Using Physically Unclonable Functions

» Modeling attacks on physical unclonable functions

» Secure IPBlock Distribution for Hardware Devices

» Optimal Reductions Between Oblivious Transfers Using Interactive Hashing

» An EMST Based Lookup Protocol for Peer to Peer Networks

» Authenticated hash tables

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	SCN
Authors	Julien Bringer, Hervé Chabanne, Thomas Icart

Comments (0)

Sciweavers

Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function

Appealing Scheme | Communications | RFID Tags | SCN 2008 | Tags |

Explore & Download

Productivity Tools

Sciweavers