Abstract
This paper presents a new technique for providing the analysis and comparison of wiretap codes in the small blocklength regime over the binary erasure wiretap channel. A major result is the development of Monte Carlo strategies for quantifying a code's equivocation, which mirrors techniques used to analyze forward error correcting codes. For this paper, we limit our analysis to coset-based wiretap codes, and give preferred strategies for calculating and/or estimating the equivocation in order of preference. We also make several comparisons of different code families. Our results indicate that there are security advantages to using algebraic codes for applications that require small to medium blocklengths. © 2017 IEEE.

Abstract
The collection and analysis of data are continuously growing due to the pervasiveness of computing devices. The analysis of such information is fostering businesses and contributing beneficially to the society in many different fields. However, this storage and flow of possibly sensitive data poses serious privacy concerns. Methods that allow the knowledge extraction from data, while preserving privacy, are known as privacy-preserving data mining (PPDM) techniques. This paper surveys the most relevant PPDM techniques from the literature and the metrics used to evaluate such techniques and presents typical applications of PPDM methods in relevant fields. Furthermore, the current challenges and open issues in PPDM are discussed. © 2017 IEEE.

Abstract
This paper presents a new technique for providing the analysis and comparison of wiretap codes in the small blocklength regime over the binary erasure wiretap channel. A major result is the development of Monte Carlo strategies for quantifying a code's equivocation, which mirrors techniques used to analyze forward error correcting codes. For this paper, we limit our analysis to coset-based wiretap codes, and give preferred strategies for calculating and/or estimating the equivocation in order of preference. We also make several comparisons of different code families. Our results indicate that there are security advantages to using algebraic codes for applications that require small to medium blocklengths.

Abstract
The exploration of the physical layer characteristics of the wireless channel is currently the object of intensive research in order to develop advanced secrecy schemes that can protect information against eavesdropping attacks. Following this line of work, in this manuscript we consider a massive MIMO system and jointly design the channel precoder and security scheme. By doing that we ensure that the precoding operation does not reduce the degree of secrecy provided by the security scheme. The fundamental working principle of the proposed technique is to apply selective random rotations in the transmitted signal at the antenna level in order to achieve a compromise between legitimate and eavesdropper channel capacities. These rotations use the phase of the reciprocal wireless channel as a common random source between the transmitter and the intended receiver. To assess the security performance, the proposed joint scheme is compared with a recently proposed approach for massive MIMO systems. The results show that, with the proposed joint design, the number of antenna elements does not influence the eavesdropper channel capacity, which is proved to be equal to zero, in contrast to previous approaches.

Abstract
Predicting the inherent traffic behaviour of a network is an essential task, which can be used for various purposes, such as monitoring and managing the network's infrastructure. However, the recent surge of dynamic environments, such as Internet of Things and Cloud Computing have hampered this task. This means that the traffic on these networks is even more complex, displaying a nonlinear behaviour with specific aperiodic characteristics during daily operation. Traditional network traffic predictors are usually based on large historical data bases which are used to train algorithms. This may not be suitable for these highly volatile environments, where the strength of the force exerted in the interaction between past and current values may change quickly with time. In light of this, a taxonomy for network traffic prediction models, including the review of state of the art, is presented here. In addition, an analysis mechanism, focused on providing a standardized approach for evaluating the best candidate predictor models for these environments, is proposed. These contributions favour the analysis of the efficacy and efficiency of network traffic prediction among several prediction models in terms of accuracy, historical dependency, running time and computational overhead. An evaluation of several prediction mechanisms is performed by assessing the Normalized Mean Square Error and Mean Absolute Percent Error of the values predicted by using traces taken from two real case studies in cloud computing.

Abstract
In this paper we analyze the information propagated through three social networks. Previous research has shown that most of the messages posted on Twitter are truthful, but the service is also used to spread misinformation and false rumors. In this paper we focus on the search for automatic methods for assessing the relevance of a given set of posts. We first retrieved from social networks, posts related to trending topics. Then, we categorize them as being news or as being conversational messages, and assessed their credibility. From the gained insights we used features to automatically assess whether a post is news or chat, and to level its credibility. Based on these two experiments we built an automatic classifier. The results from assessing our classifier, which categorizes posts as being relevant or not, lead to a high balanced accuracy, with the potential to be further enhanced.