SearcharxivSearch

arXiv subjects

Paulo Mendes

Publications and source records attributed to Paulo Mendes.

At least 19 recordsLinked to original sources

MeAJOR Corpus: A Multi-Source Dataset for Phishing Email Detection

Phishing emails continue to pose a significant threat to cybersecurity by exploiting human vulnerabilities through deceptive content and malicious payloads. While Machine Learning (ML) models are effective at detecting phishing threats, their performance largely relies on the quality and diversity of the training data. This paper presents MeAJOR (Merged email Assets from Joint Open-source Repositories) Corpus, a novel, multi-source phishing email dataset designed to overcome critical limitations in existing resources. It integrates 135894 samples representing a broad number of phishing tactics and legitimate emails, with a wide spectrum of engineered features. We evaluated the dataset's utility for phishing detection research through systematic experiments with four classification models (RF, XGB, MLP, and CNN) across multiple feature configurations. Results highlight the dataset's effectiveness, achieving 98.34% F1 with XGB. By integrating broad features from multiple categories, our dataset provides a reusable and consistent resource, while addressing common challenges like class imbalance, generalisability and reproducibility.

cs.CR

Intelligent Green Efficiency for Intrusion Detection

Artificial Intelligence (AI) has emerged in popularity recently, recording great progress in various industries. However, the environmental impact of AI is a growing concern, in terms of the energy consumption and carbon footprint of Machine Learning (ML) and Deep Learning (DL) models, making essential investigate Green AI, an attempt to reduce the climate impact of AI systems. This paper presents an assessment of different programming languages and Feature Selection (FS) methods to improve computation performance of AI focusing on Network Intrusion Detection (NID) and cyber-attack classification tasks. Experiments were conducted using five ML models - Random Forest, XGBoost, LightGBM, Multi-Layer Perceptron, and Long Short-Term Memory - implemented in four programming languages - Python, Java, R, and Rust - along with three FS methods - Information Gain, Recursive Feature Elimination, and Chi-Square. The obtained results demonstrated that FS plays an important role enhancing the computational efficiency of AI models without compromising detection accuracy, highlighting languages like Python and R, that benefit from a rich AI libraries environment. These conclusions can be useful to design efficient and sustainable AI systems that still provide a good generalization and a reliable detection.

cs.CR

Quantum Internet: Resource Estimation for Entanglement Routing

Quantum repeaters have promised efficient scaling of quantum networks for over two decades. Despite numerous platforms proclaiming functional repeaters, the realization of large-scale networks remains elusive, indicating that the resources required to do so were thus far underestimated. Here, we investigate the dependence of resource scaling of networks on realistic experimental errors. Using a nested repeater protocol based on the purification protocol by Bennett et. al., we provide an analytical approximation of the polynomial degree of the resources consumed by entanglement routing. Our error model predicts substantially stricter thresholds for efficient network operation than previously suggested, requiring two-qubit gate errors below 1.3% for resource scaling with polynomial degree below 10. The analytical model presented here provides insight into the reason why previous experimental implementations of quantum repeaters failed to scale efficiently and inform the development of truly scalable systems, highlighting the need for high-fidelity local two-qubit gates. We employ our analytical approximation of the scaling exponent as a figure of merit to compare different platforms and find that trapped ions and color centers in diamond currently provide the best route towards large-scale networks.

quant-ph

Relaxing Trust Assumptions on Quantum Key Distribution Networks

Quantum security over long distances with untrusted relays is largely unfounded and is still an open question for active research. Nevertheless, quantum networks based on trusted relays are being built across the globe. However, standard QKD network architecture implores a complete trust requirement on QKD relays, which is too demanding and limits the use cases for QKD networks. In this work, we explore the possibility to securely relay a secret in a QKD network by relaxing the trust assumptions (if not completely) on the relay. We characterize QKD relays with different trust levels, namely, Full Access Trust (FAT), Partial Access Trust (PAT), and No Access Trust (NAT). As the name suggests, each level defines the degree with which a relay is required to be trusted with the secret provided by the key management system for end-to-end communication. We then review and propose multiple constructions of the QKD key management system based on the different trust levels. Main contribution of the paper is realized by evaluating key management systems with no access trust level. In principle, we review key management with centralized topology and propose a new decentralized key management system. These different topologies provide various advantages based on the QKD network requirements, allowing an operational flexibility in the architecture. We believe this work presents a new perspective to the open problem of providing a confiding and a practical solution for future long range secure communications

