Searcharxiv⌕ Search

arXiv subjects

Manuel Fernández-Veiga

Publications and source records attributed to Manuel Fernández-Veiga.

At least 37 records · Page 2Linked to original sources

Privacy-aware Berrut Approximated Coded Computing applied to general distributed learning

Coded computing is one of the techniques that can be used for privacy protection in Federated Learning. However, most of the constructions used for coded computing work only under the assumption that the computations involved are exact, generally restricted to special classes of functions, and require quantized inputs. This paper considers the use of Private Berrut Approximate Coded Computing (PBACC) as a general solution to add strong but non-perfect privacy to federated learning. We derive new adapted PBACC algorithms for centralized aggregation, secure distributed training with centralized data, and secure decentralized training with decentralized data, thus enlarging significantly the applications of the method and the existing privacy protection tools available for these paradigms. Particularly, PBACC can be used robustly to attain privacy guarantees in decentralized federated learning for a variety of models. Our numerical results show that the achievable quality of different learning models (convolutional neural networks, variational autoencoders, and Cox regression) is minimally altered by using these new computing schemes, and that the privacy leakage can be bounded strictly to less than a fraction of one bit per participant. Additionally, the computational cost of the encoding and decoding processes depends only of the degree of decentralization of the data.

cs.LG↗

Onion Routing Key Distribution for QKDN

The advance of quantum computing poses a significant threat to classical cryptography, compromising the security of current encryption schemes such as RSA and ECC. In response to this challenge, two main approaches have emerged: quantum cryptography and post-quantum cryptography (PQC). However, both have implementation and security limitations. In this paper, we propose a secure key distribution protocol for Quantum Key Distribution Networks (QKDN), which incorporates encapsulation techniques in the key-relay model for QKDN inspired by onion routing and combined with PQC to guarantee confidentiality, integrity, authenticity and anonymity in communication. The proposed protocol optimizes security by using post-quantum public key encryption to protect the shared secrets from intermediate nodes in the QKDN, thereby reducing the risk of attacks by malicious intermediaries. Finally, relevant use cases are presented, such as critical infrastructure networks, interconnection of data centers and digital money, demonstrating the applicability of the proposal in critical high-security environments.

cs.CR↗

Introducing Post-Quantum algorithms in Open RAN interfaces

Nowadays, 5G architecture is characterized by the use of monolithic hardware, where the configuration of its elements is completely proprietary for each manufacturer. In recent years, as an alternative to this centralized architecture, a new model has emerged: the Open Radio Access Network (Open RAN). One of its main features has been the split of the Base Band Unit (BBU) into new simpler hardware with more specific functions approaching to a more modular model. As a consequence of this split, new interfaces appeared to connect these components that need to be protected. With the developments in the field of quantum computing, traditional protection mechanisms for this kind of interfaces may be deprecated in the near future. This security issue motivates this paper, which aims to study how to integrate post-quantum cryptography (PQC) mechanisms to current security standards, such as IPsec and MACsec. In addition, the proposal is also put into practice to compare the performance of traditional mechanisms with PQC implementations. This research shows that the new implementation does not reduce the performance of the aforementioned standards, while the security is reinforced against quantum attacks.

cs.CR↗

Simulation of fidelity in entanglement-based networks with repeater chains

We implement a simulation environment on top of NetSquid that is specifically designed for estimating the end-to-end fidelity across a path of quantum repeaters or quantum switches. The switch model includes several generalizations which are not currently available in other tools, and are useful for gaining insight into practical and realistic quantum network engineering problems: an arbitrary number of memory registers at the switches, simplicity in including entanglement distillation mechanisms, arbitrary switching topologies, and more accurate models for the depolarization noise. An illustrative case study is presented, namely a comparison in terms of performance between a repeater chain where repeaters can only swap sequentially, and a single switch equipped with multiple memory registers, able to handle multiple swapping requests.

quant-ph↗

QKDNetSim+: Improvement of the Quantum Network Simulator for NS-3

The first Quantum Key Distribution (QKD) networks are currently being deployed, but the implementation cost is still prohibitive for most researchers. As such, there is a need for realistic QKD network simulators. The \textit{QKDNetSim} module for the network simulator NS-3 focuses on the representation of packets and the management of key material in a QKD network at the application layer. Although QKDNetSim's representation of a QKD network is insightful, some its components lack the depth that would allow the simulator to faithfully represent the behaviour of a real quantum network. In this work, we analyse QKDNetSim's architecture to identify its limitations, and we present an enhanced version of QKDNetSim in which some of its components have been modified to provide a more realistic simulation environment.

cs.NI↗

A Privacy-preserving key transmission protocol to distribute QRNG keys using zk-SNARKs

