Biblio
Filters: Author is Tomasin, Stefano [Clear All Filters]
Virtual Private Mobile Network with Multiple Gateways for B5G Location Privacy. 2021 IEEE 94th Vehicular Technology Conference (VTC2021-Fall). :1–6.
.
2021. In a beyond-5G (B5G) scenario, we consider a virtual private mobile network (VPMN), i.e., a set of user equipments (UEs) directly communicating in a device-to-device (D2D) fashion, and connected to the cellular network by multiple gateways. The purpose of the VPMN is to hide the position of the VPMN UEs to the mobile network operator (MNO). We investigate the design and performance of packet routing inside the VPMN. First, we note that the routing that maximizes the rate between the VPMN and the cellular network leads to an unbalanced use of the gateways by each UE. In turn, this reveals information on the location of the VPMN UEs. Therefore, we derive a routing algorithm that maximizes the VPMN rate, while imposing for each UE the same data rate at each gateway, thus hiding the location of the UE. We compare the performance of the resulting solution, assessing the location privacy achieved by the VPMN, and considering both the case of single hop and multihop in the transmissions from the UEs to the gateways.
Topology-based Secret Key Generation for Underwater Acoustic Networks. 2021 Fifth Underwater Communications and Networking Conference (UComms). :1—5.
.
2021. We propose a method to let a source and a destination agree on a key that remains secret to a potential eavesdropper in an underwater acoustic network (UWAN). We generate the key from the propagation delay measured over a set of multihop routes: this harvests the randomness in the UWAN topology and turns the slow sound propagation in the water into an advantage for the key agreement protocol. Our scheme relies on a route discovery handshake. During this process, all intermediate relays accumulate message processing delays, so that both the source and the destination can compute the actual propagation delays along each route, and map this information to a string of bits. Finally, via a secret key agreement from the information-theoretic security framework, we obtain an equal set of bits at the source and destination, which is provably secret to a potential eavesdropper located away from both nodes. Our simulation results show that, even for small UWANs of 4 nodes, we obtain 11 secret bits per explored topology, and that the protocol is insensitive to an average node speed of up to 0.5 m/s.