quant-ph

Scalable Resource Provisioning for Multi-user Communications in Next Generation Networks

The great demand for real-time multimedia sessions encompassing groups of users (multi-user), associated with the limitations of the current Internet in providing quality assurance, has raised challenges for defining the best mechanisms to deploy the Next Generation of Networks (NGN). There is a consensus that an efficient and scalable provisioning of network resources is crucial for the success of the NGN, mainly in what concerns access networks. Previous solutions for the control of multi-user sessions rely mostly on uncoordinated actions to allocate per-flow bandwidth and multicast trees. This paper introduces a Multiuser Aggregated Resource Allocation mechanism (MARA) that coordinates the control of class-based bandwidth and multicast resources in a scalable manner. In comparison with previous work, MARA significantly reduces signaling, state and processing overhead. The performance benefits of MARA are analyzed though simulations, which successfully demonstrated the significant optimization in the network performance.

cs.NI

Named Service Networking as a primer for the Metaverse

Ubiquitous extended reality environments such as the Metaverse will have a significant impact on the Internet, which will evolve to interconnect a large number of mixed reality spaces. Currently, Metaverse development is related to the creation of mixed reality environments, not tackling the required networking functionalities. This article analyzes suitable networking design choices to support the Metaverse, proposing a new service-centric networking approach capable of incorporating low-latency data fetching, distributed computing, and fusion of heterogeneous data types over the Cloud-to-Thing continuum.

cs.NI

Passive Sensing and Localization in an Aircraft Cabin Using a Wireless Communication Network

Advances in wireless localization techniques aiming to exploit context-dependent data has been leading to a growing interest in services able of localizing or tracking targets inside buildings with high accuracy and precision. Hence, the demand for indoor localization services has become a key prerequisite in some markets, such as in the aviation sector. In this context, we propose a system to passively localize and track passenger movements inside the cabin of an aircraft in a privacy preserving way using existing communication networks such as Wi-Fi or 5G. The estimated passenger positions can be used for various automation tasks such as measurement of passenger behavior during boarding. The paper describes a novel wireless localization system, based on Artificial Neural Networks, which passively senses the location of passengers. The position estimation is based on the observation of wireless communication signals that are already present in the environment. In this context, "passive" means that no additional devices are needed for the passengers. Experimental results show that the proposed system is able to achieve an average accuracy of 12 cm in a challenging environment like an aircraft cabin. This accuracy seems sufficient to control passenger separation.

cs.NI

Statement: The Metaverse as an Information-Centric Network

This paper discusses challenges and opportunities of considering the Metaverse as an Information-Centric Network (ICN). The Web today essentially represents a data-centric application layer: data named by URLs is manipulated with REST primitives. However, the semantic gap with the underlying host-oriented transport is significant, typically leading to complexity, centralization, and brittleness. Popular interest in "the Metaverse" suggests that the end-user experience of the Web will evolve towards always-on eXtended Reality (XR). With the benefit of a historical perspective, computing advances, and decades of experience with a global network, there is an opportunity to holistically consider the Metaverse not as an application of the current network, but an evolution of the network itself, reducing rather than widening the gap between network architecture and application semantics. An ICN architecture offers the possibility to achieve this with less overhead, low latency, better security, and more disruption tolerance suitable to diverse uses cases, even those facing intermittent connectivity.

cs.NI

NSense: A People-centric, non-intrusive Opportunistic Sensing Tool for Contextualizing Nearness