High-entropy random numbers are an essential part of cryptography, and Quantum Random Number Generators (QRNG) are an emergent technology that can provide high-quality keys for cryptographic algorithms but unfortunately are currently difficult to access. Existing Entropy-as-a-Service solutions require users to trust the central authority distributing the key material, which is not desirable in a high-privacy environment. In this paper, we present a novel key transmission protocol that allows users to obtain cryptographic material generated by a QRNG in such a way that the server is unable to identify which user is receiving each key. This is achieved with the inclusion of Zero Knowledge Succinct Non-interactive Arguments of Knowledge (zk-SNARK), a cryptographic primitive that allow users to prove knowledge of some value without needing to reveal it. The security analysis of the protocol proves that it satisfies the properties of Anonymity, Unforgeability and Confidentiality, as defined in this document. We also provide an implementation of the protocol demonstrating its functionality and performance, using NFC as the transmission channel for the QRNG key.

cs.CR↗

Decentralised and collaborative machine learning framework for IoT

Decentralised machine learning has recently been proposed as a potential solution to the security issues of the canonical federated learning approach. In this paper, we propose a decentralised and collaborative machine learning framework specially oriented to resource-constrained devices, usual in IoT deployments. With this aim we propose the following construction blocks. First, an incremental learning algorithm based on prototypes that was specifically implemented to work in low-performance computing elements. Second, two random-based protocols to exchange the local models among the computing elements in the network. Finally, two algorithmics approaches for prediction and prototype creation. This proposal was compared to a typical centralized incremental learning approach in terms of accuracy, training time and robustness with very promising results.

cs.LG↗

Irregular Repetition Slotted Aloha with Multipacket Detection: A Density Evolution Analysis

Irregular repetition slotted Aloha (IRSA) has shown significant advantages as a modern technique for uncoordinated random access with massive number of users due to its capability of achieving theoretically a throughput of $1$ packet per slot. When the receiver has also the multi-packet reception of multi-user (MUD) detection property, by applying successive interference cancellation, IRSA also obtains very low packet loss probabilities at low traffic loads, but is unable in general to achieve a normalized throughput close to the $1$. In this paper, we reconsider the case of IRSA with $k$-MUD receivers and derive the general density evolution equations for the non-asymptotic analysis of the packet loss rate, for arbitrary frame lengths and two variants of the first slot used for transmission. Next, using the potential function, we give new capacity bounds on the capacity of the system, showing the threshold arrival rate for zero decoding error probability. Our numerical results illustrate performance in terms of throughput and average delay for $k$-MUD IRSA with finite memory at the receiver, and also with bounded maximum delay.

cs.IT↗

Scheduling and Communication Schemes for Decentralized Federated Learning

Federated learning (FL) is a distributed machine learning paradigm in which a large number of clients coordinate with a central server to learn a model without sharing their own training data. One central server is not enough, due to problems of connectivity with clients. In this paper, a decentralized federated learning (DFL) model with the stochastic gradient descent (SGD) algorithm has been introduced, as a more scalable approach to improve the learning performance in a network of agents with arbitrary topology. Three scheduling policies for DFL have been proposed for communications between the clients and the parallel servers, and the convergence, accuracy, and loss have been tested in a totally decentralized mplementation of SGD. The experimental results show that the proposed scheduling polices have an impact both on the speed of convergence and in the final global model.

cs.LG↗

Using Decentralized Aggregation for Federated Learning with Differential Privacy

Nowadays, the ubiquitous usage of mobile devices and networks have raised concerns about the loss of control over personal data and research advance towards the trade-off between privacy and utility in scenarios that combine exchange communications, big databases and distributed and collaborative (P2P) Machine Learning techniques. On the other hand, although Federated Learning (FL) provides some level of privacy by retaining the data at the local node, which executes a local training to enrich a global model, this scenario is still susceptible to privacy breaches as membership inference attacks. To provide a stronger level of privacy, this research deploys an experimental environment for FL with Differential Privacy (DP) using benchmark datasets. The obtained results show that the election of parameters and techniques of DP is central in the aforementioned trade-off between privacy and utility by means of a classification example.

cs.LG↗

Energy Efficient Power and Channel Allocation in Underlay Device to Multi Device Communications

In this paper, we optimize the energy efficiency (bits/s/Hz/J) of device-to-multi-device (D2MD) wireless communications. While the device-to-device scenario has been extensively studied to improve the spectral efficiency in cellular networks, the use of multicast communications opens the possibility of reusing the spectrum resources also inside the groups. The optimization problem is formulated as a mixed integer non-linear joint optimization for the power control and allocation of resource blocks (RBs) to each group. Our model explicitly considers resource sharing by letting co-channel transmission over a RB (up to a maximum of r transmitters) and/or transmission through s different channels in each group. We use an iterative decomposition approach, using first matching theory to find a stable even if sub-optimal channel allocation, to then optimize the transmission power vectors in each group via fractional programming. Additionally, within this framework, both the network energy efficiency and the max-min individual energy efficiency are investigated. We characterize numerically the energy-efficient capacity region, and our results show that the normalized energy efficiency is nearly optimal (above 90 percent of the network capacity) for a wide range of minimum-rate constraints. This performance is better than that of other matching-based techniques previously proposed.

