|
|
1 | (8) |
|
|
1 | (1) |
|
|
1 | (1) |
|
|
2 | (1) |
|
1.4 Anonymous RFID Authentication |
|
|
3 | (1) |
|
1.5 Identification of Networked Tags |
|
|
4 | (1) |
|
|
5 | (4) |
|
|
5 | (4) |
|
2 Efficient Tag Search in Large RFID Systems |
|
|
9 | (30) |
|
2.1 System Model and Problem Statement |
|
|
9 | (2) |
|
|
9 | (1) |
|
|
10 | (1) |
|
|
10 | (1) |
|
|
11 | (3) |
|
|
11 | (2) |
|
|
13 | (1) |
|
|
13 | (1) |
|
2.3 A Fast Tag Search Protocol Based on Filtering Vectors |
|
|
14 | (11) |
|
|
14 | (1) |
|
|
15 | (1) |
|
|
15 | (2) |
|
2.3.4 Iterative Use of Filtering Vectors |
|
|
17 | (1) |
|
2.3.5 Generalized Approach |
|
|
18 | (1) |
|
|
19 | (3) |
|
2.3.7 Iterative Tag Search Protocol |
|
|
22 | (1) |
|
2.3.8 Cardinality Estimation |
|
|
23 | (1) |
|
2.3.9 Additional Filtering Vectors |
|
|
24 | (1) |
|
2.3.10 Hardware Requirement |
|
|
24 | (1) |
|
2.4 ITSP over Noisy Channel |
|
|
25 | (4) |
|
2.4.1 ITSP with Noise on Forward Link |
|
|
25 | (1) |
|
2.4.2 ITSP with Noise on Reverse Link |
|
|
26 | (3) |
|
2.5 Performance Evaluation |
|
|
29 | (8) |
|
|
29 | (1) |
|
2.5.2 Performance Comparison |
|
|
29 | (2) |
|
2.5.3 False-Positive Ratio |
|
|
31 | (1) |
|
2.5.4 Performance Evaluation Under Channel Error |
|
|
32 | (5) |
|
|
37 | (2) |
|
|
37 | (2) |
|
3 Lightweight Anonymous RFID Authentication |
|
|
39 | (28) |
|
3.1 System Model and Security Model |
|
|
39 | (3) |
|
|
39 | (1) |
|
|
40 | (2) |
|
|
42 | (1) |
|
3.2.1 Non-tree-Based Protocols |
|
|
42 | (1) |
|
3.2.2 Tree-Based Protocols |
|
|
43 | (1) |
|
|
43 | (2) |
|
|
43 | (1) |
|
3.3.2 A Strawman Solution |
|
|
44 | (1) |
|
3.4 Dynamic Token-Based Authentication Protocol |
|
|
45 | (8) |
|
|
45 | (1) |
|
|
46 | (1) |
|
3.4.3 Initialization Phase |
|
|
46 | (1) |
|
3.4.4 Authentication Phase |
|
|
47 | (1) |
|
|
47 | (2) |
|
3.4.6 Randomness Analysis |
|
|
49 | (3) |
|
|
52 | (1) |
|
3.4.8 Potential Problems of TAP |
|
|
53 | (1) |
|
3.5 Enhanced Dynamic Token-Based Authentication Protocol |
|
|
53 | (6) |
|
3.5.1 Resistance Against Desynchronization and Replay Attacks |
|
|
53 | (2) |
|
3.5.2 Resolving Hash Collisions |
|
|
55 | (3) |
|
|
58 | (1) |
|
|
59 | (1) |
|
|
60 | (4) |
|
3.7.1 Effectiveness of Multi-Hash Scheme |
|
|
60 | (1) |
|
3.7.2 Token-Level Randomness |
|
|
61 | (1) |
|
3.7.3 Bit-Level Randomness |
|
|
61 | (3) |
|
|
64 | (3) |
|
|
64 | (3) |
|
4 Identifying State-Free Networked Tags |
|
|
67 | |
|
4.1 System Model and Problem Statement |
|
|
67 | (3) |
|
4.1.1 Networked Tag System |
|
|
67 | (1) |
|
|
68 | (1) |
|
4.1.3 State-Free Networked Tags |
|
|
68 | (1) |
|
|
69 | (1) |
|
|
70 | (1) |
|
4.3 Contention-Based ID Collection Protocol for Networked Tag Systems |
|
|
71 | (4) |
|
|
71 | (1) |
|
4.3.2 Request Broadcast Protocol |
|
|
72 | (2) |
|
4.3.3 ID Collection Protocol |
|
|
74 | (1) |
|
4.4 Serialized ID Collection Protocol |
|
|
75 | (10) |
|
|
75 | (1) |
|
|
75 | (1) |
|
4.4.3 Biased Energy Consumption |
|
|
76 | (1) |
|
|
77 | (1) |
|
|
78 | (1) |
|
4.4.6 Serialization at Tier Two |
|
|
79 | (1) |
|
4.4.7 Recursive Serialization |
|
|
80 | (2) |
|
|
82 | (1) |
|
4.4.9 Load Factor Per Tag |
|
|
83 | (2) |
|
4.5 Improving Time Efficiency of SICP |
|
|
85 | (4) |
|
4.5.1 Request Aggregation |
|
|
85 | (1) |
|
4.5.2 ID-Transmission Pipelining |
|
|
86 | (3) |
|
|
89 | (4) |
|
|
89 | (1) |
|
4.6.2 Children Degree and Load Factor |
|
|
90 | (1) |
|
4.6.3 Performance Comparison |
|
|
91 | (1) |
|
4.6.4 Performance Tradeoff for SICP and p-SICP |
|
|
92 | (1) |
|
4.6.5 Time-Efficiency Comparison of SCIP and p-SICP |
|
|
93 | (1) |
|
|
93 | |
|
|
95 | |