University of Maryland University College
Consider the transmission of a message from one party (Alice) to another (Bob), such that it is kept secret from an eavesdropping adversary (Eve). Cryptographic solutions assume that Eve will intercept the transmitted signal cleanly but impose a hard mathematical problem on Eve that is beyond her computational power to solve. The authors study the wireless secrecy capacity scaling problem where the question of interest is how much information can be shared among n randomly located nodes such that the throughput is kept information-theoretically secure from m eavesdroppers also present in the network. They present achievable scaling results for both one-dimensional and two-dimensional networks.