Reducing Time Complexity in RFID Systems

DOI10.1007/11693383_20MaRDI QIDQ5426198zbMATH OpenOpenAlexFDO

Authors Gildas Avoine, Etienne Dysli, Philippe Oechslin

Publication date 15 November 2007

Published in Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11693383_20

zbMATH Keywords

RFIDtime complexitytime-memory trade-off

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A Highly Scalable RFID Authentication Protocol
• RFID Security: Tradeoffs between Security and Efficiency
• scientific article; zbMATH DE number 1979302
• Low-cost cryptography for privacy in RFID systems
• RHDP-scheme for RFID's efficiency improvement on the ubiquitous computing

Cited in

(7)

• Vulnerability aware graphs for RFID protocol security benchmarking
• Addressing flaws in RFID authentication protocols
• RHDP-scheme for RFID's efficiency improvement on the ubiquitous computing
• A Highly Scalable RFID Authentication Protocol
• Flowgraph models for estimating total time of authentication process in RFID system
• Comments on enhanced yoking proof protocols for radio frequency identification tags and tag groups
• On Privacy Models for RFID

This page was built for publication: Reducing Time Complexity in RFID Systems

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