Analysis and Design of a secure WLAN solution for Cobre Las Cruces

Cobre Las Cruces is a renowned copper mining company located in Sevilla, with unexpected problems in wireless communications that have a direct affectation in production. Therefore, the main goals are to improve the WiFi infrastructure, to secure it and to detect and prevent from attacks and from the installation of rogue (and non-authorized) APs. All of that integrated with the current ICT infrastructure.This project has been divided into four phases, although only two of them have been included into the TFC; they are the analysis of the current situation and the design of a WLAN solution.Once the analysis part was finished, some weaknesses were detected. Subjects such as lack of connectivity and control, ignorance about installed WiFi devices and their localization and state and, by and large, the use of weak security mechanisms were some of the problems found. Additionally, due to the fact that the working area became larger and new WiFi infrastructures were added, the first phase took more time than expected.As a result of the detailed analysis, some goals were defined to solve and it was designed a centralized approach able to cope with them. A solution based on 802.11i and 802.1x protocols, digital certificates, a probe system running as IDS/IPS and ligthweight APs in conjunction with a Wireless LAN Controller are the main features.

A Monte Carlo method for accelerating the computation of animated radiosity sequences

Realistic rendering animation is known to be an expensive processing task when physically-based global illumination methods are used in order to improve illumination details. This paper presents an acceleration technique to compute animations in radiosity environments. The technique is based on an interpolated approach that exploits temporal coherence in radiosity. A fast global Monte Carlo pre-processing step is introduced to the whole computation of the animated sequence to select important frames. These are fully computed and used as a base for the interpolation of all the sequence. The approach is completely view-independent. Once the illumination is computed, it can be visualized by any animated camera. Results present significant high speed-ups showing that the technique could be an interesting alternative to deterministic methods for computing non-interactive radiosity animations for moderately complex scenarios

An electronic voting platform with elliptic curve cryptography

The future of elections seems to be electronic voting systems du to its advantatges over the traditional voting. Nowadays, there are some different paradigms to ensure the security and reliability of e-voting. This document is part of a wider project which presents an e-Voting platform based on elliptic curve cryptography. It uses an hybrid combination of two of the main e-Voting paradigms to guarantee privacy and security in the counting phase, these are precisely, the mixnets and the homomorphic protocols. This document is focused in the description of the system and the maths and programming needed to solve the homomorphic part of it. In later chapters, there is a comparison between a simple mixing system and our system proposal.

On the computational security of a distributed key distribution scheme

In a distributed key distribution scheme, a set of servers helps a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a noncorrupted group. In this work, we formalize the security analysis of one such scheme which was not considered in the original proposal. We prove the scheme is secure in the random oracle model, assuming that the Decisional Diffie-Hellman (DDH) problem is hard to solve. We also detail a possible modification of that scheme and the one in which allows us to prove the security of the schemes without assuming that a specific hash function behaves as a random oracle. As usual, this improvement in the security of the schemes is at the cost of an efficiency loss.

Not the right job but a secure one : over-education and temporary employment in France, Italy and Spain

Resorting to four waves of the European Community Household Panel, this research explores the association between temporary employment and the likelihood of being over-educated. Such an association has been largely ignored by the literature explaining over-education, more inclined to attribute such a mismatch to the system of education. Selecting three similarly standarised and stratified systems of education (France, Italy and Spain) and controlling for many other variables likely to affect over-education, like gender, age, tenure, job change, firm size or sector, the paper demonstrates that such an association between temporary employment and over-education exists. Being a stepping stone towards a more stable and adjusted position in the labour market, holding a temporary employment may be associated to a higher likelihood of being over-educated. Such an association is more likely in Italy and France. Yet, the opposite sign prevails where permanent employment becomes such a valuable asset as to make individuals trade human capital by employment security. This is the case of Spain.

Computation of multiple correspondence analysis, with code in R

