Visible to the public Biblio

Filters: Author is Frank, Anna  [Clear All Filters]
2022-12-01
Torres-Figueroa, Luis, Mönich, Ullrich J., Voichtleitner, Johannes, Frank, Anna, Andrei, Vlad-Costin, Wiese, Moritz, Boche, Holger.  2021.  Experimental Evaluation of a Modular Coding Scheme for Physical Layer Security. 2021 IEEE Global Communications Conference (GLOBECOM). :1–6.
In this paper we use a seeded modular coding scheme for implementing physical layer security in a wiretap scenario. This modular scheme consists of a traditional coding layer and a security layer. For the traditional coding layer, we use a polar code. We evaluate the performance of the seeded modular coding scheme in an experimental setup with software defined radios and compare these results to simulation results. In order to assess the secrecy level of the scheme, we employ the distinguishing security metric. In our experiments, we compare the distinguishing error rate for different seeds and block lengths.
2020-04-06
Frank, Anna, Aydinian, Harout, Boche, Holger.  2019.  Delay Optimal Coding for Secure Transmission over a Burst Erasure Wiretap Channel. 2019 IEEE Wireless Communications and Networking Conference (WCNC). :1—7.

We consider transmissions of secure messages over a burst erasure wiretap channel under decoding delay constraint. For block codes we introduce and study delay optimal secure burst erasure correcting (DO-SBE) codes that provide perfect security and recover a burst of erasures of a limited length with minimum possible delay. Our explicit constructions of DO-SBE block codes achieve maximum secrecy rate. We also consider a model of a burst erasure wiretap channel for the streaming setup, where in any sliding window of a given size, in a stream of encoded source packets, the eavesdropper is able to observe packets in an interval of a given size. For that model we obtain an information theoretic upper bound on the secrecy rate for delay optimal streaming codes. We show that our block codes can be used for construction of delay optimal burst erasure correcting streaming codes which provide perfect security and meet the upper bound for a certain class of code parameters.