cs.NI↗

Dynamic EEE Coalescing: Techniques and Bounds

Frame coalescing is one of the most efficient techniques to manage the low power idle (LPI) mode supported by Energy Efficient Ethernet (EEE) interfaces. This technique enables EEE interfaces to remain in the LPI mode for a certain amount of time upon the arrival of the first frame (time-based coalescing) or until a predefined amount of traffic accumulates in the transmission buffer (size-based coalescing). This paper provides new insights on the practical efficiency limits of both coalescing techniques. In particular, we derive the fundamental limits on the maximum energy savings considering a target average frame delay. Additionally, we present new open-loop adaptive variants of both time-based and size-based coalescing techniques. These proposals dynamically adjust the length of the sleeping periods in accordance with actual traffic conditions to reduce energy consumption while keeping the average delay near a predefined value simultaneously. Analytical and simulation results show that the energy consumption of both proposals is comparable to the fundamental limits. Consequently, we recommend the usage of the time-based algorithm in most scenarios because of its simplicity as well as its ability to bound the maximum frame delay at the same time.

cs.NI↗

Frame Coalescing in Dual-Mode EEE

The IEEE has recently released the 802.3bj standard that defines two different low power operating modes for high speed Energy Efficient Ethernet physical interfaces (PHYs) working at 40 and 100 Gb/s. In this paper, we propose the use of the well-known frame coalescing algorithm to manage them and provide an analytical model to evaluate the influence of coalescing parameters and PHY characteristics on their power consumption.

cs.NI↗

Adaptive DRX Scheme to Improve Energy Efficiency in LTE Networks with Bounded Delay

The Discontinuous Reception (DRX) mechanism is commonly employed in current LTE networks to improve energy efficiency of user equipment (UE). DRX allows UEs to monitor the physical downlink control channel (PDCCH) discontinuously when there is no downlink traffic for them, thus reducing their energy consumption. However, DRX power savings are achieved at the expense of some increase in packet delay since downlink traffic transmission must be deferred until the UEs resume listening to the PDCCH. In this paper, we present a promising mechanism that reduces energy consumption of UEs using DRX while simultaneously maintaining average packet delay around a desired target. Furthermore, our proposal is able to achieve significant power savings without either increasing signaling overhead or requiring any changes to deployed wireless protocols.

cs.NI↗

The persistent congestion problem of FAST-TCP: analysis and solutions

FAST-TCP achieves better performance than traditional TCP-Reno schemes, but unfortunately it is inherently unfair to older connections due to wrong estimations of the round-trip propagation delay. This paper presents a model for this anomalous behavior of FAST flows, known as the persistent congestion problem. We first develop an elementary analysis for a scenario with just two flows, and then build up the general case with an arbitrary number of flows. The model correctly quantifies how much unfairness shows up among the different connections, confirming experimental observations made by several previous studies. We built on this model to develop an algorithm to obtain a good estimate of the propagation delay for FAST-TCP that enables to achieve fairness between aged and new connections while preserving the high throughput and low buffer occupancy of the original protocol. Furthermore, our proposal only requires a modification of the sender host, avoiding the need to upgrade the intermediate routers in any way.

cs.NI↗

A Self-Tuning Receiver-Initiated MAC Protocol for Wireless Sensor Networks

Receiver-initiated medium access control protocols for wireless sensor networks are theoretically able to adapt to changing network conditions in a distributed manner. However, existing algorithms rely on fixed beacon rates at each receiver. We present a new received initiated MAC protocol that adapts the beacon rate at each receiver to its actual traffic load. Our proposal uses a computationally inexpensive formula for calculating the optimum beacon rate that minimizes network energy consumption and, so, it can be easily adopted by receivers. Simulation results show that our proposal reduces collisions and diminishes delivery time maintaining a low duty cycle.

cs.NI↗

Improved Opportunistic Sleeping Algorithms for LAN Switches

Network interfaces in most LAN computing devices are usually severely under-utilized, wasting energy while waiting for new packets to arrive. In this paper, we present two algorithms for opportunistically powering down unused network interfaces in order to save some of that wasted energy. We compare our proposals to the best known opportunistic method, and show that they provide much greater power savings inflicting even lower delays to Internet traffic.

cs.NI↗

Achieving Fair Network Equilibria with Delay-based Congestion Control Algorithms

Delay-based congestion control algorithms provide higher throughput and stability than traditional loss-based AIMD algorithms, but they are inherently unfair against older connections when the queuing and the propagation delay cannot be measured accurately and independently. This paper presents a novel measurement algorithm whereby fairness between old and new connections is preserved. The algorithm does not modify the dynamics of congestion control, and runs entirely in the server host using locally available information.

cs.NI↗