The generalization of simple correspondence analysis, for two categorical variables, to multiple correspondence analysis where they may be three or more variables, is not straighforward, both from a mathematical and computational point of view. In this paper we detail the exact computational steps involved in performing a multiple correspondence analysis, including the special aspects of adjusting the principal inertias to correct the percentages of inertia, supplementary points and subset analysis. Furthermore, we give the algorithm for joint correspondence analysis where the cross-tabulations of all unique pairs of variables are analysed jointly. The code in the R language for every step of the computations is given, as well as the results of each computation.

Negativity effect in multiparty electoral competition

We construct a dynamic voting model of multiparty competition in order to capture the following facts: voters base their decision on past economicperformance of the parties, and parties and candidates have different objectives. This model may explain the emergence of parties' ideologies,and shows the compatibility of the different objectives of parties and candidates. Together, these results give rise to the formation ofpolitical parties, as infinetely-lived agents with a certain ideology, out of the competition of myopic candidates freely choosing policy positions. We also show that in multicandidate elections held under the plurality system, Hotelling's principle of minimum differentiation is no longer satisfied.

Topological computation of local cohomology multiplicities.

We express the Lyubeznik numbers of the local ring of a complex isolated singularity in terms of Betti numbers of the associated real link.

Analog circuit for real-time computation of respiratory mechanical impedance in sleep studies

The aim of this work was to develop a low-cost circuit for real-time analog computation of the respiratory mechanical impedance in sleep studies. The practical performance of the circuit was tested in six patients with obstructive sleep apnea. The impedance signal provided by the analog circuit was compared with the impedance calculated simultaneously with a conventional computerized system. We concluded that the low-cost analog circuit developed could be a useful tool for facilitating the real-time assessment of airway obstruction in routine sleep studies.

Computation of arbitrarily constrained synthetic discriminant functions

An algorithm for computing correlation filters based on synthetic discriminant functions that can be displayed on current spatial light modulators is presented. The procedure is nondivergent, computationally feasible, and capable of producing multiple solutions, thus overcoming some of the pitfalls of previous methods.

Analog circuit for real-time computation of respiratory mechanical impedance in sleep studies

The aim of this work was to develop a low-cost circuit for real-time analog computation of the respiratory mechanical impedance in sleep studies. The practical performance of the circuit was tested in six patients with obstructive sleep apnea. The impedance signal provided by the analog circuit was compared with the impedance calculated simultaneously with a conventional computerized system. We concluded that the low-cost analog circuit developed could be a useful tool for facilitating the real-time assessment of airway obstruction in routine sleep studies.

Esquemes de xifrat homomòrfics per a votació electrònica

This bachelor's degree thesis deals with homomorphic public-key cryptography, or in other words cryptosystems with special addition properties. Such cryptosystems are widely used in real life situations, for instance to make electronic voting secure. In Chapter 1 a few basic algebra results and other key concepts are introduced. Chapters 2 and 3 contain the algorithms and properties of the two cryptosystems which are considered to be the best for e-voting: Paillier and Joye-Libert. The thesis is concluded in Chapter 4, by comparing running times of the two above-mentioned cryptosystems, in simulations of real-life e-voting systems, with up to tens of thousands of voters, and different levels of security. Through these simulations, we discern the situations where each of the two cryptosystems is preferable.

Promoting the development of secure mobile agent applications

Peer-reviewed

Towards secure mobile P2P applications using JXME

Mobile devices have become ubiquitous, allowing the integration of new information from a large range of devices. However, the development of new applications requires a powerful framework which simplifies their construction. JXME is the JXTA implementation for mobile devices using J2ME, its main value being its simplicity when creating peer-to-peer (P2P) applications on limited devices. On that regard, an issue that is becoming veryimportant in the recent times is being able to provide a security baseline to such applications. This paper analyzes the currentstate of security in JXME and proposes a simple security mechanism in order to protect JXME applications against a broad range of vulnerabilities.