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.

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.

Assinatura Digital Foco Smart Card

A assinatura digital é um processo de assinatura electrónica baseado no sistema criptográfico assimétrico composto por um algoritmo ou série de algoritmos, mediante o qual é gerado um par de chaves assimétricas exclusivas e complementares. Tal como a assinatura manuscrita, a assinatura digital não pode ser falsificada, pelo que se adiciona uma função hash ao valor da chave gerada, para garantir a segurança do sistema. A assinatura digital permite, ao mesmo tempo, a identificação positiva do autor de uma mensagem (ou do signatário de um documento) e a verificação da integridade da mesma. Refira-se, porém, que a assinatura digital pode ser anexa a qualquer mensagem, seja esta decifrada ou não, apenas para que o receptor tenha a certeza da identidade do emissor e de que a mensagem chegou intacta ao destino. Baseia-se na criptografia da chave pública, que usa um algoritmo de duas chaves, a privada e a pública, diferentes mas matematicamente associadas: a primeira cria a assinatura digital e decifra os dados; a segunda verifica a assinatura e devolve-a ao formato original. O autor da mensagem mantém secreta a sua chave privada e divulga a chave pública, e vice-versa. A identidade do dono da chave pública é atestada pelo certificado digital emitido por uma entidade certificadora (uma espécie de notário). Independentemente da forma que assume, a assinatura electrónica, e a digital em particular, deve cumprir três funções: a autenticação (tal como acontece com o habitual gatafunho a que chamamos assinatura, apenas o indivíduo deve ser capaz de a reproduzir); não repudiação (quando o indivíduo assina não pode voltar atrás); e integridade (é necessário assegurar que os documentos assinados não são alterados sem o consentimento dos signatários).

Implementació d'un gestor de contrasenyes online

Aquest TFC proposa la implementació d'un gestor de contrasenyes online que ha de garantir unes funcionalitats mínimes de desar i recuperar contrasenyes alhora que ha de garantir la confidencialitat de les dades emmagatzemades al servidor.

Las Políticas de firma electrónica en la administración electrónica

Aquest treball analitza el contingut de la norma tècnica d’interoperabilitat de política de signatura electrònica i de certificats de l’Administració, que desplega el reial decret 4/2010, de 8 de gener, pel qual es regula l’Esquema Nacional d’Interoperabilitat en l’àmbit de l’Administració electrònica, així com d’altres normes directament relacionades, com la referida a document electrònic o als estàndards d’ús per part de les Administracions en el procediment administratiu electrònic.

Bases teóricas y herramientas para el análisis y comparación de sistemas de votación de código abierto

En la propuesta de proyecto del IMI (Instituto Municipal de Informática) se fija como objetivo la definición, arquitectura y diseño de un sistema informático distribuido que permita la realización de consultas populares, garantizando la confidencialidad, seguridad, sincronía y posibilidad de acceso móvil.

NoFeud : Privacitat per a xarxes socials

Aquest treball fi de carrera és un estudi-prototip d'un model de privacitat per a xarxes socials on els missatges són visibles només per a qui comparteix un cert nombre d'amics en comú, fent servir els algorismes RSA i la compartició de secrets de Shamir. Per realitzar el prototip s'ha creat un plugin de Google Chrome per a la part de client i per a la part de servidor un servei en NodeJS i l'emmagatzematge en una base de dades NoSQL mongoDB, que són tecnologies emergents dins del desenvolupament web; per tant, tot el codi ha estat escrit en JavaScript.

ZigBee/ZigBee PRO security assessment based on compromised cryptographic keys

Sensor networks have many applications in monitoring and controlling of environmental properties such as sound, acceleration, vibration and temperature. Due to limitedresources in computation capability, memory and energy, they are vulnerable to many kinds of attacks. The ZigBee specification based on the 802.15.4 standard, defines a set of layers specifically suited to sensor networks. These layers support secure messaging using symmetric cryptographic. This paper presents two different ways for grabbing the cryptographic key in ZigBee: remote attack and physical attack. It also surveys and categorizes some additional attacks which can be performed on ZigBee networks: eavesdropping, spoofing, replay and DoS attacks at different layers. From this analysis, it is shown that some vulnerabilities still in the existing security schema in ZigBee technology.

Visualizing key authenticity: turning your face into your public key

La informació biomètrica s'ha convertit en una tecnologia complementària a la criptografia que permet administrar còmodament les dades criptogràfiques. Són útils dues necessitats importants: en primer lloc, posar aquestes dades sempre a mà i, a més, fent fàcilment identificable el seu legítim propietari. En aquest article es proposa un sistema que integra la signatura biomètrica de reconeixement facial amb un esquema de signatura basat en la identitat, de manera que la cara de l'usuari esdevé la seva clau pública i la ID del sistema. D'aquesta manera, altres usuaris poden verificar els missatges utilitzant fotos del remitent, proporcionant un intercanvi raonable entre la seguretat del sistema i la usabilitat, així com una manera molt més senzilla d'autenticar claus públiques i processos de distribució.

A Secure Cooperative Sensing Protocol for Cognitive Radio Networks

Cognitive radio networks sense spectrum occupancyand manage themselves to operate in unused bands without disturbing licensed users. Spectrum sensing is more accurate if jointly performed by several reliable nodes. Even though cooperative sensing is an active area of research, the secureauthentication of local sensing reports remains unsolved, thus empowering false results. This paper presents a distributed protocol based on digital signatures and hash functions, and ananalysis of its security features. The system allows determining a final sensing decision from multiple sources in a quick and secure way.

A Secure Mobile-based Authentication System

Financial information is extremely sensitive. Hence, electronic banking must provide a robust system to authenticate its customers and let them access their data remotely. On the other hand, such system must be usable, affordable, and portable.We propose a challengeresponse based one-time password (OTP) scheme that uses symmetriccryptography in combination with a hardware security module. The proposed protocol safeguards passwords from keyloggers and phishing attacks.Besides, this solution provides convenient mobility for users who want to bank online anytime and anywhere, not just from their owntrusted computers.

Gestión de confianza en redes ad hoc

El despliegue de un esquema de confianza es fundamental para poder desarrollar servicios de seguridad que permitan administrar y operar una red. Sin embargo, las soluciones empleadas en las redes tradicionales no se adaptan a un entorno ad hoc debido a la naturaleza dinámica y sin infraestructura de estas redes. En el presente trabajo se propone un esquema de confianza práctico y eficiente basado en una infraestructura de clave pública distribuida, umbral y jerárquica, que no requiere sincronización temporal entre todos los nodos de la red. La autorización de usuarios en el sistema se hace a través de certificados de corta duración que eliminan la necesidad de mantener la publicación y diseminación de unas listas de revocación. Por otro lado, una entidad externa de confianza permite alargar la reputación de un usuario de la red más allá de la existencia de la propia red.

Implementation of the Rijndael-AES algorithm on a Sage-Math worksheet

La principal motivació d'aquest treball ha estat implementar l'algoritme Rijndael-AES en un full Sage-math, paquet de software matemàtic de lliure distribució i en actual desenvolupament, aprofitant les seves eines i funcionalitats integrades.

Implementació d'un sistema de votació sobre la xifra de Paillier i ElGamal

En aquest treball s'ha implementat la prova de Peng per demostra la correctesa d'un procés de mescla de vots, xifrats amb la xifra de Paillier. A continuació s'ha dissenyat una modificació per treballar amb la xifra de ElGamal additiu. Finalment s'ha comparat les dues implementacions.