| dc.contributor.author | Pavlicek, Parker | |
| dc.description.abstract | We provide a set of semantically secure achievable rates for the fast fading wiretap channel. In particular, we do so for the cases where there is channel state information at the transmitter (CSIT) for both the main and eavesdropper channels (full CSIT), for only the main channel (partial CSIT), and for neither channel (statistical CSIT). In the case of partial CSIT and statistical CSIT fast-fading channels, we show that this coding scheme can achieve the best known achievable rates. In the case of full CSIT fast-fading wiretap channels, we show that this coding scheme can actually achieve the secrecy capacity. In particular, this implies that the semantic secrecy capacity for these channels is equivalent to the weak and strong secrecy capacities. Moreover, we achieve these rates in a way that is non-invasive to existing systems and also happens to be explicitly given as well as efficient in implementation. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU Policy 190.6.2 | |
| dc.title | Semantic Security for the Fast Fading Wiretap Channel. | en_US |
| dc.type | Thesis | en_US |
| dc.date.accessioned | 2018-07-31T13:46:43Z | |
| dc.date.available | 2018-07-31T13:46:43Z | |
| dc.date.issued | 2018 | en_US |
| dc.identifier.uri | https://hdl.handle.net/10365/28742 | |
| dc.identifier.orcid | 0000-0002-0587-9128 | |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | |
| ndsu.degree | Master of Science (MS) | en_US |
| ndsu.college | Engineering | en_US |
| ndsu.department | Electrical and Computer Engineering | en_US |
| ndsu.program | Electrical and Computer Engineering | en_US |
| ndsu.advisor | Karmakar, Sanjay | |
