Linked e-resources
Details
Table of Contents
1 Introduction; 1.1 Internet of Things; 1.2 RFID Technologies; 1.3 Tag Search Problem; 1.4 Anonymous RFID Authentication; 1.5 Identification of Networked Tags; 1.6 Outline of the Book; References; 2 Efficient Tag Search in Large RFID Systems; 2.1 System Model and Problem Statement; 2.1.1 System Model; 2.1.2 Time Slots; 2.1.3 Problem Statement; 2.2 Related Work; 2.2.1 Tag Identification; 2.2.2 Polling Protocol; 2.2.3 CATS Protocol; 2.3 A Fast Tag Search Protocol Based on Filtering Vectors; 2.3.1 Motivation; 2.3.2 Bloom Filter; 2.3.3 Filtering Vectors.
2.3.4 Iterative Use of Filtering Vectors2.3.5 Generalized Approach; 2.3.6 Values of mi; 2.3.7 Iterative Tag Search Protocol; 2.3.7.1 Phase One; 2.3.7.2 Phase Two; 2.3.8 Cardinality Estimation; 2.3.9 Additional Filtering Vectors; 2.3.10 Hardware Requirement; 2.4 ITSP over Noisy Channel; 2.4.1 ITSP with Noise on Forward Link; 2.4.2 ITSP with Noise on Reverse Link; 2.4.2.1 ITSP Under Random Error Model (ITSP-rem); 2.4.2.2 ITSP Under Burst Error Model (ITSP-bem); 2.5 Performance Evaluation; 2.5.1 Performance Metric; 2.5.2 Performance Comparison; 2.5.3 False -Positive Ratio.
2.5.4 Performance Evaluation Under Channel Error2.5.4.1 Performance of ITSP-rem and ITSP-bem; 2.5.4.2 False-Positive Ratio of ITSP-rem and ITSP-bem; 2.5.4.3 Signal Loss Due to Fading Channel; 2.6 Summary; References; 3 Lightweight Anonymous RFID Authentication; 3.1 System Model and Security Model; 3.1.1 System Model; 3.1.2 Security Model; 3.2 Related Work; 3.2.1 Non-tree-Based Protocols; 3.2.2 Tree-Based Protocols; 3.3 A Strawman Solution; 3.3.1 Motivation; 3.3.2 A Strawman Solution; 3.4 Dynamic Token-Based Authentication Protocol; 3.4.1 Motivation; 3.4.2 Overview; 3.4.3 Initialization Phase.
3.4.4 Authentication Phase3.4.5 Updating Phase; 3.4.6 Randomness Analysis; 3.4.7 Discussion; 3.4.8 Potential Problems of TAP; 3.5 Enhanced Dynamic Token-Based Authentication Protocol; 3.5.1 Resistance Against Desynchronization and Replay Attacks; 3.5.2 Resolving Hash Collisions; 3.5.3 Discussion; 3.6 Security Analysis; 3.7 Numerical Results; 3.7.1 Effectiveness of Multi-Hash Scheme; 3.7.2 Token-Level Randomness; 3.7.3 Bit-Level Randomness; 3.8 Summary; References; 4 Identifying State-Free Networked Tags; 4.1 System Model and Problem Statement; 4.1.1 Networked Tag System.
4.1.2 Problem Statement4.1.3 State-Free Networked Tags; 4.1.4 System Model; 4.2 Related Work; 4.3 Contention-Based ID Collection Protocol for Networked Tag Systems; 4.3.1 Motivation; 4.3.2 Request Broadcast Protocol; 4.3.3 ID Collection Protocol; 4.4 Serialized ID Collection Protocol; 4.4.1 Motivation; 4.4.2 Overview; 4.4.3 Biased Energy Consumption; 4.4.4 Serial Numbers; 4.4.5 Parent Selection; 4.4.6 Serialization at Tier Two; 4.4.7 Recursive Serialization; 4.4.8 Frame Size; 4.4.9 Load Factor Per Tag; 4.5 Improving Time Efficiency of SICP; 4.5.1 Request Aggregation.
2.3.4 Iterative Use of Filtering Vectors2.3.5 Generalized Approach; 2.3.6 Values of mi; 2.3.7 Iterative Tag Search Protocol; 2.3.7.1 Phase One; 2.3.7.2 Phase Two; 2.3.8 Cardinality Estimation; 2.3.9 Additional Filtering Vectors; 2.3.10 Hardware Requirement; 2.4 ITSP over Noisy Channel; 2.4.1 ITSP with Noise on Forward Link; 2.4.2 ITSP with Noise on Reverse Link; 2.4.2.1 ITSP Under Random Error Model (ITSP-rem); 2.4.2.2 ITSP Under Burst Error Model (ITSP-bem); 2.5 Performance Evaluation; 2.5.1 Performance Metric; 2.5.2 Performance Comparison; 2.5.3 False -Positive Ratio.
2.5.4 Performance Evaluation Under Channel Error2.5.4.1 Performance of ITSP-rem and ITSP-bem; 2.5.4.2 False-Positive Ratio of ITSP-rem and ITSP-bem; 2.5.4.3 Signal Loss Due to Fading Channel; 2.6 Summary; References; 3 Lightweight Anonymous RFID Authentication; 3.1 System Model and Security Model; 3.1.1 System Model; 3.1.2 Security Model; 3.2 Related Work; 3.2.1 Non-tree-Based Protocols; 3.2.2 Tree-Based Protocols; 3.3 A Strawman Solution; 3.3.1 Motivation; 3.3.2 A Strawman Solution; 3.4 Dynamic Token-Based Authentication Protocol; 3.4.1 Motivation; 3.4.2 Overview; 3.4.3 Initialization Phase.
3.4.4 Authentication Phase3.4.5 Updating Phase; 3.4.6 Randomness Analysis; 3.4.7 Discussion; 3.4.8 Potential Problems of TAP; 3.5 Enhanced Dynamic Token-Based Authentication Protocol; 3.5.1 Resistance Against Desynchronization and Replay Attacks; 3.5.2 Resolving Hash Collisions; 3.5.3 Discussion; 3.6 Security Analysis; 3.7 Numerical Results; 3.7.1 Effectiveness of Multi-Hash Scheme; 3.7.2 Token-Level Randomness; 3.7.3 Bit-Level Randomness; 3.8 Summary; References; 4 Identifying State-Free Networked Tags; 4.1 System Model and Problem Statement; 4.1.1 Networked Tag System.
4.1.2 Problem Statement4.1.3 State-Free Networked Tags; 4.1.4 System Model; 4.2 Related Work; 4.3 Contention-Based ID Collection Protocol for Networked Tag Systems; 4.3.1 Motivation; 4.3.2 Request Broadcast Protocol; 4.3.3 ID Collection Protocol; 4.4 Serialized ID Collection Protocol; 4.4.1 Motivation; 4.4.2 Overview; 4.4.3 Biased Energy Consumption; 4.4.4 Serial Numbers; 4.4.5 Parent Selection; 4.4.6 Serialization at Tier Two; 4.4.7 Recursive Serialization; 4.4.8 Frame Size; 4.4.9 Load Factor Per Tag; 4.5 Improving Time Efficiency of SICP; 4.5.1 Request Aggregation.