WIRELESS SECURITY: KNOW IT ALL
CONTENTS FUNDAMENTALS OF PHYSICAL LAYER SECURITY INFORMATION-THEORETIC SECRECY SHANNON’S CIPHER SYSTEM AND PERFECT SECRECY INFORMATION-THEORETIC SECRECY METRICS SECRET COMMUNICATION OVER NOISY CHANNELS WIRETAP CHANNEL MODEL CODING MECHANISMS FOR SECRET COMMUNICATION SECRET-KEY GENERATION FROM NOISY CHANNELS CHANNEL MODEL FOR SECRET-KEY GENERATION CODING MECHANISMS FOR SECRET-KEY GENERATION CONCLUSION REFERENCES CODING FOR WIRETAP CHANNELS CODING FOR THE WIRETAP CHANNEL II BASICS OF ERROR-CORRECTING CODES WIRETAP II CODES WIRETAP CODING WITH POLAR CODES POLAR CODES POLAR WIRETAP CODES CODING FOR GAUSSIAN WIRETAP CHANNELS ERROR PROBABILITY AND SECRECY GAIN UNIMODULAR LATTICE CODES ACKNOWLEDGMENT LDPC CODES FOR THE GAUSSIAN WIRETAP CHANNEL CHANNEL MODEL AND BASIC NOTIONS CODING FOR SECURITY ASYMPTOTIC ANALYSIS OPTIMIZED PUNCTURING DISTRIBUTIONS REDUCING SNR LOSS FINITE BLOCK LENGTHS SYSTEM ASPECTS CONCLUDING REMARKS KEY GENERATION FROM WIRELESS CHANNELS INTRODUCTION INFORMATION-THEORETIC MODELS FOR KEY GENERATION KEY GENERATION VIA UNLIMITED PUBLIC DISCUSSION KEY GENERATION WITH RATE CONSTRAINT IN PUBLIC DISCUSSION KEY GENERATION WITH SIDE-INFORMATION AT EVE BASIC APPROACHES FOR KEY GENERATION VIA WIRELESS NETWORKS A JOINT SOURCE-CHANNEL KEY AGREEMENT PROTOCOL KEY AGREEMENT WITH A PUBLIC CHANNEL KEY AGREEMENT WITHOUT A PUBLIC CHANNEL RELAY-ASSISTED KEY GENERATION WITH A PUBLIC CHANNEL RELAY-ASSISTED KEY GENERATION WITH ONE RELAY RELAY-ASSISTED KEY GENERATION WITH MULTIPLE RELAYS RELAY-OBLIVIOUS KEY GENERATION KEY AGREEMENT WITH THE PRESENCE OF AN ACTIVE ATTACKER TRAINING PHASE KEY GENERATION PHASE SECRECY WITH FEEDBACK THE GAUSSIAN TWO-WAY WIRETAP CHANNEL ACHIEVING SECRECY USING PUBLIC DISCUSSION ACHIEVING SECRECY USING COOPERATIVE JAMMING FULL-DUPLEX NODE HALF-DUPLEX NODE ACHIEVING SECRECY THROUGH DISCUSSION AND JAMMING JAMMING WITH CODEWORDS SECRECY THROUGH KEY GENERATION BLOCK MARKOV CODING SCHEME WHEN THE EAVESDROPPER CHANNEL STATES ARE NOT KNOWN CONVERSE OUTER BOUNDS DISCUSSION PROOF OF THEOREM 5 7 5 5 10 PROOF OF THEOREM 5 7 6 MIMO SIGNAL PROCESSING ALGORITHMS FOR ENHANCED PHYSICAL LAYER SECURITY PHYSICAL LAYER SECURITY SIGNAL PROCESSING ASPECTS SECRECY PERFORMANCE METRICS THE ROLE OF CSI MIMO WIRETAP CHANNELS COMPLETE CSI PARTIAL CSI MIMO WIRETAP CHANNEL WITH AN EXTERNAL HELPER MIMO BROADCAST CHANNEL MIMO INTERFERENCE CHANNEL MIMO RELAY WIRETAP NETWORKS RELAY-AIDED COOPERATION UNTRUSTED RELAYING CONCLUSIONS DISCRIMINATORY CHANNEL ESTIMATION FOR SECURE WIRELESS COMMUNICATION DISCRIMINATORY CHANNEL ESTIMATION—BASIC CONCEPT DCE VIA FEEDBACK AND RETRAINING TWO-STAGE FEEDBACK-AND-RETRAINING MULTIPLE-STAGE FEEDBACK AND RETRAINING SIMULATION RESULTS AND DISCUSSIONS DISCRIMINATORY CHANNEL ESTIMATION VIA TWO-WAY TRAINING TWO-WAY DCE DESIGN FOR RECIPROCAL CHANNELS TWO-WAY DCE DESIGN FOR NONRECIPROCAL CHANNELS CONCLUSIONS AND DISCUSSIONS PHYSICAL LAYER SECURITY IN OFDMA NETWORKS RELATED WORKS ON SECURE OFDM/OFDM NETWORKS SECURE OFDM CHANNEL SECURE OFDMA CELLULAR NETWORKS SECURE OFDMA RELAY NETWORKS SECURE OFDM WITH IMPLEMENTATION ISSUES BASICS OF RESOURCE ALLOCATION FOR SECRET COMMUNICATIONS POWER ALLOCATION LAW FOR SECRECY MULTIPLE EAVESDROPPERS RESOURCE ALLOCATION FOR PHYSICAL LAYER SECURITY IN OFDMA NETWORKS PROBLEM FORMULATION OPTIMAL POLICY SUBOPTIMAL ALGORITHM COMPLEXITY NUMERICAL EXAMPLES DISCUSSION ON FALSE CSI FEEDBACK CONCLUSIONS AND OPEN ISSUES THE APPLICATION OF COOPERATIVE TRANSMISSIONS TO SECRECY COMMUNICATIONS WHEN ALL NODES ARE EQUIPPED WITH A SINGLE ANTENNA COOPERATIVE JAMMING RELAY CHATTING MIMO RELAY SECRECY COMMUNICATION SCENARIOS WHEN CSI OF EAVESDROPPERS IS KNOWN WHEN CSI OF EAVESDROPPERS IS UNKNOWN 10 GAME THEORY FOR PHYSICAL LAYER SECURITY ON INTERFERENCE CHANNELS 10 1 INTRODUCTION 10 2 SYSTEM MODELS AND SCENARIOS 10 2 1 STANDARD MISO INTERFERENCE CHANNEL 10 2 2 MISO INTERFERENCE CHANNEL WITH PRIVATE MESSAGES 10 2 3 MISO INTERFERENCE CHANNEL WITH PUBLIC FEEDBACK AND PRIVATE MESSAGES 10 2 4 DISCUSSION AND COMPARISON OF SCENARIOS 10 3 NONCOOPERATIVE SOLUTIONS 10 3 1 NONCOOPERATIVE GAMES IN STRATEGIC FORM 10 3 2 SOLUTION FOR THE MISO INTERFERENCE CHANNEL SCENARIOS 10 4 COOPERATIVE SOLUTIONS 10 4 1 BARGAINING SOLUTIONS 10 4 2 NASH BARGAINING SOLUTION 10 4 3 BARGAINING ALGORITHM IN THE EDGEWORTH BOX 10 4 4 WALRAS EQUILIBRIUM SOLUTION 10 5 ILLUSTRATIONS AND DISCUSSIONS 10 5 1 COMPARISON OF UTILITY REGIONS 10 5 2 NONCOOPERATIVE AND COOPERATIVE OPERATING POINTS 10 5 3 BARGAINING ALGORITHM BEHAVIOR 10 6 CONCLUSIONS 10 7 APPENDIX: PROOFS 10 7 1 PROOF OF THEOREM 10 3 1 10 7 2 PROOF OF THEOREM 10 4 1 10 7 3 PROOF OF THEOREM 10 4 2 10 7 4 PROOF OF THEOREM 10 4 3 11 ASCENDING CLOCK AUCTION FOR PHYSICAL LAYER SECURITY 11 1 INTRODUCTION 11 1 1 COOPERATIVE JAMMING FOR PHYSICAL LAYER SECURITY 11 1 2 GAME THEORY-BASED JAMMING POWER ALLOCATION 11 1 3 ASCENDING AUCTIONS 11 1 4 CHAPTER OUTLINE 11 2 SYSTEM MODEL AND PROBLEM FORMULATION 11 2 1 SYSTEM MODEL 11 2 2 SOURCE’S UTILITY FUNCTION 11 2 3 JAMMER’S UTILITY FUNCTION 11 3 AUCTION-BASED JAMMING POWER ALLOCATION SCHEMES 11 3 1 POWER ALLOCATION SCHEME BASED ON SINGLE OBJECT PAY-AS-BID ASCENDING CLOCK AUCTION (P-ACA-S) 11 3 2 POWER ALLOCATION SCHEME BASED ON TRADITIONAL ASCENDING CLOCK AUCTION (P-ACA-T) 11 3 3 POWER ALLOCATION SCHEME BASED ON ALTERNATIVE ASCENDING CLOCK AUCTION (P-ACA-A) 11 4 PROPERTIES OF THE PROPOSED AUCTION-BASED POWER ALLOCATION SCHEMES 11 4 1 OPTIMAL JAMMING POWER FOR EACH SOURCE 11 4 2 CONVERGENCE 11 4 3 CHEAT-PROOF 11 4 4 SOCIAL WELFARE MAXIMIZATION 11 4 5 COMPLEXITY AND OVERHEAD 11 5 CONCLUSIONS AND OPEN ISSUES 12 RELAY AND JAMMER COOPERATION AS A COALITIONAL GAME 12 1 INTRODUCTION 12 1 1 COOPERATIVE RELAYING AND COOPERATIVE JAMMING 12 1 2 RELAY AND JAMMER SELECTION 12 1 3 COALITIONAL GAME THEORY 12 1 4 CHAPTER OUTLINE 12 2 SYSTEM MODEL AND PROBLEM FORMULATION 12 3 RELAY AND JAMMER COOPERATION AS A COALITIONAL GAME 12 3 1 COALITIONAL GAME DE?NITION 12 3 2 PROPERTIES OF THE PROPOSED COALITIONAL GAME 12 4 COALITION FORMATION ALGORITHM 12 4 1 COALITION FORMATION CONCEPTS 12 4 2 MERGE-AND-SPLIT COALITION FORMATION ALGORITHM 12 5 CONCLUSIONS AND OPEN ISSUES 13 STOCHASTIC GEOMETRY APPROACHES TO SECRECY IN LARGE WIRELESS NETWORKS 13 1 INTRODUCTION 13 1 1 MOTIVATION 13 1 2 STOCHASTIC GEOMETRY APPROACHES 13 2 SECRECY GRAPH 13 2 1 NETWORK AND GRAPH MODEL 13 2 2 LOCAL CONNECTIVITY PROPERTIES 13 2 3 GLOBAL CONNECTIVITY PROPERTIES 13 2 4 CONNECTIVITY ENHANCEMENTS 13 3 SECRECY TRANSMISSION CAPACITY 13 3 1 NETWORK MODEL 13 3 2 CAPACITY FORMULATION 13 3 3 ILLUSTRATIVE EXAMPLE 13 4 CURRENT LIMITATIONS AND FUTURE DIRECTIONS 14 PHYSICAL LAYER SECRECY IN LARGE MULTIHOP WIRELESS NETWORKS 14 1 INTRODUCTION 14 2 BACKGROUND: PHYSICAL LAYER SECURITY IN ONE-HOP NETWORKS 14 3 SECURE CONNECTIVITY: THE SECRECY GRAPH 14 4 SECURE CAPACITY 14 4 1 BACKGROUND: THROUGHPUT SCALING IN LARGE WIRELESS NETWORKS 14 4 2 SECRECY SCALING WITH KNOWN EAVESDROPPER LOCATIONS 14 4 3 SECRECY SCALING WITH UNKNOWN EAVESDROPPER LOCATIONS 14 5 CONCLUSION AND FUTURE WORK