Preface |
|
xi | |
Authors |
|
xiii | |
Contributors |
|
xv | |
|
1 Fundamentals of Physical Layer Security |
|
|
1 | (16) |
|
1.1 Information-theoretic Secrecy |
|
|
2 | (2) |
|
1.1.1 Shannon's Cipher System and Perfect Secrecy |
|
|
2 | (1) |
|
1.1.2 Information-theoretic Secrecy Metrics |
|
|
3 | (1) |
|
1.2 Secret Communication over Noisy Channels |
|
|
4 | (6) |
|
1.2.1 Wiretap Channel Model |
|
|
4 | (2) |
|
1.2.2 Coding Mechanisms for Secret Communication |
|
|
6 | (4) |
|
1.3 Secret-key Generation from Noisy Channels |
|
|
10 | (3) |
|
1.3.1 Channel Model for Secret-key Generation |
|
|
10 | (2) |
|
1.3.2 Coding Mechanisms for Secret-key Generation |
|
|
12 | (1) |
|
|
13 | (4) |
|
|
14 | (3) |
|
2 Coding for Wiretap Channels |
|
|
17 | (16) |
|
2.1 Coding for the Wiretap Channel II |
|
|
17 | (6) |
|
2.1.1 Basics of Error-Correcting Codes |
|
|
18 | (2) |
|
|
20 | (3) |
|
2.2 Wiretap Coding with Polar Codes |
|
|
23 | (4) |
|
|
23 | (3) |
|
2.2.2 Polar Wiretap Codes |
|
|
26 | (1) |
|
2.3 Coding for Gaussian Wiretap Channels |
|
|
27 | (4) |
|
2.3.1 Error Probability and Secrecy Gain |
|
|
27 | (1) |
|
2.3.2 Unimodular Lattice Codes |
|
|
28 | (3) |
|
|
31 | (2) |
|
|
31 | (1) |
|
|
31 | (2) |
|
3 LDPC Codes for the Gaussian Wiretap Channel |
|
|
33 | (14) |
|
3.1 Channel Model and Basic Notions |
|
|
33 | (5) |
|
|
38 | (4) |
|
3.2.1 Asymptotic Analysis |
|
|
38 | (2) |
|
3.2.2 Optimized Puncturing Distributions |
|
|
40 | (1) |
|
|
40 | (2) |
|
3.2.4 Finite Block Lengths |
|
|
42 | (1) |
|
|
42 | (2) |
|
|
44 | (3) |
|
|
45 | (2) |
|
4 Key Generation from Wireless Channels |
|
|
47 | (22) |
|
|
47 | (2) |
|
4.2 Information-theoretic Models for Key Generation |
|
|
49 | (3) |
|
4.2.1 Key Generation via Unlimited Public Discussion |
|
|
49 | (2) |
|
4.2.2 Key Generation with Rate Constraint in Public Discussion |
|
|
51 | (1) |
|
4.2.3 Key Generation with Side-information at Eve |
|
|
51 | (1) |
|
4.3 Basic Approaches for Key Generation via Wireless Networks |
|
|
52 | (2) |
|
4.4 A Joint Source-Channel Key Agreement Protocol |
|
|
54 | (5) |
|
4.4.1 Key Agreement with a Public Channel |
|
|
54 | (2) |
|
4.4.2 Key Agreement without a Public Channel |
|
|
56 | (3) |
|
4.5 Relay-assisted Key Generation with a Public Channel |
|
|
59 | (4) |
|
4.5.1 Relay-assisted Key Generation with One Relay |
|
|
59 | (2) |
|
4.5.2 Relay-assisted Key Generation with Multiple Relays |
|
|
61 | (1) |
|
4.5.3 Relay-oblivious Key Generation |
|
|
62 | (1) |
|
4.6 Key Agreement with the Presence of an Active Attacker |
|
|
63 | (3) |
|
|
63 | (2) |
|
4.6.2 Key Generation Phase |
|
|
65 | (1) |
|
|
66 | (1) |
|
|
67 | (2) |
|
|
67 | (2) |
|
|
69 | (24) |
|
|
69 | (1) |
|
5.2 The Gaussian Two-way Wiretap Channel |
|
|
70 | (1) |
|
5.3 Achieving Secrecy Using Public Discussion |
|
|
71 | (2) |
|
5.4 Achieving Secrecy Using Cooperative Jamming |
|
|
73 | (2) |
|
|
74 | (1) |
|
|
74 | (1) |
|
5.5 Achieving Secrecy through Discussion and Jamming |
|
|
75 | (7) |
|
5.5.1 Jamming with Codewords |
|
|
75 | (3) |
|
5.5.2 Secrecy through Key Generation |
|
|
78 | (2) |
|
5.5.3 Block Markov Coding Scheme |
|
|
80 | (2) |
|
5.6 When the Eavesdropper Channel States Are Not Known |
|
|
82 | (2) |
|
|
84 | (3) |
|
|
84 | (2) |
|
|
86 | (1) |
|
|
87 | (1) |
|
5.9 Proof of Theorem 5.7.5 |
|
|
88 | (1) |
|
5.10 Proof of Theorem 5.7.6 |
|
|
89 | (4) |
|
|
90 | (3) |
|
6 MIMO Signal Processing Algorithms for Enhanced Physical Layer Security |
|
|
93 | (22) |
|
|
94 | (1) |
|
6.2 Physical Layer Security |
|
|
94 | (2) |
|
6.2.1 Signal Processing Aspects |
|
|
94 | (1) |
|
6.2.2 Secrecy Performance Metrics |
|
|
95 | (1) |
|
|
95 | (1) |
|
6.3 MIMO Wiretap Channels |
|
|
96 | (3) |
|
|
97 | (1) |
|
|
98 | (1) |
|
6.4 MIMO Wiretap Channel with an External Helper |
|
|
99 | (2) |
|
6.5 MIMO Broadcast Channel |
|
|
101 | (2) |
|
6.6 MIMO Interference Channel |
|
|
103 | (4) |
|
6.7 MIMO Relay Wiretap Networks |
|
|
107 | (3) |
|
6.7.1 Relay-aided Cooperation |
|
|
107 | (2) |
|
|
109 | (1) |
|
|
110 | (5) |
|
|
110 | (5) |
|
7 Discriminatory Channel Estimation for Secure Wireless Communication |
|
|
115 | (22) |
|
|
115 | (2) |
|
7.2 Discriminatory Channel Estimation---Basic Concept |
|
|
117 | (1) |
|
7.3 DCE via Feedback and Retraining |
|
|
118 | (8) |
|
7.3.1 Two-Stage Feedback-and-Retraining |
|
|
118 | (5) |
|
7.3.2 Multiple-stage Feedback and Retraining |
|
|
123 | (1) |
|
7.3.3 Simulation Results and Discussions |
|
|
124 | (2) |
|
7.4 Discriminatory Channel Estimation via Two-way Training |
|
|
126 | (8) |
|
7.4.1 Two-way DCE Design for Reciprocal Channels |
|
|
126 | (3) |
|
7.4.2 Two-way DCE Design for Nonreciprocal Channels |
|
|
129 | (2) |
|
7.4.3 Simulation Results and Discussions |
|
|
131 | (3) |
|
7.5 Conclusions and Discussions |
|
|
134 | (3) |
|
|
135 | (1) |
|
|
135 | (2) |
|
8 Physical Layer Security in OFDMA Networks |
|
|
137 | (16) |
|
|
137 | (1) |
|
8.2 Related Works on Secure OFDM/OFDM Networks |
|
|
138 | (3) |
|
8.2.1 Secure OFDM Channel |
|
|
138 | (2) |
|
8.2.2 Secure OFDMA Cellular Networks |
|
|
140 | (1) |
|
8.2.3 Secure OFDMA Relay Networks |
|
|
140 | (1) |
|
8.2.4 Secure OFDM with Implementation Issues |
|
|
140 | (1) |
|
8.3 Basics of Resource Allocation for Secret Communications |
|
|
141 | (1) |
|
8.3.1 Power Allocation Law for Secrecy |
|
|
141 | (1) |
|
8.3.2 Multiple Eavesdroppers |
|
|
141 | (1) |
|
8.4 Resource Allocation for Physical Layer Security in OFDMA Networks |
|
|
142 | (7) |
|
8.4.1 Problem Formulation |
|
|
143 | (1) |
|
|
144 | (2) |
|
8.4.3 Suboptimal Algorithm |
|
|
146 | (1) |
|
|
147 | (1) |
|
|
147 | (2) |
|
8.4.6 Discussion on False CSI Feedback |
|
|
149 | (1) |
|
8.5 Conclusions and Open Issues |
|
|
149 | (4) |
|
|
150 | (3) |
|
9 The Application of Cooperative Transmissions to Secrecy Communications |
|
|
153 | (26) |
|
|
153 | (1) |
|
9.2 When All Nodes Are Equipped with a Single Antenna |
|
|
154 | (9) |
|
9.2.1 Cooperative Jamming |
|
|
155 | (2) |
|
|
157 | (6) |
|
9.3 MIMO Relay Secrecy Communication Scenarios |
|
|
163 | (12) |
|
9.3.1 When CSI of Eavesdroppers Is Known |
|
|
163 | (5) |
|
9.3.2 When CSI of Eavesdroppers Is Unknown |
|
|
168 | (7) |
|
|
175 | (4) |
|
|
175 | (1) |
|
|
175 | (4) |
|
10 Game Theory for Physical Layer Security on Interference Channels |
|
|
179 | (30) |
|
|
179 | (2) |
|
10.2 System Models and Scenarios |
|
|
181 | (7) |
|
10.2.1 Standard MISO Interference Channel |
|
|
182 | (1) |
|
10.2.2 MISO Interference Channel with Private Messages |
|
|
183 | (2) |
|
10.2.3 MISO Interference Channel with Public Feedback and Private Messages |
|
|
185 | (2) |
|
10.2.4 Discussion and Comparison of Scenarios |
|
|
187 | (1) |
|
10.3 Noncooperative Solutions |
|
|
188 | (4) |
|
10.3.1 Noncooperative Games in Strategic Form |
|
|
189 | (2) |
|
10.3.2 Solution for the MISO Interference Channel Scenarios |
|
|
191 | (1) |
|
10.4 Cooperative Solutions |
|
|
192 | (7) |
|
10.4.1 Bargaining Solutions |
|
|
193 | (2) |
|
10.4.2 Nash Bargaining Solution |
|
|
195 | (1) |
|
10.4.3 Bargaining Algorithm in the Edgeworth Box |
|
|
196 | (1) |
|
10.4.4 Walras Equilibrium Solution |
|
|
196 | (3) |
|
10.5 Illustrations and Discussions |
|
|
199 | (3) |
|
10.5.1 Comparison of Utility Regions |
|
|
199 | (1) |
|
10.5.2 Noncooperative and Cooperative Operating Points |
|
|
200 | (1) |
|
10.5.3 Bargaining Algorithm Behavior |
|
|
201 | (1) |
|
|
202 | (1) |
|
|
203 | (1) |
|
|
203 | (6) |
|
10.7.1 Proof of Theorem 10.3.1 |
|
|
203 | (1) |
|
10.7.2 Proof of Theorem 10.4.1 |
|
|
204 | (1) |
|
10.7.3 Proof of Theorem 10.4.2 |
|
|
205 | (1) |
|
10.7.4 Proof of Theorem 10.4.3 |
|
|
205 | (1) |
|
|
206 | (3) |
|
11 Ascending Clock Auction for Physical Layer Security |
|
|
209 | (28) |
|
|
210 | (2) |
|
11.1.1 Cooperative Jamming for Physical Layer Security |
|
|
210 | (1) |
|
11.1.2 Game Theory-based Jamming Power Allocation |
|
|
211 | (1) |
|
11.1.3 Ascending Auctions |
|
|
211 | (1) |
|
|
212 | (1) |
|
11.2 System Model and Problem Formulation |
|
|
212 | (3) |
|
|
212 | (2) |
|
11.2.2 Source's Utility Function |
|
|
214 | (1) |
|
11.2.3 Jammer's Utility Function |
|
|
215 | (1) |
|
11.3 Auction-based Jamming Power Allocation Schemes |
|
|
215 | (4) |
|
11.3.1 Power Allocation Scheme based on Single Object Pay-as-Bid Ascending Clock Auction (P-ACA-S) |
|
|
215 | (1) |
|
11.3.2 Power Allocation Scheme based on Traditional Ascending Clock Auction (P-ACA-T) |
|
|
216 | (2) |
|
11.3.3 Power Allocation Scheme based on Alternative Ascending Clock Auction (P-ACA-A) |
|
|
218 | (1) |
|
11.4 Properties of the Proposed Auction-based Power Allocation Schemes |
|
|
219 | (13) |
|
11.4.1 Optimal Jamming Power for Each Source |
|
|
220 | (1) |
|
|
221 | (2) |
|
|
223 | (3) |
|
11.4.4 Social Welfare Maximization |
|
|
226 | (3) |
|
11.4.5 Complexity and Overhead |
|
|
229 | (3) |
|
11.5 Conclusions and Open Issues |
|
|
232 | (5) |
|
|
234 | (3) |
|
12 Relay and Jammer Cooperation as a Coalitional Game |
|
|
237 | (16) |
|
|
237 | (3) |
|
12.1.1 Cooperative Relaying and Cooperative Jamming |
|
|
237 | (1) |
|
12.1.2 Relay and Jammer Selection |
|
|
238 | (1) |
|
12.1.3 Coalitional Game Theory |
|
|
239 | (1) |
|
|
240 | (1) |
|
12.2 System Model and Problem Formulation |
|
|
240 | (2) |
|
12.3 Relay and Jammer Cooperation as a Coalitional Game |
|
|
242 | (3) |
|
12.3.1 Coalitional Game Definition |
|
|
242 | (2) |
|
12.3.2 Properties of the Proposed Coalitional Game |
|
|
244 | (1) |
|
12.4 Coalition Formation Algorithm |
|
|
245 | (3) |
|
12.4.1 Coalition Formation Concepts |
|
|
245 | (1) |
|
12.4.2 Merge-and-Split Coalition Formation Algorithm |
|
|
246 | (2) |
|
12.5 Conclusions and Open Issues |
|
|
248 | (5) |
|
|
249 | (4) |
|
13 Stochastic Geometry Approaches to Secrecy in Large Wireless Networks |
|
|
253 | (18) |
|
|
253 | (2) |
|
|
253 | (1) |
|
13.1.2 Stochastic Geometry Approaches |
|
|
254 | (1) |
|
|
255 | (7) |
|
13.2.1 Network and Graph Model |
|
|
255 | (1) |
|
13.2.2 Local Connectivity Properties |
|
|
256 | (2) |
|
13.2.3 Global Connectivity Properties |
|
|
258 | (2) |
|
13.2.4 Connectivity Enhancements |
|
|
260 | (2) |
|
13.3 Secrecy Transmission Capacity |
|
|
262 | (6) |
|
|
262 | (1) |
|
13.3.2 Capacity Formulation |
|
|
262 | (2) |
|
13.3.3 Illustrative Example |
|
|
264 | (4) |
|
13.4 Current Limitations and Future Directions |
|
|
268 | (3) |
|
|
269 | (2) |
|
14 Physical Layer Secrecy in Large Multihop Wireless Networks |
|
|
271 | (18) |
|
|
271 | (2) |
|
14.2 Background: Physical Layer Security in One-hop Networks |
|
|
273 | (1) |
|
14.3 Secure Connectivity: The Secrecy Graph |
|
|
274 | (1) |
|
|
275 | (9) |
|
14.4.1 Background: Throughput Scaling in Large Wireless Networks |
|
|
275 | (2) |
|
14.4.2 Secrecy Scaling with Known Eavesdropper Locations |
|
|
277 | (1) |
|
14.4.3 Secrecy Scaling with Unknown Eavesdropper Locations |
|
|
277 | (7) |
|
14.5 Conclusion and Future Work |
|
|
284 | (5) |
|
|
285 | (1) |
|
|
285 | (4) |
Index |
|
289 | |