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.

Multiuser detection in a dynamic environment — Part II: Joint user identification and parameter estimation

The problem of jointly estimating the number, the identities, and the data of active users in a time-varying multiuser environment was examined in a companion paper (IEEE Trans. Information Theory, vol. 53, no. 9, September 2007), at whose core was the use of the theory of finite random sets on countable spaces. Here we extend that theory to encompass the more general problem of estimating unknown continuous parameters of the active-user signals. This problem is solved here by applying the theory of random finite sets constructed on hybrid spaces. We doso deriving Bayesian recursions that describe the evolution withtime of a posteriori densities of the unknown parameters and data.Unlike in the above cited paper, wherein one could evaluate theexact multiuser set posterior density, here the continuous-parameter Bayesian recursions do not admit closed-form expressions. To circumvent this difficulty, we develop numerical approximationsfor the receivers that are based on Sequential Monte Carlo (SMC)methods (“particle filtering”). Simulation results, referring to acode-divisin multiple-access (CDMA) system, are presented toillustrate the theory.

Sequential estimation of multipath MIMO-OFDM channels

Wireless “MIMO” systems, employing multiple transmit and receive antennas, promise a significant increase of channel capacity, while orthogonal frequency-division multiplexing (OFDM) is attracting a good deal of attention due to its robustness to multipath fading. Thus, the combination of both techniques is an attractive proposition for radio transmission. The goal of this paper is the description and analysis of a new and novel pilot-aided estimator of multipath block-fading channels. Typical models leading to estimation algorithms assume the number of multipath components and delays to be constant (and often known), while their amplitudes are allowed to vary with time. Our estimator is focused instead on the more realistic assumption that the number of channel taps is also unknown and varies with time following a known probabilistic model. The estimation problem arising from these assumptions is solved using Random-Set Theory (RST), whereby one regards the multipath-channel response as a single set-valued random entity.Within this framework, Bayesian recursive equations determine the evolution with time of the channel estimator. Due to the lack of a closed form for the solution of Bayesian equations, a (Rao–Blackwellized) particle filter (RBPF) implementation ofthe channel estimator is advocated. Since the resulting estimator exhibits a complexity which grows exponentially with the number of multipath components, a simplified version is also introduced. Simulation results describing the performance of our channel estimator demonstrate its effectiveness.

Low-density parity-check codes for nonergodic block-fading channels

We design powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Since optimal constructions for maximum-likelihood decoding do not performwell under iterative decoding, we introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes favorably with multiplexed parallel turbo codes for nonergodic channels.

Sequential estimation of time-varying multipath channel for MIMO-OFDM systems

In this paper, we introduce a pilot-aided multipath channel estimator for Multiple-Input Multiple-Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) systems. Typical estimation algorithms assume the number of multipath components and delays to be known and constant, while theiramplitudes may vary in time. In this work, we focus on the more realistic assumption that also the number of channel taps is unknown and time-varying. The estimation problem arising from this assumption is solved using Random Set Theory (RST), which is a probability theory of finite sets. Due to the lack of a closed form of the optimal filter, a Rao-Blackwellized Particle Filter (RBPF) implementation of the channel estimator is derived. Simulation results demonstrate the estimator effectiveness.

Silver space-time trellis-coded modulation

Silver Code (SilC) was originally discovered in [1–4] for 2×2 multiple-input multiple-output (MIMO) transmission. It has non-vanishing minimum determinant 1/7, slightly lower than Golden code, but is fast-decodable, i.e., it allows reduced-complexity maximum likelihood decoding [5–7]. In this paper, we present a multidimensional trellis-coded modulation scheme for MIMO systems [11] based on set partitioning of the Silver Code, named Silver Space-Time Trellis Coded Modulation (SST-TCM). This lattice set partitioning is designed specifically to increase the minimum determinant. The branches of the outer trellis code are labeled with these partitions. Viterbi algorithm is applied for trellis decoding, while the branch metrics are computed by using a sphere-decoding algorithm. It is shown that the proposed SST-TCM performs very closely to the Golden Space-Time Trellis Coded Modulation (GST-TCM) scheme, yetwith a much reduced decoding complexity thanks to its fast-decoding property.

Multiuser detection with an unknown number of active users: receiver design

In multiuser detection, the set of users active at any time may be unknown to the receiver. In these conditions, optimum reception consists of detecting simultaneously the set of activeusers and their data, problem that can be solved exactly by applying random-set theory (RST) and Bayesian recursions (BR). However, implementation of optimum receivers may be limited by their complexity, which grows exponentially with the number of potential users. In this paper we examine three strategies leading to reduced-complexity receivers.In particular, we show how a simple approximation of BRs enables the use of Sphere Detection (SD) algorithm, whichexhibits satisfactory performance with limited complexity.

The left-right dimension in Latin America

We present voters' self-placement and 68 political party locations on the left-right dimension in 17 Latin American countries. Innovative calculations are based on data from Latinobarometer annual surveys from 1995 to 2002. Our preliminary analysis of the results suggests that most Latin American voters are relatively highly ideological and rather consistently located on the left-right dimension, but they have very high levels of political alienation regarding the party system. Both voters' self-placement and the corresponding party locations are presently highly polarized between the center and the right, with a significant weakness of leftist or broadly appealing 'populist' positions.

Desenvolupament de projectes

Desenvolupament autònom d’un projecte de manera anàloga al mode operatiu de treball en l’àmbit laboral privat.

Resolución de problemas de materiales como herramienta de aprendizaje autónomo

El principal objetivo de la actividad es proporcionar herramientas al alumnado para consolidar losconocimientos teóricos adquiridos en el ámbito de los materiales, mediante aprendizaje autónomobasado en la resolución de ejercicios prácticos.

Disseny i execució autònoma d'una pràctica d'extensometria

Desenvolupar una activitat d’aprenentatge autònom basada en l’aplicació pràctica dels coneixements adquirits a l’assignatura Anàlisis experimental de tensions (4t curs EA) i/o Tècniques d’anàlisi de tensions (4t curs EI). Els objectius parcials serien definir el guió bàsic així com el mode d’avaluació i retroacció.

Treball de selecció de materials

L’objectiu principal de l’activitat és desenvolupar l’aprenentatge autònom mitjançant eldesenvolupament d’un treball en grup relacionat amb l’àmbit dels materials.

Anàlisi científic d'una escena de pel·lícula on no es verifiquin les lleis de la física

Es pretén que l'alumne sàpiga aplicar els conceptes apresos a classe en un context diferent a l’habitual. L’alumne ha de saber discernir entre els conceptes físics ben aplicats i els que no ho estan, ha de ser prou crític com per detectar errors en l’aplicació dels conceptes físics estudiats a classe i saber extreure la informació adequada de les diferents situacions a que s’han d’enfrontar.

Elaboració i presentació d’un pòster a una jornada de divulgació

Es pretén que els alumnes, en grups de dos o de forma individual, desenvolupin un problema relacionat amb l’assignatura “relativitat especial i ho presentin en format de pòster, primer a l’aula i desprès davant d’un públic aliè a l’assignatura, però amb certa formació i interès científic.

Bateries de qüestions bàsiques de materials

Fomentar l’estudi i l’aprenentatge autònom de continguts bàsics de les assignatures troncals de materials (Fonaments de Ciència dels Materials, Tecnologia dels Materials i Materials Aeroespacials), de les titulacions d’Enginyeria Industrial i Enginyeria Aeronàutica.