In the context of social well-being and context awareness several eHealth applications have been focused on tracking activities, such as sleep or specific fitness habits, with the purpose of promoting physical well-being with increasing success. Sensing technology can, however, be applied to improve social well-being, in addition to physical well-being. This paper addresses NSense, a tool that has been developed to capture and to infer social interaction patterns aiming to assist in the promotion of social well-being. Experiments carried out under realistic settings validate the NSense performance in terms of its capability to infer social interaction context based on our proposed computational utility functions. Traces obtained during the experiments are available via the CRAWDAD international trace repository.

cs.NI

Moving Towards a Socially-Driven Internet Architectural Design

This paper provides an interdisciplinary perspective concerning the role of prosumers on future Internet design based on the current trend of Internet user empowerment. The paper debates the prosumer role, and addresses models to develop a symmetric Internet architecture and supply-chain based on the integration of social capital aspects. It has as goal to ignite the discussion concerning a socially-driven Internet architectural design.

cs.CY

Impact of Human Behavior on Social Opportunistic Forwarding

The current Internet design is not capable to support communications in environments characterized by very long delays and frequent network partitions. To allow devices to communicate in such environments, delay-tolerant networking solutions have been proposed by exploiting opportunistic message forwarding, with limited expectations of end-to-end connectivity and node resources. Such solutions envision non-traditional communication scenarios, such as disaster areas and development regions. Several forwarding algorithms have been investigated, aiming to offer the best trade-off between cost (number of message replicas) and rate of successful message delivery. Among such proposals, there has been an effort to employ social similarity inferred from user mobility patterns in opportunistic routing solutions to improve forwarding. However, these research effort presents two major limitations: first, it is focused on distribution of the intercontact time over the complete network structure, ignoring the impact that human behavior has on the dynamics of the network; and second, most of the proposed solutions look at challenging networking environments where networks have low density, ignoring the potential use of delay-tolerant networking to support low cost communications in networks with higher density, such as urban scenarios. This paper presents a study of the impact that human behavior has on opportunistic forwarding. Our goal is twofold: i) to show that performance in low and high density networks can be improved by taking the dynamics of the network into account; and ii) to show that the delay-tolerant networking can be used to reduce communication costs in networks with higher density by taking the behavior of the user into account.

cs.NI

Social-aware Forwarding in Opportunistic Wireless Networks: Content Awareness or Obliviousness?

With the current host-based Internet architecture, networking faces limitations in dynamic scenarios, due mostly to host mobility. The ICN paradigm mitigates such problems by releasing the need to have an end-to-end transport session established during the life time of the data transfer. Moreover, the ICN concept solves the mismatch between the Internet architecture and the way users would like to use it: currently a user needs to know the topological location of the hosts involved in the communication when he/she just wants to get the data, independently of its location. Most of the research efforts aim to come up with a stable ICN architecture in fixed networks, with few examples in ad-hoc and vehicular networks. However, the Internet is becoming more pervasive with powerful personal mobile devices that allow users to form dynamic networks in which content may be exchanged at all times and with low cost. Such pervasive wireless networks suffer with different levels of disruption given user mobility, physical obstacles, lack of cooperation, intermittent connectivity, among others. This paper discusses the combination of content knowledge (e.g., type and interested parties) and social awareness within opportunistic networking as to drive the deployment of ICN solutions in disruptive networking scenarios. With this goal in mind, we go over few examples of social-aware content-based opportunistic networking proposals that consider social awareness to allow content dissemination independently of the level of network disruption. To show how much content knowledge can improve social-based solutions, we illustrate by means of simulation some content-oblivious/oriented proposals in scenarios based on synthetic mobility patterns and real human traces.

cs.NI

Social-aware Opportunistic Routing: The New Trend

Since users move around based on social relationships and interests, the resulting movement patterns can represent how nodes are socially connected (i.e., nodes with strong social ties, nodes that meet occasionally by sharing the same working environment). This means that social interactions reflect personal relationships (e.g., family, friends, co-workers, passers-by) that may be translated into statistical contact opportunities within and between social groups over time. Such contact opportunities may be exploited to ensure good data dissemination and retrieval, even in the presence of intermittent connectivity. Thus, in the last years, a new trend based on social similarity emerged where social relationships, interests, popularity and among others, are used to improve opportunistic routing. In this chapter, the reader will learn about the different approaches related to opportunistic routing focusing on the social-aware approaches and how such approaches make use of social information derived from opportunistic contacts to improve data forwarding. Additionally, a brief overview on the existing taxonomies for opportunistic routing as well as an updated one are provided along with a set of experiments in scenarios based on synthetic mobility models and human traces in order to show the potential of social-aware solutions.

cs.NI

Social-aware Opportunistic Routing Protocol based on User's Interactions and Interests

Nowadays, routing proposals must deal with a panoply of heterogeneous devices, intermittent connectivity, and the users' constant need for communication, even in rather challenging networking scenarios. Thus, we propose a Social-aware Content-based Opportunistic Routing Protocol, SCORP, that considers the users' social interaction and their interests to improve data delivery in urban, dense scenarios. Through simulations, using synthetic mobility and human traces scenarios, we compare the performance of our solution against other two social-aware solutions, dLife and Bubble Rap, and the social-oblivious Spray and Wait, in order to show that the combination of social awareness and content knowledge can be beneficial when disseminating data in challenging networks.

cs.NI

Assessment Model for Opportunistic Routing (LatinCom)

Due to the increased capabilities of mobile devices and through wireless opportunistic contacts, users can experience new ways to share and retrieve content anywhere and anytime, even in the presence of link intermittency. Due to the significant number of available routing solutions, it is difficult to understand which one has the best performance, since all of them follow a different evaluation method. This paper proposes an assessment model, based on a new taxonomy, which comprises an evaluation guideline with performance metrics and experimental setup to aid designers in evaluating solutions through fair comparisons. Simulation results based on the proposed model revisit the performance results published by Epidemic, PROPHET, and Bubble Rap, showing how they perform under the same set of metrics and scenario.

cs.NI

Opportunistic Routing Based on Daily Routines

Opportunistic routing is being investigated to enable the proliferation of low-cost wireless applications. A recent trend is looking at social structures, inferred from the social nature of human mobility, to bring messages close to a destination. To have a better picture of social structures, social-based opportunistic routing solutions should consider the dynamism of users' behavior resulting from their daily routines. We address this challenge by presenting dLife, a routing algorithm able to capture the dynamics of the network represented by time-evolving social ties between pair of nodes. Experimental results based on synthetic mobility models and real human traces show that dLife has better delivery probability, latency, and cost than proposals based on social structures.

cs.NI

SocialDTN: A DTN implementation for Digital and Social Inclusion

Despite of the importance of access to computers and to the Internet for the development of people and their inclusion in society, there are people that still suffer with digital divide and social exclusion. Delay/Disruption-Tolerant Networking (DTN) can help the digital/social inclusion of these people as it allows opportunistic and asynchronous communication, which does not depend upon networking infrastructure. We introduce SocialDTN, an implementation of the DTN architecture for Android devices that operates over Bluetooth, taking advantages of the social daily routines of users. As we want to exploit the social proximity and interactions existing among users, SocialDTN includes a social-aware opportunistic routing proposal, dLife, instead of the well-known (but social-oblivious) PROPHET. Simulations show the potential of dLife for our needs. Additionally, some preliminary results from field experimentations are presented.

cs.NI

Assessment Model for Opportunistic Routing

This paper proposes an assessment model, based on a new taxonomy, which comprises an evaluation guideline with performance metrics and experimental setup to aid designers in evaluating solutions through fair comparisons. Simulation results are provided based on the proposed model considering Epidemic, PROPHET, Bubble Rap, and Spray and Wait, and showing how they perform under the same set of metrics and scenario

cs.NI